Skip to main content

Free · 13 weeks · placements and interviews

DSA Sheet: 359 LeetCode problems in 13 weeks

A free, week-by-week DSA sheet for placements and coding interviews. 359 LeetCode problems take you from foundations through arrays, trees and graphs to dynamic programming. Mark each one Done, In Progress or Not Started, keep private notes, and sign in to save progress and climb the leaderboard.

95Easy208Medium56HardBasics → arrays → graphs → DP

Week 1: Basic Programming Foundations

28 problems · Loops, math, digit and string basics, plus time and space complexity

0/28
  1. 1
    Reverse String

    Basic Programming Foundations

    Easy
  2. 2
    Reverse Integer

    Basic Programming Foundations

    Medium
  3. 3
    Palindrome Number

    Basic Programming Foundations

    Easy
  4. 4
    Valid Anagram

    Basic Programming Foundations

    Easy
  5. 5
    Fizz Buzz

    Basic Programming Foundations

    Easy
  6. 6
    Factorial Trailing Zeroes

    Basic Programming Foundations

    Easy
  7. 7
    Fibonacci Number

    Basic Programming Foundations

    Easy
  8. 8
    Climbing Stairs

    Basic Programming Foundations

    Easy
  9. 9
    Sqrt(x)

    Basic Programming Foundations

    Easy
  10. 10
    Power of Two

    Basic Programming Foundations

    Easy
  11. 11
    Power of Three

    Basic Programming Foundations

    Easy
  12. 12
    Power of Four

    Basic Programming Foundations

    Easy
  13. 13
    Happy Number

    Basic Programming Foundations

    Easy
  14. 14
    Add Digits

    Basic Programming Foundations

    Easy
  15. 15
    Count Primes

    Basic Programming Foundations

    Medium
  16. 16
    Missing Number

    Basic Programming Foundations

    Easy
  17. 17
    Single Number

    Basic Programming Foundations

    Easy
  18. 18
    Plus One

    Basic Programming Foundations

    Easy
  19. 19
    Roman to Integer

    Basic Programming Foundations

    Easy
  20. 20
    Integer to Roman

    Basic Programming Foundations

    Medium
  21. 21
    Length of Last Word

    Basic Programming Foundations

    Easy
  22. 22
    Defanging an IP Address

    Basic Programming Foundations

    Easy
  23. 23
    Ugly Number

    Basic Programming Foundations

    Easy
  24. 24
    Excel Sheet Column Number

    Basic Programming Foundations

    Easy
  25. 25
    Excel Sheet Column Title

    Basic Programming Foundations

    Easy
  26. 26
    Greatest Common Divisor of Strings

    Basic Programming Foundations

    Easy
  27. 27
    Jewels and Stones

    Basic Programming Foundations

    Easy
  28. 28
    Number Complement

    Basic Programming Foundations

    Easy

Week 2: Arrays / Two Pointers / Sliding Window

30 problems · The most asked array patterns in interviews: prefix sums, two pointers on sorted data, and fixed or variable sliding windows

