intermediate level
Competitive Programming
Study Material for Competitive Programming
Ch 11: Complexity & Problem Solving
Reading Problem Statements · Complexity Analysis · Brute Force · Observation Finding · Edge-Case Handling · Debugging Techniques · Stress Testing
Ch 16: Greedy Algorithms & Constructive Problems
The Greedy Paradigm · Sorting-Based Greedy · Interval Scheduling (Activity Selection) · The Exchange Argument · Constructive Algorithms
Ch 15: Binary Search (Array & Answer Space)
Binary Search on a Sorted Array · STL Binary Search Functions · Binary Search on the Answer · Boundary Handling
Ch 26: Dynamic Programming — Foundations
The DP Paradigm · The DP Recipe · Classic DP Problems · Longest Increasing Subsequence (LIS) · Maximum Subarray Sum (Kadane's Algorithm)
Related Topics
Was this helpful?
Published by RunTimeFix · Comprehensive guides for competitive programming