Competitive Programming/DSA Course | Hindi
4.0
(2)
35 learners
What you'll learn
This course includes
- 35.3 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 112 lessons • 35.3 hours of video
Competitive Programming/DSA Course | Hindi
112 lessons
• 35.3 hours
Competitive Programming/DSA Course | Hindi
112 lessons
• 35.3 hours
- Ultimate Competitive Programming Course for FREE: The Beginning | EP 0 09:34
- Replace all HEADER FIlES with one SINGLE HEADER FILE in C++ | Coding Tips #shorts 00:42
- Best Competitive Coding Setup for Linux, Windows and MAC OS | Sublime Text | CP Course | EP 1 13:56
- C++ Basics for Competitive Programming - Part 1 | CP Course | EP 2 20:23
- Overflow, Precision Errors, Calculation Order | C++ Basics - Part 2 | CP Course | EP 3 20:32
- Conditions, Loops, Jump Statements and Questions | C++ Basics - Part 3 | CP Course | EP 4 27:45
- C++ Strings, Getline and Big Numbers for Competitive Programming | C++ Basics 4 | CP Course | EP 5 22:57
- Why YOU should use STRING PUSHBACK instead of STRING CONCATENATION ? #shorts 00:50
- Arrays and Size Limits for Local & Global Arrays | C++ Basics 5 | CP Course | EP 6 16:25
- Why GLOBAL Arrays can have LARGER size than LOCAL Arrays in C/C++ ? #shorts 00:57
- Functions, C++ references and CONTEST ALERT Information | C++ Basics - 6 | CP Course | EP 7 24:05
- Pointers in Deep and Easiest Way | C/C++ | Competitive Programming Course | EP 8 24:58
- Discussing 1st Beginner Competitive Programming Contest Live 02:14:13
- Verdicts & Errors on Online Coding Websites Explained | Competitive Programming Course | EP 9 20:08
- Time Complexity Analysis and Constraints | Competitive Programming Course | EP 10 27:09
- Space Complexity in 30 seconds for Competitive Programming #shorts 00:34
- Why Print answer modulo 10^9+7 | Modular Arithmetic | Competitive Programming Course | EP 11 14:58
- Pre-Computation Techniques Basics & Hashing | Competitive Programming Course | EP 12 18:57
- How to Hash Negative Numbers in Competitive Programming 🤔🤔 #shorts 00:36
- Pre-Computation using Prefix Sum in 1D/2D Arrays | Competitive Programming Course | EP 13 24:16
- Codechef GCDQ: Easy Medium Question on Prefix Computation | CP Course | EP 14 13:07
- Must Know Concept in Pre-Computation for every Competitive Programmer | CP Course | EP 15 15:11
- Prefix Sum + Hashing HARD Question | Competitive Programming Course | EP 16 22:14
- Beginners Competitive Programming Contest 2🔥🔥 | Register Fast 🔥🔥 #shorts 00:44
- Recursion from Scratch | Beginners Tutorial | Competitive Programming Course | Ep 17 16:21
- Digit Sum & Array Sum using Recursion | Beginners Tutorial | CP Course | Ep 18 11:49
- Merge Sort & Selection Sort Tutorial for Beginners | Competitive Programming Course | EP 19 29:24
- C++ STL : Full Overview in 10 Minutes | Competitive Programming Course | EP 20 09:54
- Pairs and Vectors: C++ STL Tutorial for Beginners | Competitive Programming Course | EP 21 21:10
- Nesting In Vectors: C++ STL For Beginners | Competitive Programming Course | EP 22 16:53
- ITERATORS: Pointer like structure in C++ STL | Competitive Programming Course | EP 23 12:16
- How to write Iterators Code in Short in C++ STL ? | Auto and Range based loops | CP COURSE | EP 24 08:42
- Everything about C++ STL MAPS - Part 1 | Competitive Programming Course | Episode 25 24:24
- Everything about C++ STL MAPS - Part 2: Unordered Maps & Multimaps | CP Course | Episode 26 09:28
- SET, UNORDERED SET & MULTISET : Beginners Tutorial for C+ STL | CP Course | EP 27 18:05
- STL Question: AC with Multiset, WA with Sets | Competitive Programming Course | EP 28 11:16
- Nesting in STL Maps and Sets with Example Questions | Competitive Programming Course | EP 29 26:15
- Stacks & Queues: C++ STL Tutorials | Competitive Programming Course | EP 30 10:36
- Balanced Brackets Matching: Easiest Code using Stack | CP Course | EP 31 18:37
- Next Greater Element using Stacks: Tutorial with Code | Competitive Programming Course | EP 32 20:47
- Inbuilt Sort in C++ STL Tutorial | Introsort | Competitive Programming Course | EP 33 07:30
- Comparator Function in depth Tutorial using C++ Sort | CP Course | EP 34 15:31
- Upper Bound and Lower Bound in C++ STL | CP Course | EP 35 13:29
- C++ STL Inbuilt Algorithms - Part1 | CP Course | EP 36 12:27
- Inbuilt STL Algorithms & Lambda Function - Part 2 | CP Course | EP 37 13:21
- Offline and Online Queries difference in Competitive Programming #shorts 00:41
- Generate Parenthesis: Advanced Recursion and Backtracking | CP Course | EP 38 23:22
- Subset Generation using Recursion and backtracking | CP Course | EP 39 13:56
- STL Competitive Programming Contest #shorts 00:24
- Binary Search & How I write it | Tutorial | CP Course | EP 40 18:26
- Implement Upper Bound & Lower Bound with Binary Search | CP Course | EP 41 11:56
- Nth Root of a Number using Binary Search | CP Course | EP 42 16:32
- Advanced Binary Search with Predicate Function | SPOJ EKO | CP Course | EP 43 23:05
- Advanced Binary Search with Predicate Function | SPOJ AGGRCOW | CP Course | EP 44 21:15
- Discussing 3rd Competitive Programming Contest Live | C++ STL 03:07:15
- How to Calculate Time Complexity In Recursion ? | CP Course | EP 45 13:22
- Ultimate MATHS & NUMBER THEORY COURSE for Competitive Programming COMING 06:54
- Binary Numbers and Bits Basics For Competitive Programming | EP 47 16:36
- PLAYING WITH BITS | Set, Unset, Count Bits | CP Course | EP 48 21:26
- 6 Amazing BIT Manipulation Ticks You must Know | CP Course | EP 49 22:57
- Power of XOR Operator | CP Course | EP 50 12:04
- What is Bit Masking with example Question | CP Course | EP 51 23:17
- How to GENERATE SUBSETS using Bit Masking | CP Course | EP 52 15:10
- GCD and LCM using Euclid's Algorithm With Applications | CP Course | EP 53 18:45
- Binary Exponentiation : Recursive Method | CP Course | EP 54.1 13:25
- Binary Exponentiation : Iterative Method | CP Course | EP 54.2 11:36
- Large Exponentiation using Binary Multiplication | CP Course | EP 55 15:49
- Large Exponentiation with ETF & Euler's Theorem | CP Course | EP 56.1 15:56
- Leetcode SuperPow : Large Exp, ETF & Euler's Theorem | CP Course | EP 56.2 09:56
- Basics of Factors and Divisors related problems | CP Course | EP 57 19:08
- Prime Check & Prime Factorisation | CP Course | EP 58 17:04
- Sieve Algorithm: How to find Prime Numbers Optimally ? | CP Course | EP 59 15:47
- These Sieve Variations will help you Solve many Number Theory Questions | CP Course | EP 60 15:45
- Modular Multiplicative Inverse : Modular Arithmetic for Division | CP Course | EP 61 16:50
- Number Theory Practice Question for Modular Multiplicative Inverse | CP Course | EP 62 10:13
- Must Do Sieve Questions | Easy Medium | CP Course | EP 63 18:21
- All Sieve Concepts in ONE Medium Hard Question | CP Course | EP 64.1 16:43
- All Sieve Concepts in ONE Medium Hard Question | Code | CP Course | EP 64.2 16:07
- Solve These Questions for Good BIT Manipulation Intuition | CP Course | EP 65 23:28
- Inclusion Exclusion Explained ! with Practice Question | CP Course | EP 66 20:15
- Graph/Trees Ultimate Free Course Incoming | Full Overview 07:09
- All the Tree/Graph Terminologies Explained | CP Course | EP 68 18:04
- How To Represent Trees and Graphs in Code | Adjacency Matrix & List | CP Course | EP 69 22:16
- Depth First Search | DFS : The Only Tutorial You need | CP Course | EP 70 34:39
- How to find Connected Components and Cycle in a Graph using DFS | CP Course | EP 71 23:16
- How To Solve Graph Matrix Problems using DFS | Leetcode Flood Fill | CP Course | EP 72 19:28
- How to DFS in a TREE | Height and Depth of a TREE | CP Course | EP 73 15:27
- Pre-Computation using DFS | Subtree Queries | CP Course | EP 74 12:37
- How to find Diameter of a Tree | CP Course | EP 75 12:28
- How to find Lowest Common Ancestor(LCA) in a Tree | CP Course | EP 76 12:45
- Edge Deletion Questions using DFS | Must Know Concept | CP Course | EP 77 13:39
- Breadth First Search | BFS : The Only Tutorial You need | CP Course | EP 78 24:01
- How to find Shortest Path using BFS | SPOJ NAKANJ | CP Course | EP 79 16:54
- 0-1 BFS: What is it, How to Code with Example Question | CP Course | EP 80 24:28
- Multi Source BFS: Tutorial with Code & Example Question | CP Course | EP 81 20:50
- Dijkstra Algorithm: Tutorial with Code & Example Question | CP Course | EP 82 30:56
- Floyd Warshall Algorithm: All Pair Shortest Path | Tutorial with Code | CP Course | EP 83 17:38
- Floyd Warshall Must Solve Question | Medium Hard | CP Course | EP 84 13:26
- Disjoint Set Union (DSU) Tutorial with Code | CP Course | EP 85 28:05
- Disjoint Set Union Practice Questions | Code Monk | CP Course | EP 86 16:20
- Kruskal's Algorithm: Minimum Spanning Tree Tutorial | CP Course | EP 87 14:17
- Google Interview Hard Question | Minimum Spanning Tree | CP Course | EP 88 21:35
- DYNAMIC PROGRAMMING ULTIMATE COURSE OVERVIEW | CP Course | EP 89 08:54
- Introduction to Dynamic Programming | Tutorial | CP Course | EP 90 22:19
- Frog 1 & 2: Atcoder 1D DP Questions | CP Course | EP 91 22:42
- Longest Increasing Subsequence (LIS) | Dynamic Programming | CP Course | EP 92 16:34
- Coin Change 1 & 2 : Leetcode DP Questions | CP Course | EP 93 25:17
- Knapsack Concept and Variations: Dynamic Programming | EP 94 12:11
- Knapsack 2 Atcoder Tutorial With Code: Dynamic Programming | CP Course| EP 96 18:05
- ROD CUTTING: Dynamic Programming | CP Course| EP 97 11:24
- SUBSET SUM & PARTITION PROBLEM : Dynamic Programming | CP Course| EP 98 17:28
- Longest Common Subsequence: Dynamic Programming | CP Course | EP 99 21:19
Take this course with you
Download the app to continue lessons from your phone anytime.