0/30
  1. 29
    Two Sum

    Arrays / Two Pointers / Sliding Window

    Easy
  2. 30
    Best Time to Buy and Sell Stock

    Arrays / Two Pointers / Sliding Window

    Easy
  3. 31
    Contains Duplicate

    Arrays / Two Pointers / Sliding Window

    Easy
  4. 32
    Product of Array Except Self

    Arrays / Two Pointers / Sliding Window

    Medium
  5. 33
    Maximum Subarray

    Arrays / Two Pointers / Sliding Window

    Medium
  6. 34
    Maximum Product Subarray

    Arrays / Two Pointers / Sliding Window

    Medium
  7. 35
    Find Minimum in Rotated Sorted Array

    Arrays / Two Pointers / Sliding Window

    Medium
  8. 36
    Search in Rotated Sorted Array

    Arrays / Two Pointers / Sliding Window

    Medium
  9. 37
    3Sum

    Arrays / Two Pointers / Sliding Window

    Medium
  10. 38
    Container With Most Water

    Arrays / Two Pointers / Sliding Window

    Medium
  11. 39
    Trapping Rain Water

    Arrays / Two Pointers / Sliding Window

    Hard
  12. 40
    Move Zeroes

    Arrays / Two Pointers / Sliding Window

    Easy
  13. 41
    Remove Duplicates from Sorted Array

    Arrays / Two Pointers / Sliding Window

    Easy
  14. 42
    Merge Sorted Array

    Arrays / Two Pointers / Sliding Window

    Easy
  15. 43
    Squares of a Sorted Array

    Arrays / Two Pointers / Sliding Window

    Easy
  16. 44
    Rotate Array

    Arrays / Two Pointers / Sliding Window

    Medium
  17. 45
    Longest Substring Without Repeating Characters

    Arrays / Two Pointers / Sliding Window

    Medium
  18. 46
    Minimum Size Subarray Sum

    Arrays / Two Pointers / Sliding Window

    Medium
  19. 47
    Sliding Window Maximum

    Arrays / Two Pointers / Sliding Window

    Hard
  20. 48
    Longest Repeating Character Replacement

    Arrays / Two Pointers / Sliding Window

    Medium
  21. 49
    Permutation in String

    Arrays / Two Pointers / Sliding Window

    Medium
  22. 50
    Find All Anagrams in a String

    Arrays / Two Pointers / Sliding Window

    Medium
  23. 51
    Subarray Sum Equals K

    Arrays / Two Pointers / Sliding Window

    Medium
  24. 52
    Two Sum II - Input Array Is Sorted

    Arrays / Two Pointers / Sliding Window

    Easy
  25. 53
    4Sum

    Arrays / Two Pointers / Sliding Window

    Medium
  26. 54
    Sort Colors

    Arrays / Two Pointers / Sliding Window

    Medium
  27. 55
    Next Permutation

    Arrays / Two Pointers / Sliding Window

    Medium
  28. 56
    Gas Station

    Arrays / Two Pointers / Sliding Window

    Medium
  29. 57
    Majority Element

    Arrays / Two Pointers / Sliding Window

    Easy
  30. 58
    Merge Intervals

    Arrays / Two Pointers / Sliding Window

    Medium

Week 3: Binary Search / Sorting

27 problems · Binary search on arrays and on the answer, rotated arrays, and the sorting tricks that turn O(n²) ideas into O(n log n)

0/27
  1. 59
    Binary Search

    Binary Search / Sorting

    Easy
  2. 60
    Search Insert Position

    Binary Search / Sorting

    Easy
  3. 61
    First Bad Version

    Binary Search / Sorting

    Easy
  4. 62Medium
  5. 63
    Search a 2D Matrix

    Binary Search / Sorting

    Medium
  6. 64
    Search a 2D Matrix II

    Binary Search / Sorting

    Medium
  7. 65
    Koko Eating Bananas

    Binary Search / Sorting

    Medium
  8. 66Medium
  9. 67
    Split Array Largest Sum

    Binary Search / Sorting

    Hard
  10. 68
    Median of Two Sorted Arrays

    Binary Search / Sorting

    Hard
  11. 69
    Find Peak Element

    Binary Search / Sorting

    Medium
  12. 70
    Search in Rotated Sorted Array II

    Binary Search / Sorting

    Medium
  13. 71
    Time Based Key-Value Store

    Binary Search / Sorting

    Medium
  14. 72Medium
  15. 73Easy
  16. 74
    Single Element in a Sorted Array

    Binary Search / Sorting

    Medium
  17. 75
    Sort an Array

    Binary Search / Sorting

    Medium
  18. 76
    Kth Largest Element in an Array

    Binary Search / Sorting

    Medium
  19. 77
    Largest Number

    Binary Search / Sorting

    Medium
  20. 78
    Non-overlapping Intervals

    Binary Search / Sorting

    Medium
  21. 79
    Insert Interval

    Binary Search / Sorting

    Medium
  22. 80
    Valid Triangle Number

    Binary Search / Sorting

    Medium
  23. 81
    H-Index

    Binary Search / Sorting

    Medium
  24. 82
    Pow(x, n)

    Binary Search / Sorting

    Medium
  25. 83Hard
  26. 84
    Peak Index in a Mountain Array

    Binary Search / Sorting

    Medium
  27. 85Hard

Week 4: Strings / HashMap / HashSet

27 problems · Frequency counting, anagrams, substrings and hashing patterns that show up in almost every online assessment

