Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
awesome-leetcode
A curated list of awesome Leetcode problems, algorithms and data structures.
https://github.com/kiranpalsingh1806/awesome-leetcode
Last synced: about 12 hours ago
JSON representation
-
39. Two Dimensional Plane
- Queries On Number of Points Inside A Circle - dsa/blob/master/SOLUTIONS.md) |
- Max Points On A Line - dsa/blob/master/SOLUTIONS.md) |
- Min Cost To Connect All Points - dsa/blob/master/SOLUTIONS.md) |
- Detonate The Maximum Bombs - dsa/blob/master/SOLUTIONS.md) |
-
40. Two Pointer
- Add Two Numbers - dsa/blob/master/SOLUTIONS.md) |
- Two Sum - dsa/blob/master/SOLUTIONS.md) |
- Container With Most Water - dsa/blob/master/SOLUTIONS.md) |
- 3Sum - dsa/blob/master/SOLUTIONS.md) |
- 3Sum Closest - dsa/blob/master/SOLUTIONS.md) |
- Trapping Rain Water - dsa/blob/master/SOLUTIONS.md) |
- Sort Colors - dsa/blob/master/SOLUTIONS.md) |
- Lexicographically Smallest Palindrome - dsa/blob/master/SOLUTIONS.md) |
- Remove Nth Node From End of List - dsa/blob/master/SOLUTIONS.md) |
- Minimum Window Substring - dsa/blob/master/SOLUTIONS.md) |
- Maximum Product Subarray - dsa/blob/master/SOLUTIONS.md) |
- Linked List Cycle - dsa/blob/master/SOLUTIONS.md) |
- Linked List Cycle-II - dsa/blob/master/SOLUTIONS.md) |
- Sort List - dsa/blob/master/SOLUTIONS.md) |
- Remove Duplicates From Sorted List - dsa/blob/master/SOLUTIONS.md) |
- Reorder List - dsa/blob/master/SOLUTIONS.md) |
-
38. Trie
- Sum of Prefix Scores of Strings - of-prefix-scores-of-strings.md) |
- Implement Trie (Prefix Tree) - trie.md) |
- Search Suggestions System - suggestions-system.md) |
- Maximum XOR of Two Numbers In An Array - xor-of-two-numbers.md) |
- Concatenated Words - words.md) |
- Palindrome Pairs - pairs.md) |
- Maximum Genetic Difference Query - genetic-difference-query.md) |
- K Divisible Elements Subarray - divisible-elements-subarrays.md) |
-
36. Sum of First N Natural Numbers
- Number of Substrings With Only 1s - of-first-n-natural-numbers.md) |
- Count Number of Homogenous Substrings - of-first-n-natural-numbers.md) |
-
37. Topological Sort
- Parallel Courses III - sort.md) |
- Course Schedule - sort.md) |
- Build A Matrix With Conditions - sort.md) |
- Minimum Height Trees - sort.md) |
- Longest Incresing Path In A Matrix - sort.md) |
- Course Schedule II - sort.md) |
- All Ancestors of a Node In Directed Acyclic Graph - sort.md) |
- Number of Ways To Arrive At Destination - sort.md) |
-
34. Stack
- The Number of Weak Characters In The Game
- Construct Smallest Number From DI String
- Basic Calculator
- Longest Valid Parentheses
- Using A Robot To Print The Lexicographically Smallest String
- Valid Parentheses
- Next Greater Element I
- Backspace String Compare
- Min Stack
- Next Greater Element II
- 132 Patterns
- Daily Temperatures
- Score of Parentheses
- Validate Stack Sequences
- Maximum Frequency Stack
- Next Greater Node In Linked List
- Implement Queue Using Stacks
-
1. Backtracking
- Generate Parentheses - dsa/blob/master/SOLUTIONS.md) |
- Combination Sum - dsa/blob/master/SOLUTIONS.md) |
- Permutations - dsa/blob/master/SOLUTIONS.md) |
- Letter Combinations of a Phone Number - dsa/blob/master/SOLUTIONS.md) |
- Sudoku Solver - dsa/blob/master/SOLUTIONS.md) |
- Combination Sum II - dsa/blob/master/SOLUTIONS.md) |
- Permutations II - dsa/blob/master/SOLUTIONS.md) |
- N Queens - dsa/blob/master/SOLUTIONS.md) |
- Combinations - dsa/blob/master/SOLUTIONS.md) |
- Word Search - dsa/blob/master/SOLUTIONS.md) |
- Palindrome Partitioning - dsa/blob/master/SOLUTIONS.md) |
- Combination Sum III - dsa/blob/master/SOLUTIONS.md) |
-
2. Base Conversion
- Find Unique Binary String - conversion.md) |
-
35. Stringstream
-
5. Binary Search
- Search In Rotated Sorted Array - dsa/blob/master/SOLUTIONS.md) |
- Find First and Last Position of Element In Sorted Array - dsa/blob/master/SOLUTIONS.md) |
- Minimize Maximum of Array - dsa/blob/master/SOLUTIONS.md) |
-
6. Binary Trees
- Sum of Leaft Leaves - trees.md) |
- Construct String From Binary Tree - trees.md) |
- Balanced Binary Tree - trees.md) |
- Convert Sorted Array To Binary Search Tree - trees.md) |
- Sum Root To Leaf Numbers - trees.md) |
- Kth Smallest Element in a BST - trees.md) |
- Lowest Common Ancestor Of A Binary Tree - trees.md) |
- Serialize and Deserialize BST - trees.md) |
- Construct Binary Tree From Inorder and Postorder Traversal - trees.md) |
- Construct Binary Tree From Preorder and Inorder Traversal - trees.md) |
- Binary Tree Pruning - trees.md) |
- All Nodes Distance K In Binary Tree - trees.md) |
- Distribute Coins In Binary Tree - trees.md) |
- Vertical Order Traversal of A Binary Tree - trees.md) |
- Average of Levels In Binary Tree - trees.md) |
-
7. Bit Manipulation
- Power of Two - manipulation.md) |
- Divide Array Into Equal Pairs - manipulation.md) |
- Divide Two Integers - manipulation.md) |
- Check If A String Contains All Binary Codes of Size K - manipulation.md) |
- Concatenation of Consecutive Binary Numbers - manipulation.md) |
- Largest Combination With Bitwise AND Greater Than Zero - manipulation.md) |
- Maximum XOR After Operations - manipulation.md) |
- Smallest Subarrays With Maximum Bitwise OR - manipulation.md) |
- Longest Subarray With Maximum Bitwise AND - manipulation.md) |
- Minimize XOR - manipulation.md) |
- Closest Subsequence Sum - manipulation.md) |
- Find The Shortest Superstring - manipulation.md) |
- Number of One Bits - manipulation.md) |
- Subsets - manipulation.md) |
- Subsets II - manipulation.md) |
-
8. Bitmasks
- Fair Distribution of Cookies - dsa/blob/master/SOLUTIONS.md) |
- Count Number of Maximum Bitwise OR Subsets - dsa/blob/master/SOLUTIONS.md) |
-
9. Count Pairs In Array
- Count Nice Pairs In An Array - dsa/blob/master/SOLUTIONS.md) |
- Count Number of Bad Pairs - dsa/blob/master/SOLUTIONS.md) |
-
10. Custom Comparator
- Sort The People - comparator.md) |
- Sort Array By Parity - comparator.md) |
- Bitwise XOR of All Pairings - comparator.md) |
-
11. Design and Implementation
-
12. DFS
-
13. Dijkstra
- Path With Maximum Probability
- Find The City With The Smallest Number of Neighbors At A Threshold Distance
- Path With Minimum Effort
- Number of Restricted Paths From First To Last Node
- Minimum Cost To Reach Destination In Time
- Minimum Cost To Make At Least One Valid Path In A Grid
- Reachable Nodes in Subdivided Graph
- Design Graph With Shortest Path Calculator
- Cheapest Flights Within K Stops
- Network Delay Time
-
14. Dynamic Programming
-
15. Euler Circuit
- Reconstruct Itinerary - circuit.md) |
- Cracking The Safe - circuit.md) |
- Valid Arrangement of Pairs - circuit.md) |
-
16. Fenwick Tree
- Create Sorted Array Through Instructions - tree.md) |
- Count Good Triplets In An Array - tree.md) |
-
17. Greedy Scheduling
- Maximum Number of Events That Can Be Attended - dsa/blob/master/SOLUTIONS.md) |
- Single Threaded CPU - dsa/blob/master/SOLUTIONS.md) |
-
18. Heaps (Priority Queues)
- Sort Array By Increasing Frequency - array-by-increasing-frequency.md) |
- Kth Largest Element in An Array - largest-element-in-array.md) |
- Top K Frequent Elements - k-frequent-elements.md) |
- Sort Characters By Frequency - characters-by-frequency.md) |
- Find K Closest Elements
- Top K Frequent Words
- K Closest Points To Origin
- Reduce Array Size To The Half
- Reorganize String
- Sender With Largest Word Count
- Minimum Difference In Sums After Removal of Elements
- Course Schedule III
-
19. Intervals
-
20. Line Sweep
- Maximum Population Year - sweep.md) |
- Divide Intervals Into Minimum Number of Groups - sweep.md) |
- Describe The Painting - sweep.md) |
- Car Pooling - sweep.md) |
- Corporate Flight Bookings - sweep.md) |
- My Calendar II - sweep.md) |
- Minimum Interval To Include Each Query - sweep.md) |
- My Calendar III - sweep.md) |
- The Skyline Problem - sweep.md) |
- Number of Flowers In Full Bloom - sweep.md) |
-
21. Linked List
- Merge Two Sorted Lists - list.md) |
- Palindrome Linked List - list.md) |
- Middle of The Linked List - list.md) |
- Intersection of Two Linked List - list.md) |
- Rotate List - list.md) |
- Remove Duplicates From Sorted List II - list.md) |
- Partition List - list.md) |
- Reverse Linked List II - list.md) |
- Flatten Binary Tree To Linked List - list.md) |
- Populating Next Right Pointers In Each Node - list.md) |
- Copy List With Random Pointers - list.md) |
- Delete Node In A Linked List - list.md) |
- Odd Even Linked List - list.md) |
- Swapping Nodes In A Linked List - list.md) |
- Merge Nodes In Between Zeros - list.md) |
- Reverse Nodes In K Group - list.md) |
- Merge K Sorted Lists - list.md) |
-
22. LIS
-
23. Manacher
-
24. Matrix
-
25. Merge Sort
- Count of Smaller Numbers After Self - sort.md) |
- Count of Range Sum - sort.md) |
- Reverse Pairs - sort.md) |
- Number of Pairs Satisfying Inequality - sort.md) |
-
26. Minimum Spanning Trees
-
27. Prefix State Map
- Contiguous Array - state-map.md) |
- Find The Longest Substring Containing Vowels In Even Counts - state-map.md) |
- Find Longest Awesome Substring - state-map.md) |
- Number of Wonderful Substrings - state-map.md) |
-
28. Queries
-
29. Rolling Hash
- Repeated DNA Sequences - hash/repeated-dna-sequences.md) |
- Shortest Palindrome - hash/shortest-palindrome.md) |
- Longest Duplicate Substring - hash/longest-duplicate-substring.md) |
- Distinct Echo Substrings - hash/distinct-echo-substrings.md) |
- Sum of Scores of Built Strings - dsa/blob/master/SOLUTIONS.md) |
- Find Substring With Given Hash Value - hash/find-substring-with-given-hash-value.md) |
- Longest Common Subpath - hash/longest-common-subpath.md) |
-
30. Segment Tree
- Sum of Even Numbers After Queries - tree.md) |
- Range Sum Query - Mutable - tree.md) |
- Longest Increasing Subseqence - II - tree.md) |
- Falling Squares - tree.md) |
- Shifting Letters - II - tree.md) |
-
31. Sets
-
32. Sieve of Eratosthenes
- Count Primes - eratosthenes.md) |
- Four Divisors - eratosthenes.md) |
-
33. Sliding Window
- Longest Substring Without Repeating Characters - window.md) |
- Minimum Size Subarray Sum - window.md) |
- Number of Smooth Descent Periods of Stock - window.md) |
- Maximize The Confusion of An Exam - window.md) |
- Frequency of Most Frequent Element - window.md) |
- Max Consecutive Ones - III - window.md) |
- Longest Repeating Character Replacement - window.md) |
- Permutation In String - window.md) |
- Substring With Concatenation Of All Words - window.md) |
- Count Subarrays With Fixed Count - window/count-subarrays-with-fixed-count.md) |
-
41. Union Find
- Longest Consecutive Sequence - dsa/blob/master/SOLUTIONS.md) |
- Redundant Connections - dsa/blob/master/SOLUTIONS.md) |
- Max Area of Island - dsa/blob/master/SOLUTIONS.md) |
- Satifiability of Equality Equations - dsa/blob/master/SOLUTIONS.md) |
- Smallest String With Swaps - dsa/blob/master/SOLUTIONS.md) |
- Number of Good Paths - dsa/blob/master/SOLUTIONS.md) |
- Is Graph Bipartite ? - dsa/blob/master/SOLUTIONS.md) |
- Number of Islands - dsa/blob/master/SOLUTIONS.md) |
- Number of Provinces - dsa/blob/master/SOLUTIONS.md) |
Categories
34. Stack
17
21. Linked List
17
40. Two Pointer
16
6. Binary Trees
15
7. Bit Manipulation
15
18. Heaps (Priority Queues)
12
1. Backtracking
12
33. Sliding Window
10
20. Line Sweep
10
14. Dynamic Programming
10
13. Dijkstra
10
12. DFS
10
41. Union Find
9
11. Design and Implementation
9
37. Topological Sort
8
24. Matrix
8
38. Trie
8
29. Rolling Hash
7
19. Intervals
6
28. Queries
6
30. Segment Tree
5
25. Merge Sort
4
22. LIS
4
27. Prefix State Map
4
39. Two Dimensional Plane
4
10. Custom Comparator
3
35. Stringstream
3
5. Binary Search
3
15. Euler Circuit
3
36. Sum of First N Natural Numbers
2
23. Manacher
2
16. Fenwick Tree
2
17. Greedy Scheduling
2
8. Bitmasks
2
9. Count Pairs In Array
2
32. Sieve of Eratosthenes
2
31. Sets
1
2. Base Conversion
1
26. Minimum Spanning Trees
1
Sub Categories