Advanced Algorithms Visualizer
Step-by-step execution, multi-lingual narration, and code highlighting.
Blind 75 Must-Do Questions
Top 75 LeetCode questions for interview prep
Progress: 0 / 680%
17
Easy
44
Medium
7
Hard
0
Solved
1. Contains Duplicate
Arrays & Hashing
2. Two Sum
Arrays & Hashing
3. Top K Frequent Elements
Arrays & Hashing
4. Encode and Decode Strings
Arrays & Hashing
5. Product of Array Except Self
Arrays & Hashing
6. Valid Sudoku
Arrays & Hashing
7. Longest Consecutive Sequence
Arrays & Hashing
8. Valid Palindrome
Two Pointers
9. 3Sum
Two Pointers
10. Container With Most Water
Two Pointers
11. Trapping Rain Water
Two Pointers
12. Valid Parentheses
Stack
13. Search a 2D Matrix
Binary Search
14. Reverse Linked List
Linked List
15. Merge Two Sorted Lists
Linked List
16. Linked List Cycle
Linked List
17. Reorder List
Linked List
18. Remove Nth Node From End of List
Linked List
19. Merge K Sorted Lists
Linked List
20. Invert Binary Tree
Trees
21. Maximum Depth of Binary Tree
Trees
22. Same Tree
Trees
23. Subtree of Another Tree
Trees
24. Lowest Common Ancestor of a Binary Search Tree
Trees
25. Binary Tree Level Order Traversal
Trees
26. Validate Binary Search Tree
Trees
27. Kth Smallest Element In a Bst
Trees
28. Construct Binary Tree From Preorder And Inorder Traversal
Trees
29. Binary Tree Maximum Path Sum
Trees
30. Serialize And Deserialize Binary Tree
Trees
31. Find Median From Data Stream
Heap / Priority Queue
32. Implement Trie Prefix Tree
Tries
33. Design Add And Search Words Data Structure
Tries
34. Word Search II
Tries
35. Number of Islands
Graphs
36. Clone Graph
Graphs
37. Pacific Atlantic Water Flow
Graphs
38. Course Schedule
Graphs
39. Course Schedule II
Graphs
40. Graph Valid Tree
Graphs
41. Alien Dictionary
Advanced Graphs
42. Climbing Stairs
1-D Dynamic Programming
43. House Robber
1-D Dynamic Programming
44. House Robber II
1-D Dynamic Programming
45. Decode Ways
1-D Dynamic Programming
46. Coin Change
1-D Dynamic Programming
47. Maximum Product Subarray
1-D Dynamic Programming
48. Word Break
1-D Dynamic Programming
49. Longest Increasing Subsequence
1-D Dynamic Programming
50. Unique Paths
2-D Dynamic Programming
51. Longest Common Subsequence
2-D Dynamic Programming
52. Coin Change II
2-D Dynamic Programming
53. Maximum Subarray
Greedy
54. Jump Game
Greedy
55. Jump Game II
Greedy
56. Insert Interval
Intervals
57. Merge Intervals
Intervals
58. Non Overlapping Intervals
Intervals
59. Meeting Rooms
Intervals
60. Meeting Rooms II
Intervals
61. Rotate Image
Math & Geometry
62. Spiral Matrix
Math & Geometry
63. Set Matrix Zeroes
Math & Geometry
64. Number of 1 Bits
Bit Manipulation
65. Counting Bits
Bit Manipulation
66. Reverse Bits
Bit Manipulation
67. Missing Number
Bit Manipulation
68. Sum of Two Integers
Bit Manipulation