0/27
  1. 86
    Group Anagrams

    Strings / HashMap / HashSet

    Medium
  2. 87
    Longest Palindromic Substring

    Strings / HashMap / HashSet

    Medium
  3. 88
    Palindromic Substrings

    Strings / HashMap / HashSet

    Medium
  4. 89
    Valid Palindrome

    Strings / HashMap / HashSet

    Easy
  5. 90
    Longest Common Prefix

    Strings / HashMap / HashSet

    Easy
  6. 91
    String to Integer (atoi)

    Strings / HashMap / HashSet

    Medium
  7. 92Easy
  8. 93
    Ransom Note

    Strings / HashMap / HashSet

    Easy
  9. 94
    Isomorphic Strings

    Strings / HashMap / HashSet

    Easy
  10. 95
    Word Pattern

    Strings / HashMap / HashSet

    Easy
  11. 96
    Longest Consecutive Sequence

    Strings / HashMap / HashSet

    Medium
  12. 97
    Top K Frequent Elements

    Strings / HashMap / HashSet

    Medium
  13. 98
    Minimum Window Substring

    Strings / HashMap / HashSet

    Hard
  14. 99
    Zigzag Conversion

    Strings / HashMap / HashSet

    Medium
  15. 100
    Multiply Strings

    Strings / HashMap / HashSet

    Medium
  16. 101
    Reverse Words in a String

    Strings / HashMap / HashSet

    Medium
  17. 102
    Repeated Substring Pattern

    Strings / HashMap / HashSet

    Easy
  18. 103
    Count and Say

    Strings / HashMap / HashSet

    Medium
  19. 104
    Word Break

    Strings / HashMap / HashSet

    Medium
  20. 105
    Design HashMap

    Strings / HashMap / HashSet

    Easy
  21. 106
    Design HashSet

    Strings / HashMap / HashSet

    Easy
  22. 107
    Contains Duplicate II

    Strings / HashMap / HashSet

    Easy
  23. 108
    Find All Duplicates in an Array

    Strings / HashMap / HashSet

    Medium
  24. 109
    First Missing Positive

    Strings / HashMap / HashSet

    Hard
  25. 110
    Sort Characters By Frequency

    Strings / HashMap / HashSet

    Medium
  26. 111
    Longest Palindrome

    Strings / HashMap / HashSet

    Easy
  27. 112
    LRU Cache

    Strings / HashMap / HashSet

    Medium

Week 5: Recursion / Backtracking

23 problems · Subsets, permutations, combinations and grid search

0/23
  1. 113
    Subsets

    Recursion / Backtracking

    Medium
  2. 114
    Subsets II

    Recursion / Backtracking

    Medium
  3. 115
    Permutations

    Recursion / Backtracking

    Medium
  4. 116
    Permutations II

    Recursion / Backtracking

    Medium
  5. 117
    Combinations

    Recursion / Backtracking

    Medium
  6. 118
    Combination Sum

    Recursion / Backtracking

    Medium
  7. 119
    Combination Sum II

    Recursion / Backtracking

    Medium
  8. 120
    Combination Sum III

    Recursion / Backtracking

    Medium
  9. 121
    Generate Parentheses

    Recursion / Backtracking

    Medium
  10. 122Medium
  11. 123
    Word Search

    Recursion / Backtracking

    Medium
  12. 124
    Word Search II

    Recursion / Backtracking

    Hard
  13. 125
    Palindrome Partitioning

    Recursion / Backtracking

    Medium
  14. 126
    N-Queens

    Recursion / Backtracking

    Hard
  15. 127
    N-Queens II

    Recursion / Backtracking

    Hard
  16. 128
    Sudoku Solver

    Recursion / Backtracking

    Hard
  17. 129
    Restore IP Addresses

    Recursion / Backtracking

    Medium
  18. 130
    Beautiful Arrangement

    Recursion / Backtracking

    Medium
  19. 131
    Combination Sum IV

    Recursion / Backtracking

    Medium
  20. 132
    Unique Paths

    Recursion / Backtracking

    Medium
  21. 133
    Binary Tree Paths

    Recursion / Backtracking

    Easy
  22. 134
    Path Sum

    Recursion / Backtracking

    Easy
  23. 135
    All Paths From Source to Target

    Recursion / Backtracking

    Medium

Week 6: LinkedList / Stack

30 problems · Pointer manipulation, fast and slow pointers, monotonic stacks and next-greater-element style questions

