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.
Week 1: Basic Programming Foundations
0/28
Week 1: Basic Programming Foundations
- 1Reverse StringEasy
Basic Programming Foundations
- 2Reverse IntegerMedium
Basic Programming Foundations
- 3Palindrome NumberEasy
Basic Programming Foundations
- 4Valid AnagramEasy
Basic Programming Foundations
- 5Fizz BuzzEasy
Basic Programming Foundations
- 6Factorial Trailing ZeroesEasy
Basic Programming Foundations
- 7Fibonacci NumberEasy
Basic Programming Foundations
- 8Climbing StairsEasy
Basic Programming Foundations
- 9Sqrt(x)Easy
Basic Programming Foundations
- 10Power of TwoEasy
Basic Programming Foundations
- 11Power of ThreeEasy
Basic Programming Foundations
- 12Power of FourEasy
Basic Programming Foundations
- 13Happy NumberEasy
Basic Programming Foundations
- 14Add DigitsEasy
Basic Programming Foundations
- 15Count PrimesMedium
Basic Programming Foundations
- 16Missing NumberEasy
Basic Programming Foundations
- 17Single NumberEasy
Basic Programming Foundations
- 18Plus OneEasy
Basic Programming Foundations
- 19Roman to IntegerEasy
Basic Programming Foundations
- 20Integer to RomanMedium
Basic Programming Foundations
- 21Length of Last WordEasy
Basic Programming Foundations
- 22Defanging an IP AddressEasy
Basic Programming Foundations
- 23Ugly NumberEasy
Basic Programming Foundations
- 24Excel Sheet Column NumberEasy
Basic Programming Foundations
- 25Excel Sheet Column TitleEasy
Basic Programming Foundations
- 26Greatest Common Divisor of StringsEasy
Basic Programming Foundations
- 27Jewels and StonesEasy
Basic Programming Foundations
- 28Number ComplementEasy
Basic Programming Foundations
Week 2: Arrays / Two Pointers / Sliding Window
0/30
Week 2: Arrays / Two Pointers / Sliding Window
- 29Two SumEasy
Arrays / Two Pointers / Sliding Window
- 30Best Time to Buy and Sell StockEasy
Arrays / Two Pointers / Sliding Window
- 31Contains DuplicateEasy
Arrays / Two Pointers / Sliding Window
- 32Product of Array Except SelfMedium
Arrays / Two Pointers / Sliding Window
- 33Maximum SubarrayMedium
Arrays / Two Pointers / Sliding Window
- 34Maximum Product SubarrayMedium
Arrays / Two Pointers / Sliding Window
- 35Find Minimum in Rotated Sorted ArrayMedium
Arrays / Two Pointers / Sliding Window
- 36Search in Rotated Sorted ArrayMedium
Arrays / Two Pointers / Sliding Window
- 373SumMedium
Arrays / Two Pointers / Sliding Window
- 38Container With Most WaterMedium
Arrays / Two Pointers / Sliding Window
- 39Trapping Rain WaterHard
Arrays / Two Pointers / Sliding Window
- 40Move ZeroesEasy
Arrays / Two Pointers / Sliding Window
- 41Remove Duplicates from Sorted ArrayEasy
Arrays / Two Pointers / Sliding Window
- 42Merge Sorted ArrayEasy
Arrays / Two Pointers / Sliding Window
- 43Squares of a Sorted ArrayEasy
Arrays / Two Pointers / Sliding Window
- 44Rotate ArrayMedium
Arrays / Two Pointers / Sliding Window
- 45Longest Substring Without Repeating CharactersMedium
Arrays / Two Pointers / Sliding Window
- 46Minimum Size Subarray SumMedium
Arrays / Two Pointers / Sliding Window
- 47Sliding Window MaximumHard
Arrays / Two Pointers / Sliding Window
- 48Longest Repeating Character ReplacementMedium
Arrays / Two Pointers / Sliding Window
- 49Permutation in StringMedium
Arrays / Two Pointers / Sliding Window
- 50Find All Anagrams in a StringMedium
Arrays / Two Pointers / Sliding Window
- 51Subarray Sum Equals KMedium
Arrays / Two Pointers / Sliding Window
- 52Two Sum II - Input Array Is SortedEasy
Arrays / Two Pointers / Sliding Window
- 534SumMedium
Arrays / Two Pointers / Sliding Window
- 54Sort ColorsMedium
Arrays / Two Pointers / Sliding Window
- 55Next PermutationMedium
Arrays / Two Pointers / Sliding Window
- 56Gas StationMedium
Arrays / Two Pointers / Sliding Window
- 57Majority ElementEasy
Arrays / Two Pointers / Sliding Window
- 58Merge IntervalsMedium
Arrays / Two Pointers / Sliding Window
Week 3: Binary Search / Sorting
0/27
Week 3: Binary Search / Sorting
- 59Binary SearchEasy
Binary Search / Sorting
- 60Search Insert PositionEasy
Binary Search / Sorting
- 61First Bad VersionEasy
Binary Search / Sorting
- 62Find First and Last Position of Element in Sorted ArrayMedium
Binary Search / Sorting
- 63Search a 2D MatrixMedium
Binary Search / Sorting
- 64Search a 2D Matrix IIMedium
Binary Search / Sorting
- 65Koko Eating BananasMedium
Binary Search / Sorting
- 66Capacity To Ship Packages Within D DaysMedium
Binary Search / Sorting
- 67Split Array Largest SumHard
Binary Search / Sorting
- 68Median of Two Sorted ArraysHard
Binary Search / Sorting
- 69Find Peak ElementMedium
Binary Search / Sorting
- 70Search in Rotated Sorted Array IIMedium
Binary Search / Sorting
- 71Time Based Key-Value StoreMedium
Binary Search / Sorting
- 72Kth Smallest Element in a Sorted MatrixMedium
Binary Search / Sorting
- 73Find Smallest Letter Greater Than TargetEasy
Binary Search / Sorting
- 74Single Element in a Sorted ArrayMedium
Binary Search / Sorting
- 75Sort an ArrayMedium
Binary Search / Sorting
- 76Kth Largest Element in an ArrayMedium
Binary Search / Sorting
- 77Largest NumberMedium
Binary Search / Sorting
- 78Non-overlapping IntervalsMedium
Binary Search / Sorting
- 79Insert IntervalMedium
Binary Search / Sorting
- 80Valid Triangle NumberMedium
Binary Search / Sorting
- 81H-IndexMedium
Binary Search / Sorting
- 82Pow(x, n)Medium
Binary Search / Sorting
- 83Find Minimum in Rotated Sorted Array IIHard
Binary Search / Sorting
- 84Peak Index in a Mountain ArrayMedium
Binary Search / Sorting
- 85Count of Smaller Numbers After SelfHard
Binary Search / Sorting
Week 4: Strings / HashMap / HashSet
0/27
Week 4: Strings / HashMap / HashSet
- 86Group AnagramsMedium
Strings / HashMap / HashSet
- 87Longest Palindromic SubstringMedium
Strings / HashMap / HashSet
- 88Palindromic SubstringsMedium
Strings / HashMap / HashSet
- 89Valid PalindromeEasy
Strings / HashMap / HashSet
- 90Longest Common PrefixEasy
Strings / HashMap / HashSet
- 91String to Integer (atoi)Medium
Strings / HashMap / HashSet
- 92Find the Index of the First Occurrence in a StringEasy
Strings / HashMap / HashSet
- 93Ransom NoteEasy
Strings / HashMap / HashSet
- 94Isomorphic StringsEasy
Strings / HashMap / HashSet
- 95Word PatternEasy
Strings / HashMap / HashSet
- 96Longest Consecutive SequenceMedium
Strings / HashMap / HashSet
- 97Top K Frequent ElementsMedium
Strings / HashMap / HashSet
- 98Minimum Window SubstringHard
Strings / HashMap / HashSet
- 99Zigzag ConversionMedium
Strings / HashMap / HashSet
- 100Multiply StringsMedium
Strings / HashMap / HashSet
- 101Reverse Words in a StringMedium
Strings / HashMap / HashSet
- 102Repeated Substring PatternEasy
Strings / HashMap / HashSet
- 103Count and SayMedium
Strings / HashMap / HashSet
- 104Word BreakMedium
Strings / HashMap / HashSet
- 105Design HashMapEasy
Strings / HashMap / HashSet
- 106Design HashSetEasy
Strings / HashMap / HashSet
- 107Contains Duplicate IIEasy
Strings / HashMap / HashSet
- 108Find All Duplicates in an ArrayMedium
Strings / HashMap / HashSet
- 109First Missing PositiveHard
Strings / HashMap / HashSet
- 110Sort Characters By FrequencyMedium
Strings / HashMap / HashSet
- 111Longest PalindromeEasy
Strings / HashMap / HashSet
- 112LRU CacheMedium
Strings / HashMap / HashSet
Week 5: Recursion / Backtracking
0/23
Week 5: Recursion / Backtracking
- 113SubsetsMedium
Recursion / Backtracking
- 114Subsets IIMedium
Recursion / Backtracking
- 115PermutationsMedium
Recursion / Backtracking
- 116Permutations IIMedium
Recursion / Backtracking
- 117CombinationsMedium
Recursion / Backtracking
- 118Combination SumMedium
Recursion / Backtracking
- 119Combination Sum IIMedium
Recursion / Backtracking
- 120Combination Sum IIIMedium
Recursion / Backtracking
- 121Generate ParenthesesMedium
Recursion / Backtracking
- 122Letter Combinations of a Phone NumberMedium
Recursion / Backtracking
- 123Word SearchMedium
Recursion / Backtracking
- 124Word Search IIHard
Recursion / Backtracking
- 125Palindrome PartitioningMedium
Recursion / Backtracking
- 126N-QueensHard
Recursion / Backtracking
- 127N-Queens IIHard
Recursion / Backtracking
- 128Sudoku SolverHard
Recursion / Backtracking
- 129Restore IP AddressesMedium
Recursion / Backtracking
- 130Beautiful ArrangementMedium
Recursion / Backtracking
- 131Combination Sum IVMedium
Recursion / Backtracking
- 132Unique PathsMedium
Recursion / Backtracking
- 133Binary Tree PathsEasy
Recursion / Backtracking
- 134Path SumEasy
Recursion / Backtracking
- 135All Paths From Source to TargetMedium
Recursion / Backtracking
Week 6: LinkedList / Stack
0/30
Week 6: LinkedList / Stack
- 136Reverse Linked ListEasy
LinkedList / Stack
- 137Merge Two Sorted ListsEasy
LinkedList / Stack
- 138Linked List CycleEasy
LinkedList / Stack
- 139Linked List Cycle IIMedium
LinkedList / Stack
- 140Remove Nth Node From End of ListMedium
LinkedList / Stack
- 141Reorder ListMedium
LinkedList / Stack
- 142Middle of the Linked ListEasy
LinkedList / Stack
- 143Palindrome Linked ListEasy
LinkedList / Stack
- 144Copy List with Random PointerMedium
LinkedList / Stack
- 145Add Two NumbersMedium
LinkedList / Stack
- 146Intersection of Two Linked ListsEasy
LinkedList / Stack
- 147Remove Duplicates from Sorted ListEasy
LinkedList / Stack
- 148Remove Duplicates from Sorted List IIMedium
LinkedList / Stack
- 149Swap Nodes in PairsMedium
LinkedList / Stack
- 150Reverse Nodes in k-GroupHard
LinkedList / Stack
- 151Rotate ListMedium
LinkedList / Stack
- 152Flatten a Multilevel Doubly Linked ListMedium
LinkedList / Stack
- 153Merge k Sorted ListsHard
LinkedList / Stack
- 154Design Linked ListMedium
LinkedList / Stack
- 155Valid ParenthesesEasy
LinkedList / Stack
- 156Min StackMedium
LinkedList / Stack
- 157Evaluate Reverse Polish NotationMedium
LinkedList / Stack
- 158Daily TemperaturesMedium
LinkedList / Stack
- 159Next Greater Element IEasy
LinkedList / Stack
- 160Next Greater Element IIMedium
LinkedList / Stack
- 161Largest Rectangle in HistogramHard
LinkedList / Stack
- 162Implement Queue using StacksEasy
LinkedList / Stack
- 163Implement Stack using QueuesEasy
LinkedList / Stack
- 164Decode StringMedium
LinkedList / Stack
- 165Asteroid CollisionMedium
LinkedList / Stack
Week 7: Queue/Deque + Trees (Basic)
0/30
Week 7: Queue/Deque + Trees (Basic)
- 166Design Circular QueueMedium
Queue/Deque + Trees (Basic)
- 167Number of Recent CallsEasy
Queue/Deque + Trees (Basic)
- 168Task SchedulerMedium
Queue/Deque + Trees (Basic)
- 169Design Circular DequeMedium
Queue/Deque + Trees (Basic)
- 170Binary Tree Inorder TraversalEasy
Queue/Deque + Trees (Basic)
- 171Binary Tree Preorder TraversalEasy
Queue/Deque + Trees (Basic)
- 172Binary Tree Postorder TraversalEasy
Queue/Deque + Trees (Basic)
- 173Binary Tree Level Order TraversalMedium
Queue/Deque + Trees (Basic)
- 174Binary Tree Zigzag Level Order TraversalMedium
Queue/Deque + Trees (Basic)
- 175Maximum Depth of Binary TreeEasy
Queue/Deque + Trees (Basic)
- 176Minimum Depth of Binary TreeEasy
Queue/Deque + Trees (Basic)
- 177Symmetric TreeEasy
Queue/Deque + Trees (Basic)
- 178Same TreeEasy
Queue/Deque + Trees (Basic)
- 179Invert Binary TreeEasy
Queue/Deque + Trees (Basic)
- 180Balanced Binary TreeEasy
Queue/Deque + Trees (Basic)
- 181Path Sum IIMedium
Queue/Deque + Trees (Basic)
- 182Validate Binary Search TreeMedium
Queue/Deque + Trees (Basic)
- 183Insert into a Binary Search TreeMedium
Queue/Deque + Trees (Basic)
- 184Delete Node in a BSTMedium
Queue/Deque + Trees (Basic)
- 185Search in a Binary Search TreeEasy
Queue/Deque + Trees (Basic)
- 186Convert Sorted Array to Binary Search TreeEasy
Queue/Deque + Trees (Basic)
- 187Kth Smallest Element in a BSTMedium
Queue/Deque + Trees (Basic)
- 188Construct Binary Tree from Preorder and Inorder TraversalMedium
Queue/Deque + Trees (Basic)
- 189Construct Binary Tree from Inorder and Postorder TraversalMedium
Queue/Deque + Trees (Basic)
- 190Populating Next Right Pointers in Each NodeMedium
Queue/Deque + Trees (Basic)
- 191Binary Tree Right Side ViewMedium
Queue/Deque + Trees (Basic)
- 192Flatten Binary Tree to Linked ListMedium
Queue/Deque + Trees (Basic)
- 193Sum Root to Leaf NumbersMedium
Queue/Deque + Trees (Basic)
- 194Count Complete Tree NodesEasy
Queue/Deque + Trees (Basic)
- 195Average of Levels in Binary TreeEasy
Queue/Deque + Trees (Basic)
Week 8: Trees Advanced + Heap/PriorityQueue
0/30
Week 8: Trees Advanced + Heap/PriorityQueue
- 196Lowest Common Ancestor of a Binary TreeMedium
Trees Advanced + Heap/PriorityQueue
- 197Lowest Common Ancestor of a Binary Search TreeMedium
Trees Advanced + Heap/PriorityQueue
- 198Diameter of Binary TreeEasy
Trees Advanced + Heap/PriorityQueue
- 199Binary Tree Maximum Path SumHard
Trees Advanced + Heap/PriorityQueue
- 200Serialize and Deserialize Binary TreeHard
Trees Advanced + Heap/PriorityQueue
- 201Vertical Order Traversal of a Binary TreeHard
Trees Advanced + Heap/PriorityQueue
- 202Cousins in Binary TreeEasy
Trees Advanced + Heap/PriorityQueue
- 203All Nodes Distance K in Binary TreeMedium
Trees Advanced + Heap/PriorityQueue
- 204House Robber IIIMedium
Trees Advanced + Heap/PriorityQueue
- 205Unique Binary Search TreesMedium
Trees Advanced + Heap/PriorityQueue
- 206Unique Binary Search Trees IIMedium
Trees Advanced + Heap/PriorityQueue
- 207Recover Binary Search TreeMedium
Trees Advanced + Heap/PriorityQueue
- 208Kth Largest Element in a StreamEasy
Trees Advanced + Heap/PriorityQueue
- 209Last Stone WeightEasy
Trees Advanced + Heap/PriorityQueue
- 210K Closest Points to OriginMedium
Trees Advanced + Heap/PriorityQueue
- 211Find Median from Data StreamHard
Trees Advanced + Heap/PriorityQueue
- 212Reorganize StringMedium
Trees Advanced + Heap/PriorityQueue
- 213Ugly Number IIMedium
Trees Advanced + Heap/PriorityQueue
- 214Super Ugly NumberMedium
Trees Advanced + Heap/PriorityQueue
- 215IPOHard
Trees Advanced + Heap/PriorityQueue
- 216Single-Threaded CPUMedium
Trees Advanced + Heap/PriorityQueue
- 217Design TwitterMedium
Trees Advanced + Heap/PriorityQueue
- 218The Skyline ProblemHard
Trees Advanced + Heap/PriorityQueue
- 219Smallest Range Covering Elements from K ListsHard
Trees Advanced + Heap/PriorityQueue
- 220Sliding Window MedianHard
Trees Advanced + Heap/PriorityQueue
- 221Maximum Performance of a TeamHard
Trees Advanced + Heap/PriorityQueue
- 222Relative RanksEasy
Trees Advanced + Heap/PriorityQueue
- 223Third Maximum NumberEasy
Trees Advanced + Heap/PriorityQueue
- 224Furthest Building You Can ReachMedium
Trees Advanced + Heap/PriorityQueue
- 225Minimum Number of Refueling StopsHard
Trees Advanced + Heap/PriorityQueue
Week 9: Graphs
0/30
Week 9: Graphs
- 226Number of IslandsMedium
Graphs
- 227Max Area of IslandMedium
Graphs
- 228Flood FillEasy
Graphs
- 229Clone GraphMedium
Graphs
- 230Course ScheduleMedium
Graphs
- 231Course Schedule IIMedium
Graphs
- 232Medium
- 233Rotting OrangesMedium
Graphs
- 234Surrounded RegionsMedium
Graphs
- 235Word LadderHard
Graphs
- 236Word Ladder IIHard
Graphs
- 237Network Delay TimeMedium
Graphs
- 238Medium
- 239Path With Minimum EffortMedium
Graphs
- 240Redundant ConnectionMedium
Graphs
- 241Number of ProvincesMedium
Graphs
- 242Is Graph Bipartite?Medium
Graphs
- 243Reconstruct ItineraryHard
Graphs
- 244Evaluate DivisionMedium
Graphs
- 245Minimum Height TreesMedium
Graphs
- 246Accounts MergeMedium
Graphs
- 247Medium
- 248Medium
- 249Swim in Rising WaterHard
Graphs
- 250Hard
- 251Find the Town JudgeEasy
Graphs
- 252Making A Large IslandHard
Graphs
- 253Hard
- 254Bus RoutesHard
Graphs
- 255Medium
Week 10: Dynamic Programming (1D/2D)
0/32
Week 10: Dynamic Programming (1D/2D)
- 256House RobberMedium
Dynamic Programming (1D/2D)
- 257House Robber IIMedium
Dynamic Programming (1D/2D)
- 258Coin ChangeMedium
Dynamic Programming (1D/2D)
- 259Coin Change IIMedium
Dynamic Programming (1D/2D)
- 260Longest Increasing SubsequenceMedium
Dynamic Programming (1D/2D)
- 261Longest Common SubsequenceMedium
Dynamic Programming (1D/2D)
- 262Edit DistanceHard
Dynamic Programming (1D/2D)
- 263Partition Equal Subset SumMedium
Dynamic Programming (1D/2D)
- 264Target SumMedium
Dynamic Programming (1D/2D)
- 265Unique Paths IIMedium
Dynamic Programming (1D/2D)
- 266Minimum Path SumMedium
Dynamic Programming (1D/2D)
- 267TriangleMedium
Dynamic Programming (1D/2D)
- 268Decode WaysMedium
Dynamic Programming (1D/2D)
- 269Word Break IIHard
Dynamic Programming (1D/2D)
- 270Longest Palindromic SubsequenceMedium
Dynamic Programming (1D/2D)
- 271Interleaving StringMedium
Dynamic Programming (1D/2D)
- 272Distinct SubsequencesHard
Dynamic Programming (1D/2D)
- 273Best Time to Buy and Sell Stock IIMedium
Dynamic Programming (1D/2D)
- 274Best Time to Buy and Sell Stock IIIHard
Dynamic Programming (1D/2D)
- 275Best Time to Buy and Sell Stock IVHard
Dynamic Programming (1D/2D)
- 276Best Time to Buy and Sell Stock with CooldownMedium
Dynamic Programming (1D/2D)
- 277Maximal SquareMedium
Dynamic Programming (1D/2D)
- 278Perfect SquaresMedium
Dynamic Programming (1D/2D)
- 279Integer BreakMedium
Dynamic Programming (1D/2D)
- 280Min Cost Climbing StairsEasy
Dynamic Programming (1D/2D)
- 281Delete and EarnMedium
Dynamic Programming (1D/2D)
- 282Ones and ZeroesMedium
Dynamic Programming (1D/2D)
- 283Regular Expression MatchingHard
Dynamic Programming (1D/2D)
- 284Wildcard MatchingHard
Dynamic Programming (1D/2D)
- 285Burst BalloonsHard
Dynamic Programming (1D/2D)
- 286Stone GameMedium
Dynamic Programming (1D/2D)
- 287Number of Longest Increasing SubsequenceMedium
Dynamic Programming (1D/2D)
Week 11: DP Advanced + Greedy
0/28
Week 11: DP Advanced + Greedy
- 288Russian Doll EnvelopesHard
DP Advanced + Greedy
- 289Maximum Sum Circular SubarrayMedium
DP Advanced + Greedy
- 290Cherry PickupHard
DP Advanced + Greedy
- 291Dungeon GameHard
DP Advanced + Greedy
- 292Super Egg DropHard
DP Advanced + Greedy
- 293Palindrome Partitioning IIHard
DP Advanced + Greedy
- 294Minimum Insertion Steps to Make a String PalindromeHard
DP Advanced + Greedy
- 295Shortest Common SupersequenceHard
DP Advanced + Greedy
- 296Jump GameMedium
DP Advanced + Greedy
- 297Jump Game IIMedium
DP Advanced + Greedy
- 298CandyHard
DP Advanced + Greedy
- 299Partition LabelsMedium
DP Advanced + Greedy
- 300Minimum Number of Arrows to Burst BalloonsMedium
DP Advanced + Greedy
- 301Queue Reconstruction by HeightMedium
DP Advanced + Greedy
- 302Boats to Save PeopleMedium
DP Advanced + Greedy
- 303Assign CookiesEasy
DP Advanced + Greedy
- 304Lemonade ChangeEasy
DP Advanced + Greedy
- 305Two City SchedulingMedium
DP Advanced + Greedy
- 306Car PoolingMedium
DP Advanced + Greedy
- 307Valid Parenthesis StringMedium
DP Advanced + Greedy
- 308Remove Duplicate LettersMedium
DP Advanced + Greedy
- 309Create Maximum NumberHard
DP Advanced + Greedy
- 310Advantage ShuffleMedium
DP Advanced + Greedy
- 311Minimum Domino Rotations For Equal RowMedium
DP Advanced + Greedy
- 312Bag of TokensMedium
DP Advanced + Greedy
- 313Jump Game IIIMedium
DP Advanced + Greedy
- 314Jump Game IVHard
DP Advanced + Greedy
- 315Video StitchingMedium
DP Advanced + Greedy
Week 12: Tries + Bit Manipulation + Math
0/16
Week 12: Tries + Bit Manipulation + Math
- 316Implement Trie (Prefix Tree)Medium
Tries + Bit Manipulation + Math
- 317Design Add and Search Words Data StructureMedium
Tries + Bit Manipulation + Math
- 318Replace WordsMedium
Tries + Bit Manipulation + Math
- 319Maximum XOR of Two Numbers in an ArrayMedium
Tries + Bit Manipulation + Math
- 320Longest Word in DictionaryEasy
Tries + Bit Manipulation + Math
- 321Single Number IIMedium
Tries + Bit Manipulation + Math
- 322Single Number IIIMedium
Tries + Bit Manipulation + Math
- 323Number of 1 BitsEasy
Tries + Bit Manipulation + Math
- 324Counting BitsEasy
Tries + Bit Manipulation + Math
- 325Reverse BitsEasy
Tries + Bit Manipulation + Math
- 326Sum of Two IntegersMedium
Tries + Bit Manipulation + Math
- 327Bitwise AND of Numbers RangeMedium
Tries + Bit Manipulation + Math
- 328Divide Two IntegersMedium
Tries + Bit Manipulation + Math
- 329Gray CodeMedium
Tries + Bit Manipulation + Math
- 330XOR Operation in an ArrayEasy
Tries + Bit Manipulation + Math
- 331Fraction to Recurring DecimalMedium
Tries + Bit Manipulation + Math
Week 13: Pure Revision / Mixed Practice
0/28
Week 13: Pure Revision / Mixed Practice
- 332LFU CacheHard
Pure Revision / Mixed Practice
- 333Design Underground SystemMedium
Pure Revision / Mixed Practice
- 334Merge Two Binary TreesEasy
Pure Revision / Mixed Practice
- 335Path Sum IIIMedium
Pure Revision / Mixed Practice
- 336Binary Search Tree IteratorMedium
Pure Revision / Mixed Practice
- 337Find K Closest ElementsMedium
Pure Revision / Mixed Practice
- 338Continuous Subarray SumMedium
Pure Revision / Mixed Practice
- 339Subarray Product Less Than KMedium
Pure Revision / Mixed Practice
- 340Max Consecutive Ones IIIMedium
Pure Revision / Mixed Practice
- 341Product of the Last K NumbersMedium
Pure Revision / Mixed Practice
- 342Random Pick with WeightMedium
Pure Revision / Mixed Practice
- 343Insert Delete GetRandom O(1)Medium
Pure Revision / Mixed Practice
- 344All O`one Data StructureHard
Pure Revision / Mixed Practice
- 345Snake and LaddersMedium
Pure Revision / Mixed Practice
- 346Open the LockMedium
Pure Revision / Mixed Practice
- 347Minimum Genetic MutationMedium
Pure Revision / Mixed Practice
- 348Course Schedule IIIHard
Pure Revision / Mixed Practice
- 349Trapping Rain Water IIHard
Pure Revision / Mixed Practice
- 350Basic CalculatorHard
Pure Revision / Mixed Practice
- 351Basic Calculator IIMedium
Pure Revision / Mixed Practice
- 352Simplify PathMedium
Pure Revision / Mixed Practice
- 353Exclusive Time of FunctionsMedium
Pure Revision / Mixed Practice
- 354Design Parking SystemEasy
Pure Revision / Mixed Practice
- 355Shuffle an ArrayMedium
Pure Revision / Mixed Practice
- 356Kth Missing Positive NumberEasy
Pure Revision / Mixed Practice
- 357Find the Duplicate NumberMedium
Pure Revision / Mixed Practice
- 358Set Matrix ZeroesMedium
Pure Revision / Mixed Practice
- 359Spiral MatrixMedium
Pure Revision / Mixed Practice
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.
- 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 - 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 - 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 - 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 - 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 - WEEK 6 · 30 PROBLEMS
LinkedList / Stack
Pointer manipulation, fast and slow pointers, monotonic stacks and next-greater-element style questions.
See Week 6 problems - 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 - 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 - WEEK 9 · 30 PROBLEMS
Graphs
BFS, DFS, topological sort, union-find and shortest paths on grids and graphs.
See Week 9 problems - 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 - 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 - 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 - 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.
More practice on JioCoder
- Company-wise interview tracks
- SQL Lab: 40 database tickets
- DSA visualizer (DSA Seekho)
- DSA questions hub
- Developer roadmaps 2027
- DSA sheet leaderboard
- Leaderboard
Stuck on a pattern, or not sure the sheet fits your target company? Talk to Sumit.