Problems
Every problem, one list
All 121 LeetCode 75 questions and visual algorithm exercises. Tick a problem when you solve it. Solving counts towards your daily streak.
Easy
0/37
Medium
0/75
Hard
0/9
Sign in to track solved problems and build your streak.
- 1768. Merge Strings Alternately
LeetCode 75 · Array / String
Easytwo pointersstringEasy - 1071. Greatest Common Divisor of Strings
LeetCode 75 · Array / String
EasymathstringEasy - 1431. Kids With the Greatest Number of Candies
LeetCode 75 · Array / String
EasyarrayEasy - 605. Can Place Flowers
LeetCode 75 · Array / String
EasyarraygreedyEasy - 345. Reverse Vowels of a String
LeetCode 75 · Array / String
Easytwo pointersstringEasy - 151. Reverse Words in a String
LeetCode 75 · Array / String
Mediumtwo pointersstringMedium - 238. Product of Array Except Self
LeetCode 75 · Array / String
Mediumarrayprefix sumMedium - 334. Increasing Triplet Subsequence
LeetCode 75 · Array / String
MediumarraygreedyMedium - 443. String Compression
LeetCode 75 · Array / String
Mediumtwo pointersstringMedium - 283. Move Zeroes
LeetCode 75 · Two Pointers
Easyarraytwo pointersEasy - 392. Is Subsequence
LeetCode 75 · Two Pointers
Easytwo pointersstringdynamic programmingEasy - 11. Container With Most Water
LeetCode 75 · Two Pointers
Mediumarraytwo pointersgreedyMedium - 1679. Max Number of K-Sum Pairs
LeetCode 75 · Two Pointers
Mediumarrayhash tabletwo pointersMedium - 643. Maximum Average Subarray I
LeetCode 75 · Sliding Window
Easyarraysliding windowEasy - 1456. Maximum Number of Vowels in a Substring of Given Length
LeetCode 75 · Sliding Window
Mediumstringsliding windowMedium - 1004. Max Consecutive Ones III
LeetCode 75 · Sliding Window
Mediumarraybinary searchsliding windowMedium - 1493. Longest Subarray of 1's After Deleting One Element
LeetCode 75 · Sliding Window
Mediumarraydynamic programmingsliding windowMedium - 1732. Find the Highest Altitude
LeetCode 75 · Prefix Sum
Easyarrayprefix sumEasy - 724. Find Pivot Index
LeetCode 75 · Prefix Sum
Easyarrayprefix sumEasy - 2215. Find the Difference of Two Arrays
LeetCode 75 · Hash Map / Set
Easyarrayhash tableEasy - 1207. Unique Number of Occurrences
LeetCode 75 · Hash Map / Set
Easyarrayhash tableEasy - 1657. Determine if Two Strings Are Close
LeetCode 75 · Hash Map / Set
Mediumhash tablestringsortingMedium - 2352. Equal Row and Column Pairs
LeetCode 75 · Hash Map / Set
Mediumarrayhash tablematrixMedium - 2390. Removing Stars From a String
LeetCode 75 · Stack
MediumstringstacksimulationMedium - 735. Asteroid Collision
LeetCode 75 · Stack
MediumarraystacksimulationMedium - 394. Decode String
LeetCode 75 · Stack
MediumstringstackrecursionMedium - 933. Number of Recent Calls
LeetCode 75 · Queue
Easydesignqueuedata streamEasy - 649. Dota2 Senate
LeetCode 75 · Queue
MediumstringgreedyqueueMedium - 2095. Delete the Middle Node of a Linked List
LeetCode 75 · Linked List
Mediumlinked listtwo pointersMedium - 328. Odd Even Linked List
LeetCode 75 · Linked List
Mediumlinked listMedium - 206. Reverse Linked List
LeetCode 75 · Linked List
Easylinked listrecursionEasy - 2130. Maximum Twin Sum of a Linked List
LeetCode 75 · Linked List
Mediumlinked listtwo pointersstackMedium - 104. Maximum Depth of Binary Tree
LeetCode 75 · Binary Tree - DFS
Easytreedepth first searchbreadth first searchEasy - 872. Leaf-Similar Trees
LeetCode 75 · Binary Tree - DFS
Easytreedepth first searchbinary treeEasy - 1448. Count Good Nodes in Binary Tree
LeetCode 75 · Binary Tree - DFS
Mediumtreedepth first searchbreadth first searchMedium - 437. Path Sum III
LeetCode 75 · Binary Tree - DFS
Mediumtreedepth first searchbinary treeMedium - 1372. Longest ZigZag Path in a Binary Tree
LeetCode 75 · Binary Tree - DFS
Mediumdynamic programmingtreedepth first searchMedium - 236. Lowest Common Ancestor of a Binary Tree
LeetCode 75 · Binary Tree - DFS
Mediumtreedepth first searchbinary treeMedium - 199. Binary Tree Right Side View
LeetCode 75 · Binary Tree - BFS
Mediumtreedepth first searchbreadth first searchMedium - 1161. Maximum Level Sum of a Binary Tree
LeetCode 75 · Binary Tree - BFS
Mediumtreedepth first searchbreadth first searchMedium - 700. Search in a Binary Search Tree
LeetCode 75 · Binary Search Tree
Easytreebinary search treebinary treeEasy - 450. Delete Node in a BST
LeetCode 75 · Binary Search Tree
Mediumtreebinary search treebinary treeMedium - 841. Keys and Rooms
LeetCode 75 · Graphs - DFS
Mediumdepth first searchbreadth first searchgraphMedium - 547. Number of Provinces
LeetCode 75 · Graphs - DFS
Mediumdepth first searchbreadth first searchunion findMedium - 1466. Reorder Routes to Make All Paths Lead to the City Zero
LeetCode 75 · Graphs - DFS
Mediumdepth first searchbreadth first searchgraphMedium - 399. Evaluate Division
LeetCode 75 · Graphs - DFS
Mediumarraystringdepth first searchMedium - 1926. Nearest Exit from Entrance in Maze
LeetCode 75 · Graphs - BFS
Mediumarraybreadth first searchmatrixMedium - 994. Rotting Oranges
LeetCode 75 · Graphs - BFS
Mediumarraybreadth first searchmatrixMedium - 215. Kth Largest Element in an Array
LeetCode 75 · Heap / Priority Queue
Mediumarraydivide and conquersortingMedium - 2336. Smallest Number in Infinite Set
LeetCode 75 · Heap / Priority Queue
Mediumhash tabledesignheap priority queueMedium - 2542. Maximum Subsequence Score
LeetCode 75 · Heap / Priority Queue
MediumarraygreedysortingMedium - 2462. Total Cost to Hire K Workers
LeetCode 75 · Heap / Priority Queue
Mediumarraytwo pointersheap priority queueMedium - 374. Guess Number Higher or Lower
LeetCode 75 · Binary Search
Easybinary searchinteractiveEasy - 2300. Successful Pairs of Spells and Potions
LeetCode 75 · Binary Search
Mediumarraytwo pointersbinary searchMedium - 162. Find Peak Element
LeetCode 75 · Binary Search
Mediumarraybinary searchMedium - 875. Koko Eating Bananas
LeetCode 75 · Binary Search
Mediumarraybinary searchMedium - 17. Letter Combinations of a Phone Number
LeetCode 75 · Backtracking
Mediumhash tablestringbacktrackingMedium - 216. Combination Sum III
LeetCode 75 · Backtracking
MediumarraybacktrackingMedium - 1137. N-th Tribonacci Number
LeetCode 75 · DP - 1D
Easymathdynamic programmingmemoizationEasy - 746. Min Cost Climbing Stairs
LeetCode 75 · DP - 1D
Easyarraydynamic programmingEasy - 198. House Robber
LeetCode 75 · DP - 1D
Mediumarraydynamic programmingMedium - 790. Domino and Tromino Tiling
LeetCode 75 · DP - 1D
Mediumdynamic programmingMedium - 62. Unique Paths
LeetCode 75 · DP - Multidimensional
Mediummathdynamic programmingcombinatoricsMedium - 1143. Longest Common Subsequence
LeetCode 75 · DP - Multidimensional
Mediumstringdynamic programmingMedium - 714. Best Time to Buy and Sell Stock with Transaction Fee
LeetCode 75 · DP - Multidimensional
Mediumarraydynamic programminggreedyMedium - 72. Edit Distance
LeetCode 75 · DP - Multidimensional
Mediumstringdynamic programmingMedium - 338. Counting Bits
LeetCode 75 · Bit Manipulation
Easydynamic programmingbit manipulationEasy - 136. Single Number
LeetCode 75 · Bit Manipulation
Easyarraybit manipulationEasy - 1318. Minimum Flips to Make a OR b Equal to c
LeetCode 75 · Bit Manipulation
Mediumbit manipulationMedium - 208. Implement Trie (Prefix Tree)
LeetCode 75 · Trie
Mediumhash tablestringdesignMedium - 1268. Search Suggestions System
LeetCode 75 · Trie
Mediumarraystringbinary searchMedium - 435. Non-overlapping Intervals
LeetCode 75 · Intervals
Mediumarraydynamic programminggreedyMedium - 452. Minimum Number of Arrows to Burst Balloons
LeetCode 75 · Intervals
MediumarraygreedysortingMedium - 739. Daily Temperatures
LeetCode 75 · Monotonic Stack
Mediumarraystackmonotonic stackMedium - 901. Online Stock Span
LeetCode 75 · Monotonic Stack
Mediumstackdesignmonotonic stackMedium - Big-O & Complexity Analysis
DSA Course · Foundations
EasyfoundationsEasy - Two Pointers (Pair Sum)
DSA Course · Arrays and Strings
Easyarrays and stringsEasy - Sliding Window (Max Sum)
DSA Course · Arrays and Strings
Easyarrays and stringsEasy - Linear Search
DSA Course · Searching Algorithms
Easysearching algorithmsEasy - Binary Search
DSA Course · Searching Algorithms
Easysearching algorithmsEasy - Bubble Sort
DSA Course · Sorting Algorithms
Easysorting algorithmsEasy - Selection Sort
DSA Course · Sorting Algorithms
Easysorting algorithmsEasy - Insertion Sort
DSA Course · Sorting Algorithms
Easysorting algorithmsEasy - Merge Sort
DSA Course · Sorting Algorithms
Easysorting algorithmsEasy - Quick Sort
DSA Course · Sorting Algorithms
Easysorting algorithmsEasy - Heap Sort
DSA Course · Sorting Algorithms
Easysorting algorithmsEasy - Singly Linked List
DSA Course · Linked Lists
Easylinked listsEasy - Doubly Linked List
DSA Course · Linked Lists
Easylinked listsEasy - Stack (LIFO)
DSA Course · Stacks and Queues
Easystacks and queuesEasy - Queue (FIFO)
DSA Course · Stacks and Queues
Easystacks and queuesEasy - Separate Chaining
DSA Course · Hashing
MediumhashingMedium - Linear Probing
DSA Course · Hashing
MediumhashingMedium - BST Insert
DSA Course · Trees
MediumtreesMedium - BST Search
DSA Course · Trees
MediumtreesMedium - In-order Traversal
DSA Course · Trees
MediumtreesMedium - Pre-order Traversal
DSA Course · Trees
MediumtreesMedium - Post-order Traversal
DSA Course · Trees
MediumtreesMedium - Level-order Traversal
DSA Course · Trees
MediumtreesMedium - Heap Insert (Bubble Up)
DSA Course · Heaps
MediumheapsMedium - Extract Max (Sift Down)
DSA Course · Heaps
MediumheapsMedium - Graph BFS
DSA Course · Graphs
MediumgraphsMedium - Graph DFS
DSA Course · Graphs
MediumgraphsMedium - Breadth-First Search (BFS)
DSA Course · Grid Algorithms
Mediumgrid algorithmsMedium - Depth-First Search (DFS)
DSA Course · Grid Algorithms
Mediumgrid algorithmsMedium - Dijkstra's Algorithm
DSA Course · Grid Algorithms
Mediumgrid algorithmsMedium - A* Search
DSA Course · Grid Algorithms
Mediumgrid algorithmsMedium - Factorial (Recursion)
DSA Course · Recursion
MediumrecursionMedium - Fibonacci with Memoization
DSA Course · Recursion
MediumrecursionMedium - Tower of Hanoi
DSA Course · Recursion
MediumrecursionMedium - N-Queens
DSA Course · Backtracking
HardbacktrackingHard - Activity Selection
DSA Course · Greedy Algorithms
Mediumgreedy algorithmsMedium - 0/1 Knapsack (DP)
DSA Course · Dynamic Programming
Harddynamic programmingHard - Longest Common Subsequence
DSA Course · Dynamic Programming
Harddynamic programmingHard - Bottom-up Fibonacci (DP)
DSA Course · Dynamic Programming
Harddynamic programmingHard - Bitwise Operations
DSA Course · Bit Manipulation
Mediumbit manipulationMedium - Trie Insert & Search
DSA Course · Tries
MediumtriesMedium - Union-Find
DSA Course · Disjoint Set Union
Harddisjoint set unionHard - Segment Tree (Range Sum)
DSA Course · Segment Trees and Fenwick Trees
Hardsegment trees and fenwick treesHard - Fenwick Tree (BIT)
DSA Course · Segment Trees and Fenwick Trees
Hardsegment trees and fenwick treesHard - Topological Sort (Kahn's)
DSA Course · Advanced Graph Algorithms
Hardadvanced graph algorithmsHard - Kruskal's MST
DSA Course · Advanced Graph Algorithms
Hardadvanced graph algorithmsHard