DSA Notes
HubAlgorithm vs Data Structure — Key Differences, Definitions, and How They Work TogetherApplications of DSA — How Data Structures and Algorithms Power Real-World SoftwareTime and Space Complexity — A Complete BeginnerWhat is DSA? — A Complete BeginnerWhy Learn DSA? — Career Benefits, Real-World Impact, and Long-Term ValueAsymptotic Analysis — Complete Framework with Recurrence Relations and Master TheoremBest, Average, and Worst Case Analysis — A Practical Guide for Every AlgorithmBig O Notation — Complete Guide with Formal Definition, Rules, and ExamplesBig Omega Notation — Lower Bounds, Best Case, and Formal DefinitionBig Theta (Θ) Notation — Tight Bounds and Exact Growth RatesSpace Complexity — Memory Analysis, Auxiliary Space, and Time-Space TradeoffsTime Complexity Examples — 25 Worked Problems from Basic to AdvancedArray Interview Problems — 15 Classic Problems with Complete SolutionsArray Operations — Every Operation Explained with Code, Complexity, and Edge CasesArray Rotation — Algorithms, Techniques, and Interview ProblemsArray Searching — Linear Search, Binary Search, and Advanced TechniquesArrays — The Complete Introduction to the Most Fundamental Data StructureDynamic Arrays — How Python Lists and ArrayLists Work InternallyMultidimensional Arrays — 2D Arrays, Matrices, and Memory LayoutSliding Window Technique — Complete Guide with 10 Classic ProblemsAnagram Problems — Detection, Grouping, and Sliding Window VariationsPalindrome Problems — Check, Longest, Count, and Expand Around CenterPattern Searching — KMP, Rabin-Karp, and Boyer-Moore AlgorithmsString Interview Problems — 10 Classic Problems with Complete SolutionsString Matching — Longest Common Subsequence, Edit Distance, and Z-AlgorithmString Operations — Complete Reference with Complexity and ImplementationStrings — Complete Introduction to String Data Structure and OperationsCircular Linked List — Structure, Operations, and ApplicationsDoubly Linked List — Complete Implementation with Bidirectional OperationsLinked List Interview Problems — 12 Classic Problems with Complete SolutionsLinked Lists — A Complete Introduction with Memory Model and TypesLinked List Operations — Every Technique with Code and ComplexityReverse Linked List — All Approaches from Basic to AdvancedSingly Linked List — Complete Implementation with All OperationsBalanced Parentheses — Stack-Based Validation with All VariantsInfix, Prefix, and Postfix Expressions — Stack-Based Conversion and EvaluationStack Implementation — Three Complete Implementations with Edge CasesStack Interview Problems — 10 Classic Problems with Complete SolutionsStack — Complete Introduction to LIFO Data StructureStack Using Arrays — Memory Layout, Capacity Management, and PerformanceStack Using Linked List — Implementation, Analysis, and When to Use ItCircular Queue — The Ring Buffer Explained with ImplementationDeque — Double-Ended Queue with Complete Implementation and ApplicationsPriority Queue — Complete Guide from Concept to ImplementationQueue Applications — BFS, Level-Order Traversal, 01-BFS, and MoreQueue Implementation — Array, Linked List, and Two-Stack ApproachesQueue Interview Problems — 10 Classic Problems with Complete SolutionsQueue — Complete Introduction to the FIFO Data StructureAVL Tree - Self-Balancing Binary Search TreeBinary Search Tree (BST)Binary Tree - Structure and OperationsFenwick Tree (Binary Indexed Tree)Red-Black Tree - Another Balanced BSTSegment Tree - Range Query Data StructureTree Interview Problems CollectionTree Data Structure FundamentalsTree Traversals - Inorder, Preorder, Postorder, Level OrderHeap — Complete Introduction to the Priority-Based Tree Data StructureHeap Operations — Complete Reference with Complexity AnalysisHeap Problems — 8 Classic Interview Problems with Complete SolutionsMax Heap — Complete Implementation and ApplicationsMin Heap — Complete Implementation with All OperationsPriority Queue Using Heap — Implementation, Applications, and PatternsBellman-Ford Algorithm — Shortest Path with Negative Weights and Cycle DetectionBFS Algorithm — Breadth-First Search with All Applications and VariantsDFS Algorithm — Depth-First Search with Cycle Detection and All ApplicationsDijkstraFloyd-Warshall Algorithm — All-Pairs Shortest Paths with Complete AnalysisGraph Interview Problems — 12 Classic Problems with Complete SolutionsGraph — Complete Introduction to the Most Powerful Data StructureGraph Representation — Adjacency List, Matrix, Edge List with Complete AnalysisKruskalMinimum Spanning Tree — Definition, Properties, and ApplicationsPrimShortest Path Algorithms — Complete Comparison and Selection GuideTopological Sorting — DFS and BFS (KahnUnion-Find (DSU) in Graphs — Connected Components and Dynamic ConnectivitySeparate Chaining — Complete Implementation and AnalysisCollision Handling — Chaining vs Open Addressing Complete ComparisonHash Functions — Design, Properties, and Common ImplementationsHashing — Complete Introduction to Hash Tables and Hash FunctionsHashing Problems — 10 Classic Interview Problems with Complete SolutionsOpen Addressing — Linear Probing, Quadratic Probing, and Double HashingBubble Sort — Complete Analysis with Optimizations and When to Use ItCounting Sort — O(n+k) Sorting That Breaks the Comparison Lower BoundHeap Sort — Guaranteed O(n log n) with O(1) SpaceInsertion Sort — The O(n) Best Case Sort That Powers PythonMerge Sort — Complete Guide to the Guaranteed O(n log n) Stable SortQuick Sort — The Fastest Practical Sorting Algorithm with Complete AnalysisRadix Sort — O(nk) Digit-by-Digit Sorting for Large Integer RangesSelection Sort — Complete Analysis with Swaps Minimization PropertySorting Algorithm Comparison — The Complete Decision GuideSorting — Complete Introduction to Sorting AlgorithmsBinary Search — Complete Guide with All Variants and Proof of CorrectnessInterpolation Search — O(log log n) Search for Uniformly Distributed DataLinear Search — Complete Guide with All Variants and ApplicationsSearch Algorithm Comparison — Choosing the Right Search for Every SituationSearching Interview Problems — 10 Classic Problems with Complete SolutionsTernary Search — Finding Maximum/Minimum of Unimodal FunctionsBacktracking Introduction — The Recursive Exploration with UndoRecursion Basics — The Complete BeginnerRecursion Problems — 12 Classic Problems from Basic to AdvancedRecursion Tree — Visualizing Recursion for Complexity AnalysisRecursion vs Iteration — When to Use Each and How to ConvertTail Recursion — Definition, Optimization, and Converting to IterationDP Interview Problems — 12 Classic Problems with Pattern Recognition GuideDynamic Programming — Complete Introduction with Properties and Problem IdentificationFibonacci DP — From Exponential to Linear with Memoization and Matrix ExponentiationKnapsack Problem — 0/1, Unbounded, and Fractional with Complete AnalysisLongest Common Subsequence — Complete Guide with DP Table and String VariantsLongest Increasing Subsequence — O(n log n) with Patience SortingMatrix Chain Multiplication — Interval DP with Complete AnalysisMemoization — Top-Down Dynamic Programming with CachingTabulation — Bottom-Up Dynamic Programming with Complete Table BuildingActivity Selection Problem — Greedy Scheduling with Proof of CorrectnessFractional Knapsack — Greedy by Value Density with ProofGreedy Interview Problems — 10 Classic Problems with Complete SolutionsGreedy Algorithms — Complete Introduction with Proof TechniquesHuffman Coding — Optimal Prefix-Free Data CompressionJob Sequencing Problem — Greedy Scheduling with DeadlinesBacktracking — The Complete Guide to Recursive Exploration with UndoBacktracking Problems — 12 Classic Interview Problems with Complete SolutionsN-Queens Problem — Complete Solution with Backtracking and OptimizationRat in a Maze — Backtracking Path Finding with All SolutionsSubset Generation — All Subsets, Combinations, and Partitions with BacktrackingSudoku Solver — Backtracking with Constraint PropagationCodeforces Guide — Complete Strategy to Reach 1800+ RatingCommon CP Techniques — Essential Algorithms Every Competitive Programmer Must KnowContest Strategies — How to Perform Your Best in Competitive Programming ContestsCompetitive Programming — Complete Introduction for BeginnersFast Input/Output — Why I/O Speed Matters and Complete Templates for C++ and PythonLeetCode Guide — Complete Strategy to Crack FAANG InterviewsBit Manipulation — Complete Guide with All Tricks and Interview ProblemsBloom Filter — Space-Efficient Probabilistic Membership TestingComputational Geometry — Points, Lines, Convex Hull, and Geometric AlgorithmsDisjoint Set Union (DSU) — Union-Find with Path Compression and Union by RankRandomized Algorithms — Las Vegas, Monte Carlo, and Probabilistic TechniquesSkip List — The Probabilistic Data Structure that Competes with Balanced BSTsSuffix Array — Construction, LCP Array, and String Search ApplicationsTrie Data Structure — Complete Guide with Implementation and ApplicationsAutocomplete System Using TrieLibrary Management System Using DSARoute Finder Using GraphsMini Search Engine ProjectSocial Network Analysis Using GraphsEssential Coding Patterns for InterviewsDSA Cheatsheet: Quick ReferenceEssential DSA Interview QuestionsFAANG DSA Sheet: Company-Specific Patterns and ProblemsProblem Solving Strategies for Coding InterviewsComplexity CheatsheetImportant Algorithms SummaryBest Practice Platforms for DSARecommended Books for DSA
Master competitive programming contest strategies — pre-contest preparation, during-contest time management, the scanning strategy, when to skip problems, stress testing techniques, hacking, debugging under pressure, post-contest upsolving, and mental management during competition.
Introduction
Technical knowledge is necessary but not sufficient for competitive programming success. Two programmers with identical algorithmic knowledge can have dramatically different results in the same contest based on strategy, mental management, and experience.
This lesson teaches the non-technical skills that can move you 200-500 rating points without learning a single new algorithm.
During the Contest — The First 10 Minutes
The scanning strategy is critical. Most beginners make the mistake of reading only the first problem and immediately coding. This is wrong.
The Right Approach
Example
0-10 minutes: READ ALL PROBLEMS
For each problem, do a 2-minute read:
1. What is the input/output?
2. What are the constraints?
3. What is the difficulty level for you?
4. Quick mental categorization: sorting? DP? graph? math?
After reading all problems, make a decision tree:
"Problem A looks easy (8 min)"
"Problem B looks medium (15 min)"
"Problem C looks hard for me now — skip initially"
"Problem D looks like standard Dijkstra (25 min)"
"Problem E looks beyond my level"
Why this matters: Sometimes Problem C is actually easier than B for your skill set, or Problem D has a clean solution you recognize immediately. Scanning everything first lets you prioritize correctly.
Time Management During Contest
The 80/20 Rule of Contests
80% of your rating points come from problems you can solve comfortably. Spending 90 minutes on an unsolvable problem while missing problems you could have solved is the #1 mistake beginners make.
The 15-Minute Abandon Rule
Example
If you have been stuck on a problem for 15 minutes with NO progress:
→ Put it aside
→ Move to the next problem
→ Return to it after solving others
"No progress" means:
- You have NO idea what approach to use
- Every approach you try hits a wall immediately
"Some progress" means:
- You have a partially correct approach
- You know the algorithm but are stuck on implementation
→ In this case, spend 10 more minutes
Time Budget per Problem (Div 2)
| Problem | Target Time | Max Time Before Skip |
|---|---|---|
| A | 5-10 min | 15 min |
| B | 10-20 min | 30 min |
| C | 20-40 min | 50 min |
| D | 35-60 min | 70 min |
| E | 45-90 min | Skip if C/D unsolved |
Reading Problems Correctly
What to Look for Immediately
| n ≤ 10^5 | algorithm must be O(n log n) or O(n) |
| n ≤ 10^3 | O(n²) works |
| n ≤ 20 | O(2^n) or O(n!) possible |
The Restatement Method
After reading, close your eyes and restate the problem in your own words. If you can't, read again. You'd be surprised how many wrong submissions come from misunderstanding the problem.
Coding Strategy
Write Pseudocode First (for harder problems)
For problems C and harder
1. Write algorithm in comments (2-3 minutes)
2. Verify the algorithm on the examples manually
3. Only then write actual code
Example
// Sort array
// For each element, binary search for complement
// If found, return pair
Test Before Submitting
Example
ALWAYS test on provided examples.
For tricky problems, test on edge cases:
- n = 1 (single element)
- n = 2 (minimum array size)
- All elements equal
- Maximum values (check for overflow!)
Only submit when confident ALL examples pass.
Integer Overflow — The Silent Killer
cpp example
// Problem: n ≤ 10^5, values ≤ 10^5
// Trap: sum can be n × max_val = 10^5 × 10^5 = 10^10 > INT_MAX (2.1 × 10^9)
int sum = 0; // WRONG: Will overflow
for (int x : arr) sum += x;
long long sum = 0; // CORRECT: long long holds up to ~9.2 × 10^18
for (int x : arr) sum += x;
// Rule: Whenever multiplying/summing large values, use long longStress Testing — Verifying Your Solution
Stress testing is running your solution against a brute force on random small inputs to find bugs.
Example
import random
import subprocess
def brute_force(n, arr):
"""Slow but obviously correct solution."""
return max(arr) # Example
def optimized(n, arr):
"""Your fast solution to test."""
return arr[-1] if sorted(arr)[-1] else 0 # Potentially buggy
def random_input():
n = random.randint(1, 10)
arr = [random.randint(1, 100) for _ in range(n)]
return n, arr
# Run 1000 random tests
for test in range(1000):
n, arr = random_input()
expected = brute_force(n, arr)
got = optimized(n, arr)
if expected != got:
print(f"WRONG on: n={n}, arr={arr}")
print(f"Expected: {expected}, Got: {got}")
break
else:
print("All 1000 tests passed!")
This catches bugs that examples don't reveal. Many TLE or WA solutions have passed a 10-minute stress test to reveal the exact failing input.
Hacking (Codeforces Specific)
After the coding phase, Codeforces allows "hacking" — submitting test cases to break other participants' solutions. This is optional but can earn points.
How to hack effectively:
Example
1. Read your target's code carefully
2. Find their assumption and create an input that violates it
- Did they assume all values are positive? Try negatives.
- Did they assume n ≥ 2? Try n = 1.
- Did they use int? Try values exceeding 2^31 - 1.
- Did they handle self-loops in graphs? Try a node connected to itself.
3. Submit the hack input
Warning: A failed hack (your input doesn't actually break their code) costs you 50 rating points. Only hack when very confident.
Post-Contest — The Learning Phase
The contest is over, but the real learning begins now.
Immediate Post-Contest (Same Day)
Example
1. Note down every problem you couldn't solve
2. For problems you solved: check editorial for cleaner approaches
3. For unsolved problems: try for 30 MORE minutes before reading editorial
4. Read the editorial for ALL problems, not just ones you missed
The Upsolving Process
Example
1. Read editorial carefully
2. Understand the KEY INSIGHT (not just the code)
3. Close the editorial
4. Implement from scratch without looking
5. Submit and get Accepted
6. Compare your code with high-rated participants' solutions
7. Add the problem to a "review" list to resolve in 3-7 days
What to Track
Example
Keep a notebook or spreadsheet:
Problem name | Category | Key insight | Date solved | Difficulty
After 100 solved problems, patterns will be obvious:
"I always struggle with segment tree problems"
"I'm weak on modular arithmetic"
→ Targeted practice in weak areas
Mental Management
Dealing with TLE (Time Limit Exceeded)
Example
Wrong reaction: "My algorithm is wrong, start over"
Right reaction:
1. Check time complexity — is it within limits?
2. Check for unnecessary operations inside loops
3. Check I/O speed (forgot sync_with_stdio?)
4. Check for accidental O(n²) behavior in O(n) algorithm
(e.g., vector concatenation, string concatenation in loop)
Dealing with WA (Wrong Answer)
| Wrong reaction | "My code looks right, maybe the judge is wrong" |
| 2. Check edge cases | n=1, all zeros, negative values, overflow |
| 3. Check output format | trailing spaces, newlines, case sensitivity |
When to Give Up on a Problem
Give up and move to next problem when
→ You've been stuck for 20+ minutes with no progress
→ You've tried 3 different approaches and all fail
→ You have other unsolved problems you might solve
Give up and stop contest attempts when
→ Your WA count on a problem is 5+
(Each wrong submission is -50 points, you're digging deeper)
Summary — The Contest Checklist
Pre-Contest
- [ ] Template ready and tested
- [ ] IDE/compiler working
- [ ] Distractions minimized
First 10 Minutes
- [ ] Read ALL problems quickly
- [ ] Estimate difficulty of each
- [ ] Decide solving order
For Each Problem
- [ ] Understand examples completely
- [ ] Check constraints → determine required complexity
- [ ] State algorithm in pseudocode before coding
- [ ] Test on examples before submitting
- [ ] Check for overflow with large inputs
Post-Contest
- [ ] Upsolve every problem you couldn't solve
- [ ] Read all editorials
- [ ] Note down key insights
Competitive programming rewards preparation, strategy, and consistency. The programmer with great strategy and average algorithms often outperforms the programmer with brilliant algorithms and poor strategy. Master both and you will climb rapidly.
*Competitive Programming section complete.*
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Contest Strategies — How to Perform Your Best in Competitive Programming Contests.
Interview Use
Prepare one clear explanation, one practical example, and one common mistake for this Data Structures & Algorithms topic.
Search Terms
data-structures-algorithms, data structures & algorithms, data, structures, algorithms, competitive, programming, contest
Related Data Structures & Algorithms Topics
Continue learning this concept
Competitive ProgrammingCodeforces Guide — Complete Strategy to Reach 1800+ RatingThe definitive Codeforces guide — how to navigate the platform, understanding the rating system, contest strategy for Div.1 and Div.2, problem difficulty mapping, the right approach for each problem letter (A through F), rating improvement roadmap, and common mistakes that stall progress.Competitive ProgrammingCommon CP Techniques — Essential Algorithms Every Competitive Programmer Must KnowMaster the essential competitive programming techniques — two pointers, sliding window, binary search on answer, prefix sums, sparse table, coordinate compression, BFS on implicit graphs, bitmask DP, and modular arithmetic — with implementation templates and when to apply each technique.Competitive ProgrammingCompetitive Programming — Complete Introduction for BeginnersA complete introduction to competitive programming — what it is, why it matters for careers, the major platforms (Codeforces, LeetCode, CodeChef, AtCoder), rating systems explained, the problem-solving mindset, how contests work, and a complete roadmap from beginner to expert.Competitive ProgrammingFast Input/Output — Why I/O Speed Matters and Complete Templates for C++ and PythonMaster fast I/O in competitive programming — why cin/cout is slow, how sync_with_stdio and tie affect speed, custom fast readers in C++, Python stdin tricks, complete templates for C++ and Python with all optimizations, and when I/O speed is the difference between AC and TLE.Competitive ProgrammingLeetCode Guide — Complete Strategy to Crack FAANG InterviewsThe definitive LeetCode guide — how to use LeetCode effectively, topic-wise problem lists, the 150-problem study plan, how to approach medium and hard problems, common patterns to master, time management in interviews, and which problems to prioritize by company.Dynamic ProgrammingDP Interview Problems — 12 Classic Problems with Pattern Recognition GuideSolve 12 classic DP interview problems — maximum product subarray, decode ways, jump game II, unique paths with obstacles, minimum path sum, coin change II, target sum, longest palindromic substring, word break, stock problems, regular expression matching, and wildcard matching.