├── .github └── workflows │ └── youtube-workflow.yml ├── CSES ├── CPP solutions │ ├── Company Queries I.cpp │ ├── Company Queries II.cpp │ ├── Counting Paths.cpp │ ├── Distance Queries.cpp │ ├── Distinct Colors.cpp │ ├── Finding a Centroid.cpp │ ├── Subordinates.cpp │ ├── Tree Diameter.cpp │ ├── Tree Distances I.cpp │ ├── Tree Distances II.cpp │ └── Tree Matching.cpp ├── Graph Algorithms │ ├── Game Routes.cpp │ └── Longest Flight Route.cpp ├── Solutions.md └── Tree Algorithms │ ├── Company Queries I.cpp │ ├── Distinct Colors.cpp │ ├── Finding a Centroid.cpp │ ├── Subtree Queries.cpp │ ├── Tree Diameter.cpp │ └── Tree Distances II.cpp ├── Codeforces ├── Editorials │ ├── Greedy Algorithms │ │ ├── Creating a Schedule.cpp │ │ ├── Make It Good.cpp │ │ ├── Move Brackets.cpp │ │ ├── Pluses and Minuses.cpp │ │ └── RationalLee.cpp │ └── SQRT & Mo's Algorithm │ │ └── D. Cut and Stick.cpp └── Global Rounds │ └── Round 9 │ └── D. Replace by MEX.cpp ├── Geometry Course └── L03 - C++ Implementation of How to check if 2 lines intersect.cpp ├── Lecture List └── Combinatorics.md ├── Number Theory └── Problems Suggestions.md ├── Online Judges └── Leetcode │ └── Top 100 Liked Questions │ ├── 11. Container With Most Water.cpp │ ├── 23. Merge K Sorted Lists.cpp │ ├── 239. Sliding Window Maximum.cpp │ ├── 295. Find Median from Data Stream.cpp │ ├── 3. Longest Substring Without Repeating Characters.cpp │ ├── 41. First Missing Positive.cpp │ ├── 45. Jump Game II.cpp │ ├── 55. Jump Game.cpp │ └── 84. Largest Rectangle in Histogram.cpp ├── README.md └── SPOJ ├── Binary Search ├── ABCDEF.cpp ├── AGGRCOW - Aggressive cows.cpp └── FACVSPOW - Factorial vs Power.cpp ├── DP └── PR003004 - Digit Sum.cpp ├── Geometry └── INOROUT - Inside or outside.cpp ├── Graph & Tree └── SUBMERGE.cpp └── Number Theory └── POLYMUL - Polynomial Multiplication.cpp /.github/workflows/youtube-workflow.yml: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/.github/workflows/youtube-workflow.yml -------------------------------------------------------------------------------- /CSES/CPP solutions/Company Queries I.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/CPP solutions/Company Queries I.cpp -------------------------------------------------------------------------------- /CSES/CPP solutions/Company Queries II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/CPP solutions/Company Queries II.cpp -------------------------------------------------------------------------------- /CSES/CPP solutions/Counting Paths.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/CPP solutions/Counting Paths.cpp -------------------------------------------------------------------------------- /CSES/CPP solutions/Distance Queries.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/CPP solutions/Distance Queries.cpp -------------------------------------------------------------------------------- /CSES/CPP solutions/Distinct Colors.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/CPP solutions/Distinct Colors.cpp -------------------------------------------------------------------------------- /CSES/CPP solutions/Finding a Centroid.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/CPP solutions/Finding a Centroid.cpp -------------------------------------------------------------------------------- /CSES/CPP solutions/Subordinates.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/CPP solutions/Subordinates.cpp -------------------------------------------------------------------------------- /CSES/CPP solutions/Tree Diameter.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/CPP solutions/Tree Diameter.cpp -------------------------------------------------------------------------------- /CSES/CPP solutions/Tree Distances I.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/CPP solutions/Tree Distances I.cpp -------------------------------------------------------------------------------- /CSES/CPP solutions/Tree Distances II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/CPP solutions/Tree Distances II.cpp -------------------------------------------------------------------------------- /CSES/CPP solutions/Tree Matching.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/CPP solutions/Tree Matching.cpp -------------------------------------------------------------------------------- /CSES/Graph Algorithms/Game Routes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/Graph Algorithms/Game Routes.cpp -------------------------------------------------------------------------------- /CSES/Graph Algorithms/Longest Flight Route.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/Graph Algorithms/Longest Flight Route.cpp -------------------------------------------------------------------------------- /CSES/Solutions.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/Solutions.md -------------------------------------------------------------------------------- /CSES/Tree Algorithms/Company Queries I.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/Tree Algorithms/Company Queries I.cpp -------------------------------------------------------------------------------- /CSES/Tree Algorithms/Distinct Colors.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/Tree Algorithms/Distinct Colors.cpp -------------------------------------------------------------------------------- /CSES/Tree Algorithms/Finding a Centroid.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/Tree Algorithms/Finding a Centroid.cpp -------------------------------------------------------------------------------- /CSES/Tree Algorithms/Subtree Queries.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/Tree Algorithms/Subtree Queries.cpp -------------------------------------------------------------------------------- /CSES/Tree Algorithms/Tree Diameter.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/Tree Algorithms/Tree Diameter.cpp -------------------------------------------------------------------------------- /CSES/Tree Algorithms/Tree Distances II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/CSES/Tree Algorithms/Tree Distances II.cpp -------------------------------------------------------------------------------- /Codeforces/Editorials/Greedy Algorithms/Creating a Schedule.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/Codeforces/Editorials/Greedy Algorithms/Creating a Schedule.cpp -------------------------------------------------------------------------------- /Codeforces/Editorials/Greedy Algorithms/Make It Good.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/Codeforces/Editorials/Greedy Algorithms/Make It Good.cpp -------------------------------------------------------------------------------- /Codeforces/Editorials/Greedy Algorithms/Move Brackets.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/Codeforces/Editorials/Greedy Algorithms/Move Brackets.cpp -------------------------------------------------------------------------------- /Codeforces/Editorials/Greedy Algorithms/Pluses and Minuses.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/Codeforces/Editorials/Greedy Algorithms/Pluses and Minuses.cpp -------------------------------------------------------------------------------- /Codeforces/Editorials/Greedy Algorithms/RationalLee.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/Codeforces/Editorials/Greedy Algorithms/RationalLee.cpp -------------------------------------------------------------------------------- /Codeforces/Editorials/SQRT & Mo's Algorithm/D. Cut and Stick.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/Codeforces/Editorials/SQRT & Mo's Algorithm/D. Cut and Stick.cpp -------------------------------------------------------------------------------- /Codeforces/Global Rounds/Round 9/D. Replace by MEX.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/Codeforces/Global Rounds/Round 9/D. Replace by MEX.cpp -------------------------------------------------------------------------------- /Geometry Course/L03 - C++ Implementation of How to check if 2 lines intersect.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/Geometry Course/L03 - C++ Implementation of How to check if 2 lines intersect.cpp -------------------------------------------------------------------------------- /Lecture List/Combinatorics.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/Lecture List/Combinatorics.md -------------------------------------------------------------------------------- /Number Theory/Problems Suggestions.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/Number Theory/Problems Suggestions.md -------------------------------------------------------------------------------- /Online Judges/Leetcode/Top 100 Liked Questions/11. Container With Most Water.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/Online Judges/Leetcode/Top 100 Liked Questions/11. Container With Most Water.cpp -------------------------------------------------------------------------------- /Online Judges/Leetcode/Top 100 Liked Questions/23. Merge K Sorted Lists.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/Online Judges/Leetcode/Top 100 Liked Questions/23. Merge K Sorted Lists.cpp -------------------------------------------------------------------------------- /Online Judges/Leetcode/Top 100 Liked Questions/239. Sliding Window Maximum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/Online Judges/Leetcode/Top 100 Liked Questions/239. Sliding Window Maximum.cpp -------------------------------------------------------------------------------- /Online Judges/Leetcode/Top 100 Liked Questions/295. Find Median from Data Stream.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/Online Judges/Leetcode/Top 100 Liked Questions/295. Find Median from Data Stream.cpp -------------------------------------------------------------------------------- /Online Judges/Leetcode/Top 100 Liked Questions/3. Longest Substring Without Repeating Characters.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/Online Judges/Leetcode/Top 100 Liked Questions/3. Longest Substring Without Repeating Characters.cpp -------------------------------------------------------------------------------- /Online Judges/Leetcode/Top 100 Liked Questions/41. First Missing Positive.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/Online Judges/Leetcode/Top 100 Liked Questions/41. First Missing Positive.cpp -------------------------------------------------------------------------------- /Online Judges/Leetcode/Top 100 Liked Questions/45. Jump Game II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/Online Judges/Leetcode/Top 100 Liked Questions/45. Jump Game II.cpp -------------------------------------------------------------------------------- /Online Judges/Leetcode/Top 100 Liked Questions/55. Jump Game.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/Online Judges/Leetcode/Top 100 Liked Questions/55. Jump Game.cpp -------------------------------------------------------------------------------- /Online Judges/Leetcode/Top 100 Liked Questions/84. Largest Rectangle in Histogram.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/Online Judges/Leetcode/Top 100 Liked Questions/84. Largest Rectangle in Histogram.cpp -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/README.md -------------------------------------------------------------------------------- /SPOJ/Binary Search/ABCDEF.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/SPOJ/Binary Search/ABCDEF.cpp -------------------------------------------------------------------------------- /SPOJ/Binary Search/AGGRCOW - Aggressive cows.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/SPOJ/Binary Search/AGGRCOW - Aggressive cows.cpp -------------------------------------------------------------------------------- /SPOJ/Binary Search/FACVSPOW - Factorial vs Power.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/SPOJ/Binary Search/FACVSPOW - Factorial vs Power.cpp -------------------------------------------------------------------------------- /SPOJ/DP/PR003004 - Digit Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/SPOJ/DP/PR003004 - Digit Sum.cpp -------------------------------------------------------------------------------- /SPOJ/Geometry/INOROUT - Inside or outside.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/SPOJ/Geometry/INOROUT - Inside or outside.cpp -------------------------------------------------------------------------------- /SPOJ/Graph & Tree/SUBMERGE.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/SPOJ/Graph & Tree/SUBMERGE.cpp -------------------------------------------------------------------------------- /SPOJ/Number Theory/POLYMUL - Polynomial Multiplication.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-N-Code/competitive_programming_course/HEAD/SPOJ/Number Theory/POLYMUL - Polynomial Multiplication.cpp --------------------------------------------------------------------------------