0/30
  1. 136
    Reverse Linked List

    LinkedList / Stack

    Easy
  2. 137
    Merge Two Sorted Lists

    LinkedList / Stack

    Easy
  3. 138
    Linked List Cycle

    LinkedList / Stack

    Easy
  4. 139
    Linked List Cycle II

    LinkedList / Stack

    Medium
  5. 140Medium
  6. 141
    Reorder List

    LinkedList / Stack

    Medium
  7. 142
    Middle of the Linked List

    LinkedList / Stack

    Easy
  8. 143
    Palindrome Linked List

    LinkedList / Stack

    Easy
  9. 144Medium
  10. 145
    Add Two Numbers

    LinkedList / Stack

    Medium
  11. 146Easy
  12. 147Easy
  13. 148Medium
  14. 149
    Swap Nodes in Pairs

    LinkedList / Stack

    Medium
  15. 150
    Reverse Nodes in k-Group

    LinkedList / Stack

    Hard
  16. 151
    Rotate List

    LinkedList / Stack

    Medium
  17. 152Medium
  18. 153
    Merge k Sorted Lists

    LinkedList / Stack

    Hard
  19. 154
    Design Linked List

    LinkedList / Stack

    Medium
  20. 155
    Valid Parentheses

    LinkedList / Stack

    Easy
  21. 156
    Min Stack

    LinkedList / Stack

    Medium
  22. 157Medium
  23. 158
    Daily Temperatures

    LinkedList / Stack

    Medium
  24. 159
    Next Greater Element I

    LinkedList / Stack

    Easy
  25. 160
    Next Greater Element II

    LinkedList / Stack

    Medium
  26. 161Hard
  27. 162Easy
  28. 163Easy
  29. 164
    Decode String

    LinkedList / Stack

    Medium
  30. 165
    Asteroid Collision

    LinkedList / Stack

    Medium

Week 7: Queue/Deque + Trees (Basic)

30 problems · Queues and deques, then binary tree traversals, depth, diameter and level-order problems

0/30
  1. 166
    Design Circular Queue

    Queue/Deque + Trees (Basic)

    Medium
  2. 167
    Number of Recent Calls

    Queue/Deque + Trees (Basic)

    Easy
  3. 168
    Task Scheduler

    Queue/Deque + Trees (Basic)

    Medium
  4. 169
    Design Circular Deque

    Queue/Deque + Trees (Basic)

    Medium
  5. 170
    Binary Tree Inorder Traversal

    Queue/Deque + Trees (Basic)

    Easy
  6. 171
    Binary Tree Preorder Traversal

    Queue/Deque + Trees (Basic)

    Easy
  7. 172
    Binary Tree Postorder Traversal

    Queue/Deque + Trees (Basic)

    Easy
  8. 173
    Binary Tree Level Order Traversal

    Queue/Deque + Trees (Basic)

    Medium
  9. 174
    Binary Tree Zigzag Level Order Traversal

    Queue/Deque + Trees (Basic)

    Medium
  10. 175
    Maximum Depth of Binary Tree

    Queue/Deque + Trees (Basic)

    Easy
  11. 176
    Minimum Depth of Binary Tree

    Queue/Deque + Trees (Basic)

    Easy
  12. 177
    Symmetric Tree

    Queue/Deque + Trees (Basic)

    Easy
  13. 178
    Same Tree

    Queue/Deque + Trees (Basic)

    Easy
  14. 179
    Invert Binary Tree

    Queue/Deque + Trees (Basic)

    Easy
  15. 180
    Balanced Binary Tree

    Queue/Deque + Trees (Basic)

    Easy
  16. 181
    Path Sum II

    Queue/Deque + Trees (Basic)

    Medium
  17. 182
    Validate Binary Search Tree

    Queue/Deque + Trees (Basic)

    Medium
  18. 183
    Insert into a Binary Search Tree

    Queue/Deque + Trees (Basic)

    Medium
  19. 184
    Delete Node in a BST

    Queue/Deque + Trees (Basic)

    Medium
  20. 185
    Search in a Binary Search Tree

    Queue/Deque + Trees (Basic)

    Easy
  21. 186Easy
  22. 187
    Kth Smallest Element in a BST

    Queue/Deque + Trees (Basic)

    Medium
  23. 188Medium
  24. 189Medium
  25. 190Medium
  26. 191
    Binary Tree Right Side View

    Queue/Deque + Trees (Basic)

    Medium
  27. 192
    Flatten Binary Tree to Linked List

    Queue/Deque + Trees (Basic)

    Medium
  28. 193
    Sum Root to Leaf Numbers

    Queue/Deque + Trees (Basic)

    Medium
  29. 194
    Count Complete Tree Nodes

    Queue/Deque + Trees (Basic)

    Easy
  30. 195
    Average of Levels in Binary Tree

    Queue/Deque + Trees (Basic)

    Easy

Week 8: Trees Advanced + Heap/PriorityQueue

30 problems · Binary search trees, lowest common ancestor, serialization, and top-K or merge-K problems with heaps

