CP Bits Goa
CP Bits Goa
CSES
Topcoder
AFLV
CP-II
Hackerrank
Some random PDF
Errichto Series
William Fest
Codeforces Blog
USACO
Tiling Problems
Practice Problems
Concept Building
1. Frogs-1
2. Educational Codeforces Contest
3. Maximum Subarray
4. Longest Increasing Subsequence
5. Tiling Problem
Interview Problem
1. Buy and Sell Stock
2. Buy and Sell Stock-2
3. Buy and Sell Stock-3
4. Longest Palindromic Substring
5. Edit Distance
6. Burst Balloons
Coding Tests
1. CSES DP Section
2. Palindrome Partition
3. Palindrome Partition-2
4. Rectangle Tiling
Competitive Programming
1. Atcoder Educational DP Contest
2. Super Ugly Number
Practice Problems
Concept Building
1. Maximum sum subarray of size K
2. Sliding Window Maximum
Interview Problem
1. Longest Substring Without Repeating Characters
2. Find duplicates in a subarray of size K
3. Subarrays with K Different Integers
Coding Tests
1. At most K unique character substring
2. Permutation in String (Must read editorial)
3. Maximum consecutive Ones
4. Minimum Size Subarray Sum
5. Maximum Sum Subarray
6. Queries with fixed Length
Competitive Programming
1. Maximum consecutive Ones after K flips
2. Sliding Median
3. Sereja and Dima
4. Alice, Bob, and Chocolate
5. Alternating Subsequence
6. Ternary String
7. Books
8. Sliding Cost
CS Academy
CS Academy | Stack Application
GeeksforGeeks
CP Algorithms (Advance Application of Stacks)
Practice Problems
Concept Building
1. Valid Parentheses
2. Longest Valid Parentheses
Interview Problem
1. Implement Queue using Stacks
2. Implement Stacks using Queues
Coding Tests
1. Stock Span
2. Rain Water Trapping
3. Largest Histogram
Competitive Programming
1. Psychos in a Line
2. Min Stack
Merge Sort and Segment Trees (Lecture #3 | Video)
CP Algorithms
CSA Academy
CP Handbook (Read additional techniques section once done with basic segment trees)
Iterative Implementation of Segment Trees (It is slightly faster compared to recursion)
Practice Problems
Concept Building
1. Dynamic Range Sum Queries
2. Dynamic Range Min Queries
Coding Tests
1. Counting Inversions
Competitive Programming
1. Range Update Queries
Prefix Sums (Lecture #2 | Video)
Practice Problems
Concept Building
1. Static Range Sum Queries
2. Pivot Index
3. Range XOR Queries
4. Matrix Block Sum
Interview Problems
1. Multiplication 2
Coding Tests
1. Max Subarray Sum
2. Forest Queries
Competitive Programming
1. Subarray Sums II
2. Subarray Divisibility
3. Good Subarrays
4. GCD on Blackboard
5. Max Median
6. Magic ship
Binary Search (Lecture #1)
Practice Problems
Concept Building
1. Binary Search
2. Square Root of X
3. Two Sum
Interview Problems
1. First and Last Position of Element
2. Element in Rotated Sorted Array
3. Minimum in Rotated Sorted Array
Coding Tests
1. Shortest Subarray with Sum
2. Aggressive Cows
3. Koko Eating Bananas (Similar to Array Division problem/Painter's Partition)
4. Median of Two Sorted Arrays
Competitive Programming
1. Array Division (This problem is famously called Painter's Partition Problem)
2. Multiplication Table
3. Meeting Place
4. Guess the Kth Zero
5. Discrete Acceleration
6. Longest k-good segment
7. Mixing Water