There are no items in your cart
Add More
Add More
| Item Details | Price | ||
|---|---|---|---|
Instructor: Chirag
Language: English , Hindi
Validity Period: Lifetime
Learn Competitive Programming from scratch and build strong problem-solving skills. This course starts with programming fundamentals and gradually covers DSA, algorithms, and interview-level coding patterns. You'll solve real LeetCode and Codeforces problems while learning optimized approaches used in placements and coding contests.
What you'll learn:
Programming fundamentals
Arrays, Strings & Recursion
Time & Space Complexity
DSA (Stack, Queue, Linked List, Trees, Graphs)
Algorithms (Binary Search, Sliding Window, Greedy, DP)
LeetCode & Codeforces problem solving
| First Program | |||
| Hello World | |||
| Input Output Formatting | |||
| Sum of Two Integers | |||
| Data Type | |||
| Integer Overflow | |||
| Type Casting | |||
| Boolean Logic | |||
| Character Arithmetic | |||
| Operator | |||
| Difference of Two Integers | |||
| Product of Two Integers | |||
| Perform Arithmetic Operations | |||
| Update Score | |||
| Bank Balance | |||
| Decision Making – If Else | |||
| Leap Year | |||
| Positive Negative or Zero | |||
| Voting Eligibility | |||
| Grade Calculator | |||
| Loops | |||
| Print Numbers 1 to N | |||
| Sum of First N Numbers | |||
| Multiplication Table | |||
| Count Digits | |||
| Reverse a Number | |||
| Printing Patterns – Moderate | |||
| Number Triangle | |||
| Reverse Number Triangle | |||
| Diamond Pattern | |||
| Numbers | |||
| Sum of Digits | |||
| REVERSE A DIGITS | |||
| PALINDROME NUMBER | |||
| Fizz Buzz | |||
| Count the Digits That Divide a Number | |||
| Check Divisibility by Digit Sum and Product` | |||
| Array | |||
| NITHER MINIMUM NOR MAXIMUM | |||
| REVERSE ARRAY | |||
| LARGST ELEMNT IN ARRAY | |||
| MAXIMUM CONSECUTIVE 1S | |||
| SECOND LARGEST ELEMENT | |||
| MAXIMUM PRODUCT OF THREE NUMBERS | |||
| ROTATE ARRAY | |||
| MOVE ZEROES | |||
| SORT COLORS | |||
| BEST TIME TO BUY AND SHELL STOCK | |||
| FIND PEAK ELEMENT | |||
| Valid Mountain Array | |||
| Hashmap | |||
| CONTAINS DUPLICATE | |||
| MAJORITY ELEMENTS | |||
| MAJORITY ELEMENTS II | |||
| Distribute Candies | |||
| Intersection of Two Arrays | |||
| Intersection of Two Arrays|| | |||
| At Least K Occurrences | |||
| Check Equal Arrays | |||
| First Unique Character in a String | |||
| First Letter to Appear Twice | |||
| Unique Number of Occurrences | |||
| Rank Transform of an Array | |||
| VALID ANAGRAM | |||
| TWO SUM | |||
| String | |||
| Largest Odd Number in String | |||
| 14. Longest Common Prefix | |||
| 796. Rotate String | |||
| 242. Valid Anagram | |||
| 43. Multiply Strings | |||
| 709. To Lower Case | |||
| 58. Length of Last Word | |||
| 434. Number of Segments in a String | |||
| 541. Reverse String II | |||
| 345. Reverse Vowels of a String | |||
| 2D array | |||
| Search in a Matrix | |||
| Sum Of Matrix | |||
| Add of 2 Square Matrices | |||
| Row Sum in a Matrix | |||
| TWO DIMENSIONAL WORLD | |||
| MATRIX DIAGONAL SUM | |||
| TRANSPOSE MATRIX | |||
| TOEPLITZ MATRIX | |||
| FIND A PEAK ELEMENT II | |||
| SEARCH A 2D MATRIX | |||
| Diagonal Traverse | |||
| Set Matrix Zeroes | |||
| Search a 2D Matrix II | |||
| Spiral Matrix | |||
| Rotate Image | |||
| Stack & Queue | |||
| Previous Smaller Element | |||
| Previous Greater Element | |||
| Next Smaller Element | |||
| Next Greater Element | |||
| Reverse a Stack | |||
| Sort a stack | |||
| Valid Parentheses | |||
| Online Stock Span | |||
| Baseball Game | |||
| Remove Outermost Parentheses | |||
| Asteroid Collision | |||
| Largest Rectangle in Histogram | |||
| Queue Reversal | |||
| Number of Recent Calls | |||
| Stream First Non-repeating | |||
| Number of Recent Calls | |||
| Implement Queue using Stacks | |||
| Implement Stack using Queues | |||
| Linked List | |||
| Length of Linked List | |||
| Search in Linked List | |||
| Linked List End Insertion | |||
| Linked List Insertion At Beginning | |||
| Delete Head of Linked List | |||
| Deletion at the end of a Linked List | |||
| Middle of a Linked List | |||
| Linked List Cycle | |||
| Middle of the Linked List | |||
| Remove Linked List Elements | |||
| Remove Nth Node From End of List | |||
| Linked List Cycle II | |||
| Reverse Linked List | |||
| Palindrome Linked List | |||
| Binary Search | |||
| Binary Search | |||
| Implement Lower Bound | |||
| Implement Upper Bound | |||
| Search Insert Position | |||
| Sqrt(x) | |||
| FIND PEAK ELEMENT | |||
| Find Minimum in Rotated Sorted Array | |||
| Search in Rotated Sorted Array | |||
| Search in Rotated Sorted Array II | |||
| Peak Index in a Mountain Array | |||
| Koko Eating Bananas | |||
| Find the Smallest Divisor Given a Threshold | |||
| Capacity To Ship Packages Within D Days | |||
| Minimum Number of Days to Make m Bouquets | |||
| Sliding Window | |||
| Max Sum Subarray of size K | |||
| Count Occurences of Anagrams | |||
| First Negative in Windows of Size K | |||
| Maximum Average Subarray I | |||
| Find All Anagrams in a String | |||
| Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | |||
| K Sized Subarray Maximum | |||
| Chocolate Distribution Problem | |||
| Minimum Recolors to Get K Consecutive Black Blocks | |||
| K Radius Subarray Averages | |||
| Maximum Sum of Distinct Subarrays With Length K | |||
| Minimum Difference Between Highest and Lowest of K Scores | |||
| Smallest subarray with sum greater than x | |||
| Longest Substring Without Repeating Characters | |||
| Fruit Into Baskets | |||
| Max Consecutive Ones III | |||
| Get Equal Substrings Within Budget | |||
| Binary Tree | |||
| Preorder | |||
| Inorder | |||
| Postorder Traversal | |||
| Level Order | |||
| Max Depth | |||
| Balanced Tree | |||
| Diameter | |||
| Same Tree | |||
| Zigzag Traversal | |||
| Boundary Traversal | |||
| Vertical Order | |||
| LCA | |||
| Max Path Sum | |||
| Recursion | |||
| Print n to 1 Without Loop | |||
| 1 to n Without Loop | |||
| Factorial | |||
| Sum of Natural Numbers | |||
| Fibonacci Number | |||
| Reverse Array | |||
| Array Search | |||
| Sum of Array | |||
| Check Sorted Array | |||
| Reverse String | |||
| Power of Two | |||
| Remove all occurrences of a character in a string | |||
| Palindrome String | |||
| Subsets | |||
| Subsets II | |||
| Binary Search Tree | |||
| Search BST | |||
| Insert BST | |||
| Delete BST | |||
| Validate BST | |||
| Kth Smallest | |||
| LCA in BST | |||
| BST Iterator | |||
| Recover BST | |||
| Graph | |||
| BFS | |||
| DFS | |||
| Number of Islands | |||
| Flood Fill | |||
| Cycle Detection BFS | |||
| Cycle Detection DFS | |||
| Topological Sort | |||
| Course Schedule | |||
| Dijkstra | |||
| Shortest Path DAG | |||
| Prim MST | |||
| Kruskal MST | |||
| test | |||
| Vanya and Fence | |||
| Brain's Photos | |||
| Vanya and Food Processor | |||
| Holiday Of Equality | |||
| K-th Not Divisible by n | |||
| Contest | |||
| The Runner-Up Score | |||
| Traffic Lane Compression | |||
| Best Profit Day | |||
| Opposite Ends Pair | |||
After successful purchase, this item would be added to your Library.
You can access the library in the following ways :