About

This work reflects my effort to address the challenge of maintaining consistency in competitive coding practice, which is often difficult to sustain. To tackle this, I organized a small group consisting of peers from previous course offering from RKMVERI who share an interest in competitive coding. We meet biweekly to discuss selected problems based on specific topics using Google Meet. During these sessions, we explore algorithms, design optimal solutions, and submit them on LeetCode to evaluate their time complexity. I chose Python as the primary language for this activity mainly due to personal preference. Python is widely used in machine learning and deep learning, and its ability to support rapid prototyping makes it especially convenient. It allows us to implement solutions quickly with minimal code, which is well-suited to the goals of this group.

From a career perspective, proficiency in competitive coding and data structures and algorithms is crucial. Whether applying for software development positions or research scientist roles, most industry jobs require a screening process that involves solving such problems. Engaging in these biweekly sessions helps me approach this otherwise mundane task with more motivation and accountability. Initially, I believed that regular practice in competitive coding would build the kind of muscle memory needed to excel. However, I realized that the problems I will eventually face may differ and may not require the same type of muscle memory to succeed. Nevertheless, these sessions remain valuable, as they provide a structured opportunity to meet, discuss interesting problems, and keep up the practice consistently.

We will begin with data structures and algorithmic problem-solving before gradually moving on to competitive coding. It is important to note that competitive coding is challenging without a solid understanding of data structures, and most companies focus heavily on DSA questions during job interviews. For the first three to four months, we will practice DSA problems on LeetCode, after which we will shift to solving competitive programming challenges on Codeforces. We might shift to C++ or related languages for efficiency, but still not sure if we make it to that stage.

Meeting Schedule

August 16, 2025
Session #1 (19 problems discussed on Arrays)

Problems Covered:

53. Maximum Subarray
Medium Arrays
978. Longest Turbulent Subarray
Medium Arrays
219. Contains Duplicate II
Easy Arrays
1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold
Medium Arrays
209. Minimum Size Subarray Sum
Medium Arrays
3. Longest Substring Without Repeating Characters
Medium Arrays
125. Valid Palindrome
Easy Arrays
167. Two Sum II - Input Array Is Sorted
Medium Arrays
26. Remove Duplicates from Sorted Array
Easy Arrays
80. Remove Duplicates from Sorted Array II
Medium Arrays
11. Container With Most Water
Medium Arrays
42. Trapping Rain Water (Revisit)
Hard Arrays
303. Range Sum Query - Immutable
Easy Arrays
724. Find Pivot Index (Revisit)
Easy Arrays
238. Product of Array Except Self (Revisit)
Medium Arrays
560. Subarray Sum Equals K (Revisit)
Medium Arrays
918. Maximum Sum Circular Subarray (Revisit)
Medium Arrays
424. Longest Repeating Character Replacement (Revisit)
Medium Arrays
304. Range Sum Query 2D - Immutable (Revisit)
Medium Arrays
📄 Download Session Notes PDF Attendance
August 30, 2025
Session #2

Problems Covered:

876. Middle of the Linked List
Easy Linked List
2130. Maximum Twin Sum of a Linked List
Medium Linked List
141. Linked List Cycle
Easy Linked List
142. Linked List Cycle II
Medium Linked List
287. Find the Duplicate Number (Revisit)
Medium Linked List
📄 Download Session Notes PDF Attendance
Python Code
Loading code...