0/30
  1. 196
    Lowest Common Ancestor of a Binary Tree

    Trees Advanced + Heap/PriorityQueue

    Medium
  2. 197
    Lowest Common Ancestor of a Binary Search Tree

    Trees Advanced + Heap/PriorityQueue

    Medium
  3. 198
    Diameter of Binary Tree

    Trees Advanced + Heap/PriorityQueue

    Easy
  4. 199
    Binary Tree Maximum Path Sum

    Trees Advanced + Heap/PriorityQueue

    Hard
  5. 200
    Serialize and Deserialize Binary Tree

    Trees Advanced + Heap/PriorityQueue

    Hard
  6. 201
    Vertical Order Traversal of a Binary Tree

    Trees Advanced + Heap/PriorityQueue

    Hard
  7. 202
    Cousins in Binary Tree

    Trees Advanced + Heap/PriorityQueue

    Easy
  8. 203
    All Nodes Distance K in Binary Tree

    Trees Advanced + Heap/PriorityQueue

    Medium
  9. 204
    House Robber III

    Trees Advanced + Heap/PriorityQueue

    Medium
  10. 205
    Unique Binary Search Trees

    Trees Advanced + Heap/PriorityQueue

    Medium
  11. 206
    Unique Binary Search Trees II

    Trees Advanced + Heap/PriorityQueue

    Medium
  12. 207
    Recover Binary Search Tree

    Trees Advanced + Heap/PriorityQueue

    Medium
  13. 208
    Kth Largest Element in a Stream

    Trees Advanced + Heap/PriorityQueue

    Easy
  14. 209
    Last Stone Weight

    Trees Advanced + Heap/PriorityQueue

    Easy
  15. 210
    K Closest Points to Origin

    Trees Advanced + Heap/PriorityQueue

    Medium
  16. 211
    Find Median from Data Stream

    Trees Advanced + Heap/PriorityQueue

    Hard
  17. 212
    Reorganize String

    Trees Advanced + Heap/PriorityQueue

    Medium
  18. 213
    Ugly Number II

    Trees Advanced + Heap/PriorityQueue

    Medium
  19. 214
    Super Ugly Number

    Trees Advanced + Heap/PriorityQueue

    Medium
  20. 215
    IPO

    Trees Advanced + Heap/PriorityQueue

    Hard
  21. 216
    Single-Threaded CPU

    Trees Advanced + Heap/PriorityQueue

    Medium
  22. 217
    Design Twitter

    Trees Advanced + Heap/PriorityQueue

    Medium
  23. 218
    The Skyline Problem

    Trees Advanced + Heap/PriorityQueue

    Hard
  24. 219
    Smallest Range Covering Elements from K Lists

    Trees Advanced + Heap/PriorityQueue

    Hard
  25. 220
    Sliding Window Median

    Trees Advanced + Heap/PriorityQueue

    Hard
  26. 221
    Maximum Performance of a Team

    Trees Advanced + Heap/PriorityQueue

    Hard
  27. 222
    Relative Ranks

    Trees Advanced + Heap/PriorityQueue

    Easy
  28. 223
    Third Maximum Number

    Trees Advanced + Heap/PriorityQueue

    Easy
  29. 224
    Furthest Building You Can Reach

    Trees Advanced + Heap/PriorityQueue

    Medium
  30. 225
    Minimum Number of Refueling Stops

    Trees Advanced + Heap/PriorityQueue

    Hard

Week 9: Graphs

30 problems · BFS, DFS, topological sort, union-find and shortest paths on grids and graphs

0/30
  1. 226Medium
  2. 227Medium
  3. 228Easy
  4. 229Medium
  5. 230Medium
  6. 231Medium
  7. 232Medium
  8. 233Medium
  9. 234Medium
  10. 235Hard
  11. 236Hard
  12. 237Medium
  13. 238Medium
  14. 239Medium
  15. 240Medium
  16. 241Medium
  17. 242Medium
  18. 243Hard
  19. 244Medium
  20. 245Medium
  21. 246Medium
  22. 247Medium
  23. 248Medium
  24. 249Hard
  25. 250Hard
  26. 251Easy
  27. 252Hard
  28. 253Hard
  29. 254Hard
  30. 255Medium

Week 10: Dynamic Programming (1D/2D)

32 problems · From climbing stairs to grid paths, knapsack and longest common subsequence

0/32
  1. 256
    House Robber

    Dynamic Programming (1D/2D)

    Medium
  2. 257
    House Robber II

    Dynamic Programming (1D/2D)

    Medium
  3. 258
    Coin Change

    Dynamic Programming (1D/2D)

    Medium
  4. 259
    Coin Change II

    Dynamic Programming (1D/2D)

    Medium
  5. 260
    Longest Increasing Subsequence

    Dynamic Programming (1D/2D)

    Medium
  6. 261
    Longest Common Subsequence

    Dynamic Programming (1D/2D)

    Medium
  7. 262
    Edit Distance

    Dynamic Programming (1D/2D)

    Hard
  8. 263
    Partition Equal Subset Sum

    Dynamic Programming (1D/2D)

    Medium
  9. 264
    Target Sum

    Dynamic Programming (1D/2D)

    Medium
  10. 265
    Unique Paths II

    Dynamic Programming (1D/2D)

    Medium
  11. 266
    Minimum Path Sum

    Dynamic Programming (1D/2D)

    Medium
  12. 267
    Triangle

    Dynamic Programming (1D/2D)

    Medium
  13. 268
    Decode Ways

    Dynamic Programming (1D/2D)

    Medium
  14. 269
    Word Break II

    Dynamic Programming (1D/2D)

    Hard
  15. 270
    Longest Palindromic Subsequence

    Dynamic Programming (1D/2D)

    Medium
  16. 271
    Interleaving String

    Dynamic Programming (1D/2D)

    Medium
  17. 272
    Distinct Subsequences

    Dynamic Programming (1D/2D)

    Hard
  18. 273
    Best Time to Buy and Sell Stock II

    Dynamic Programming (1D/2D)

    Medium
  19. 274
    Best Time to Buy and Sell Stock III

    Dynamic Programming (1D/2D)

    Hard
  20. 275
    Best Time to Buy and Sell Stock IV

    Dynamic Programming (1D/2D)

    Hard
  21. 276Medium
  22. 277
    Maximal Square

    Dynamic Programming (1D/2D)

    Medium
  23. 278
    Perfect Squares

    Dynamic Programming (1D/2D)

    Medium
  24. 279
    Integer Break

    Dynamic Programming (1D/2D)

    Medium
  25. 280
    Min Cost Climbing Stairs

    Dynamic Programming (1D/2D)

    Easy
  26. 281
    Delete and Earn

    Dynamic Programming (1D/2D)

    Medium
  27. 282
    Ones and Zeroes

    Dynamic Programming (1D/2D)

    Medium
  28. 283
    Regular Expression Matching

    Dynamic Programming (1D/2D)

    Hard
  29. 284
    Wildcard Matching

    Dynamic Programming (1D/2D)

    Hard
  30. 285
    Burst Balloons

    Dynamic Programming (1D/2D)

    Hard
  31. 286
    Stone Game

    Dynamic Programming (1D/2D)

    Medium
  32. 287
    Number of Longest Increasing Subsequence

    Dynamic Programming (1D/2D)

    Medium

Week 11: DP Advanced + Greedy

28 problems · Interval and partition DP, stock problems, and greedy choices you can prove with an exchange argument

0/28
  1. 288
    Russian Doll Envelopes

    DP Advanced + Greedy

    Hard
  2. 289
    Maximum Sum Circular Subarray

    DP Advanced + Greedy

    Medium
  3. 290
    Cherry Pickup

    DP Advanced + Greedy

    Hard
  4. 291
    Dungeon Game

    DP Advanced + Greedy

    Hard
  5. 292
    Super Egg Drop

    DP Advanced + Greedy

    Hard
  6. 293
    Palindrome Partitioning II

    DP Advanced + Greedy

    Hard
  7. 294Hard
  8. 295
    Shortest Common Supersequence

    DP Advanced + Greedy

    Hard
  9. 296
    Jump Game

    DP Advanced + Greedy

    Medium
  10. 297
    Jump Game II

    DP Advanced + Greedy

    Medium
  11. 298
    Candy

    DP Advanced + Greedy

    Hard
  12. 299
    Partition Labels

    DP Advanced + Greedy

    Medium
  13. 300Medium
  14. 301
    Queue Reconstruction by Height

    DP Advanced + Greedy

    Medium
  15. 302
    Boats to Save People

    DP Advanced + Greedy

    Medium
  16. 303
    Assign Cookies

    DP Advanced + Greedy

    Easy
  17. 304
    Lemonade Change

    DP Advanced + Greedy

    Easy
  18. 305
    Two City Scheduling

    DP Advanced + Greedy

    Medium
  19. 306
    Car Pooling

    DP Advanced + Greedy

    Medium
  20. 307
    Valid Parenthesis String

    DP Advanced + Greedy

    Medium
  21. 308
    Remove Duplicate Letters

    DP Advanced + Greedy

    Medium
  22. 309
    Create Maximum Number

    DP Advanced + Greedy

    Hard
  23. 310
    Advantage Shuffle

    DP Advanced + Greedy

    Medium
  24. 311Medium
  25. 312
    Bag of Tokens

    DP Advanced + Greedy

    Medium
  26. 313
    Jump Game III

    DP Advanced + Greedy

    Medium
  27. 314
    Jump Game IV

    DP Advanced + Greedy

    Hard
  28. 315
    Video Stitching

    DP Advanced + Greedy

    Medium

Week 12: Tries + Bit Manipulation + Math

16 problems · Prefix trees for word problems, XOR and bitmask tricks, and the number theory interviewers still ask

0/16
  1. 316
    Implement Trie (Prefix Tree)

    Tries + Bit Manipulation + Math

    Medium
  2. 317
    Design Add and Search Words Data Structure

    Tries + Bit Manipulation + Math

    Medium
  3. 318
    Replace Words

    Tries + Bit Manipulation + Math

    Medium
  4. 319
    Maximum XOR of Two Numbers in an Array

    Tries + Bit Manipulation + Math

    Medium
  5. 320
    Longest Word in Dictionary

    Tries + Bit Manipulation + Math

    Easy
  6. 321
    Single Number II

    Tries + Bit Manipulation + Math

    Medium
  7. 322
    Single Number III

    Tries + Bit Manipulation + Math

    Medium
  8. 323
    Number of 1 Bits

    Tries + Bit Manipulation + Math

    Easy
  9. 324
    Counting Bits

    Tries + Bit Manipulation + Math

    Easy
  10. 325
    Reverse Bits

    Tries + Bit Manipulation + Math

    Easy
  11. 326
    Sum of Two Integers

    Tries + Bit Manipulation + Math

    Medium
  12. 327
    Bitwise AND of Numbers Range

    Tries + Bit Manipulation + Math

    Medium
  13. 328
    Divide Two Integers

    Tries + Bit Manipulation + Math

    Medium
  14. 329
    Gray Code

    Tries + Bit Manipulation + Math

    Medium
  15. 330
    XOR Operation in an Array

    Tries + Bit Manipulation + Math

    Easy
  16. 331
    Fraction to Recurring Decimal

    Tries + Bit Manipulation + Math

    Medium

Week 13: Pure Revision / Mixed Practice

28 problems · Mixed problems without topic labels, the way real interviews feel

0/28
  1. 332
    LFU Cache

    Pure Revision / Mixed Practice

    Hard
  2. 333
    Design Underground System

    Pure Revision / Mixed Practice

    Medium
  3. 334
    Merge Two Binary Trees

    Pure Revision / Mixed Practice

    Easy
  4. 335
    Path Sum III

    Pure Revision / Mixed Practice

    Medium
  5. 336
    Binary Search Tree Iterator

    Pure Revision / Mixed Practice

    Medium
  6. 337
    Find K Closest Elements

    Pure Revision / Mixed Practice

    Medium
  7. 338
    Continuous Subarray Sum

    Pure Revision / Mixed Practice

    Medium
  8. 339
    Subarray Product Less Than K

    Pure Revision / Mixed Practice

    Medium
  9. 340
    Max Consecutive Ones III

    Pure Revision / Mixed Practice

    Medium
  10. 341
    Product of the Last K Numbers

    Pure Revision / Mixed Practice

    Medium
  11. 342
    Random Pick with Weight

    Pure Revision / Mixed Practice

    Medium
  12. 343
    Insert Delete GetRandom O(1)

    Pure Revision / Mixed Practice

    Medium
  13. 344
    All O`one Data Structure

    Pure Revision / Mixed Practice

    Hard
  14. 345
    Snake and Ladders

    Pure Revision / Mixed Practice

    Medium
  15. 346
    Open the Lock

    Pure Revision / Mixed Practice

    Medium
  16. 347
    Minimum Genetic Mutation

    Pure Revision / Mixed Practice

    Medium
  17. 348
    Course Schedule III

    Pure Revision / Mixed Practice

    Hard
  18. 349
    Trapping Rain Water II

    Pure Revision / Mixed Practice

    Hard
  19. 350
    Basic Calculator

    Pure Revision / Mixed Practice

    Hard
  20. 351
    Basic Calculator II

    Pure Revision / Mixed Practice

    Medium
  21. 352
    Simplify Path

    Pure Revision / Mixed Practice

    Medium
  22. 353
    Exclusive Time of Functions

    Pure Revision / Mixed Practice

    Medium
  23. 354
    Design Parking System

    Pure Revision / Mixed Practice

    Easy
  24. 355
    Shuffle an Array

    Pure Revision / Mixed Practice

    Medium
  25. 356
    Kth Missing Positive Number

    Pure Revision / Mixed Practice

    Easy
  26. 357
    Find the Duplicate Number

    Pure Revision / Mixed Practice

    Medium
  27. 358
    Set Matrix Zeroes

    Pure Revision / Mixed Practice

    Medium
  28. 359
    Spiral Matrix

    Pure Revision / Mixed Practice

    Medium

The 13-week plan

What you'll cover each week

The sheet follows the order most interview prep should: build fluency first, then the patterns that appear in almost every round, then trees, graphs and dynamic programming. Aim for 3 to 4 problems a day and finish a week before moving on.

  1. WEEK 1 · 28 PROBLEMS

    Basic Programming Foundations

    Loops, math, digit and string basics, plus time and space complexity. Warm-up problems that make every later pattern easier to write.

    See Week 1 problems
  2. WEEK 2 · 30 PROBLEMS

    Arrays / Two Pointers / Sliding Window

    The most asked array patterns in interviews: prefix sums, two pointers on sorted data, and fixed or variable sliding windows.

    See Week 2 problems
  3. WEEK 3 · 27 PROBLEMS

    Binary Search / Sorting

    Binary search on arrays and on the answer, rotated arrays, and the sorting tricks that turn O(n²) ideas into O(n log n).

    See Week 3 problems
  4. WEEK 4 · 27 PROBLEMS

    Strings / HashMap / HashSet

    Frequency counting, anagrams, substrings and hashing patterns that show up in almost every online assessment.

    See Week 4 problems
  5. WEEK 5 · 23 PROBLEMS

    Recursion / Backtracking

    Subsets, permutations, combinations and grid search. Learn to draw the recursion tree before you code.

    See Week 5 problems
  6. WEEK 6 · 30 PROBLEMS

    LinkedList / Stack

    Pointer manipulation, fast and slow pointers, monotonic stacks and next-greater-element style questions.

    See Week 6 problems
  7. WEEK 7 · 30 PROBLEMS

    Queue/Deque + Trees (Basic)

    Queues and deques, then binary tree traversals, depth, diameter and level-order problems.

    See Week 7 problems
  8. WEEK 8 · 30 PROBLEMS

    Trees Advanced + Heap/PriorityQueue

    Binary search trees, lowest common ancestor, serialization, and top-K or merge-K problems with heaps.

    See Week 8 problems
  9. WEEK 9 · 30 PROBLEMS

    Graphs

    BFS, DFS, topological sort, union-find and shortest paths on grids and graphs.

    See Week 9 problems
  10. WEEK 10 · 32 PROBLEMS

    Dynamic Programming (1D/2D)

    From climbing stairs to grid paths, knapsack and longest common subsequence. Write recursion, then memoise, then tabulate.

    See Week 10 problems
  11. WEEK 11 · 28 PROBLEMS

    DP Advanced + Greedy

    Interval and partition DP, stock problems, and greedy choices you can prove with an exchange argument.

    See Week 11 problems
  12. WEEK 12 · 16 PROBLEMS

    Tries + Bit Manipulation + Math

    Prefix trees for word problems, XOR and bitmask tricks, and the number theory interviewers still ask.

    See Week 12 problems
  13. WEEK 13 · 28 PROBLEMS

    Pure Revision / Mixed Practice

    Mixed problems without topic labels, the way real interviews feel. Time yourself and revisit your notes.

    See Week 13 problems

DSA sheet questions

What is the JioCoder DSA sheet?

It is a free 13-week DSA sheet with 359 LeetCode problems (95 Easy, 208 Medium, 56 Hard) for placements and coding interviews. It covers arrays, strings, recursion, linked lists, trees, graphs, dynamic programming and more, and you can track every problem as Not Started, In Progress or Done.

Is this DSA sheet good for beginners?

Yes. Week 1 starts with programming foundations and complexity, and each week builds on the last. If you know one language (C++, Java, Python or JavaScript) and basic loops and functions, you can start today.

How long does it take to finish the DSA sheet?

The plan is 13 weeks at roughly 3 to 4 problems a day. Working professionals often take 4 to 5 months; that is fine as long as you finish each week before moving on.

How many DSA questions are enough for placements?

There is no magic number, but 300 to 400 well-chosen problems across all major patterns is enough for most product-company interviews in India. Understanding the pattern behind each problem matters more than the count.

Is this DSA sheet free?

Yes. Every problem and the tracker are free. Sign in only if you want progress saved to your JioCoder profile and counted on the leaderboard.

Does marking a problem Done update my rank?

Yes when you are signed in. Done awards XP (Easy 30, Medium 50, Hard 80), updates your profile, and can raise your rank on the JioCoder leaderboard.

Can I use the sheet without signing in?

Yes. Status and notes are stored in your browser. After you sign in, local progress merges into your profile.