An open API service indexing awesome lists of open source software.

https://github.com/skshahriarahmedraka/top-150-leetcode-interview-question-golang


https://github.com/skshahriarahmedraka/top-150-leetcode-interview-question-golang

Last synced: 5 months ago
JSON representation

Awesome Lists containing this project

README

        

List Collected From: https://neetcode.io/practice

#### Golang Implimentation By [Sk Shahriar Ahmed Raka](https://github.com/skshahriarahmedraka)

## Array & Hashing

1. [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) (easy) - [Problem](./1.Arrays&Hashing/217.%20Contains%20Duplicate/README.md) - [Solution](./1.Arrays&Hashing/217.%20Contains%20Duplicate/217.%20Contains%20Duplicate.go)

2. [Valid Anagram](https://leetcode.com/problems/valid-anagram/) (easy) -[Problem](./1.Arrays&Hashing/242.%20Valid%20Anagram/README.md) - [Solution](./1.Arrays%26Hashing/242.%20Valid%20Anagram/242.%20Valid%20Anagram.go)

3. [Two Sum](https://leetcode.com/problems/two-sum/) (easy) -[Problem](./1.Arrays&Hashing/1.%20Two%20Sum/README.md)- [Solution](./1.Arrays%26Hashing/1.%20Two%20Sum/1.%20Two%20Sum.go)

4. [Group Anagrams](https://leetcode.com/problems/group-anagrams/) (medium) -[Problem](./1.Arrays&Hashing/49.%20Group%20Anagrams/README.md)- [Solution](./1.Arrays%26Hashing/49.%20Group%20Anagrams/49.%20Group%20Anagrams.go)

5. [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) (medium) -[Problem](./1.Arrays&Hashing/347.%20Top%20K%20Frequent%20Elements/README.md) - [Solution](./1.Arrays%26Hashing/347.%20Top%20K%20Frequent%20Elements/347.%20Top%20K%20Frequent%20Elements.go)

6. [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) (medium) -[Problem](./1.Arrays&Hashing/238.%20Product%20of%20Array%20Except%20Self/README.md) - [Solution](./1.Arrays%26Hashing/238.%20Product%20of%20Array%20Except%20Self/238.%20Product%20of%20Array%20Except%20Self.go)

7. [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) (medium) -[Problem](./1.Arrays&Hashing/36.%20Valid%20Sudoku/README.md) - [Solution](./1.Arrays%26Hashing/36.%20Valid%20Sudoku/36.%20Valid%20Sudoku.go)

8. [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings/) (medium) -[Problem](./1.Arrays&Hashing/271.%20Encode%20and%20Decode%20Strings/README.md) - [Solution](./1.Arrays%26Hashing/271.%20Encode%20and%20Decode%20Strings/271.%20Encode%20and%20Decode%20Strings.go)

9. [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) (medium) -[Problem](./1.Arrays&Hashing/128.%20Longest%20Consecutive%20Sequence/README.md) - [Solution](./1.Arrays%26Hashing/128.%20Longest%20Consecutive%20Sequence/128.%20Longest%20Consecutive%20Sequence.go)

## Two Pointers

1. [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) (easy) -[Problem](./2.Two%20Pointer/125.%20Valid%20Palindrome/README.md) - [Solution](./2.Two%20Pointer/125.%20Valid%20Palindrome/125.%20Valid%20Palindrome.go)

2. [Two Sum II - Input Array Is Sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) (medium) -[Problem](./2.Two%20Pointer/167.%20Two%20Sum%20II%20-%20Input%20Array%20Is%20Sorted/README.md) - [Solution](./2.Two%20Pointer/167.%20Two%20Sum%20II%20-%20Input%20Array%20Is%20Sorted/167.%20Two%20Sum%20II%20-%20Input%20Array%20Is%20Sorted.go)

3. [3Sum](https://leetcode.com/problems/3sum/) (medium) -[Problem](./2.Two%20Pointer/15.%203Sum/README.md) - [Solution](./2.Two%20Pointer/15.%203Sum/15.%203Sum.go)

4. [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) (medium) -[Problem](./2.Two%20Pointer/11.%20Container%20With%20Most%20Water/README.md) - [Solution](./2.Two%20Pointer/11.%20Container%20With%20Most%20Water/11.%20Container%20With%20Most%20Water.go)

5. [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) (hard) -[Problem](./2.Two%20Pointer/42.%20Trapping%20Rain%20Water/README.md)- [Solution](./2.Two%20Pointer/42.%20Trapping%20Rain%20Water/42.%20Trapping%20Rain%20Water.go)

## Sliding Window

1. [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) (easy) -[Problem](./)- [Solution](./3.Sliding%20Window/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.go)

2. [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) (medium) -[Problem](./) - [Solution](./3.Sliding%20Window/3.%20Longest%20Substring%20Without%20Repeating%20Characters.go)

3. [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/) (medium) -[Problem](./) - [Solution](./3.Sliding%20Window/424.%20Longest%20Repeating%20Character%20Replacement.go)

4. [Permutation in String ](https://leetcode.com/problems/permutation-in-string/) (medium) -[Problem](./)- [Solution](./3.Sliding%20Window/567.%20Permutation%20in%20String.go)

5. [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) (hard) -[Problem](./)- [Solution](./3.Sliding%20Window/76.%20Minimum%20Window%20Substring.go)

6. [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) (hard) -[Problem](./)- [Solution](./)

## Stack

1. [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) (easy) -[Problem](./)- [Solution](./4.Stack/20.%20Valid%20Parentheses.go)

2. [Min Stack ](https://leetcode.com/problems/min-stack/) (medium) -[Problem](./) - [Solution](./4.Stack/155.%20Min%20Stack.go)

3. [Evaluate Reverse Polish Notation ](https://leetcode.com/problems/evaluate-reverse-polish-notation/) (medium) -[Problem](./) - [Solution](./4.Stack/150.%20Evaluate%20Reverse%20Polish%20Notation.go)

4. [Generate Parentheses ](https://leetcode.com/problems/generate-parentheses/) (medium) -[Problem](./) - [Solution](./4.Stack/22.%20Generate%20Parentheses.go)

5. [Daily Temperatures ](https://leetcode.com/problems/daily-temperatures/) (medium) -[Problem](./)- [Solution](./4.Stack/739.%20Daily%20Temperatures.go)

6. [Car Fleet](https://leetcode.com/problems/car-fleet/) (medium) - [Solution](./4.Stack/853.%20Car%20Fleet.go)

7. [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/) (hard) -[Problem](./)- [Solution](./4.Stack/84.%20Largest%20Rectangle%20in%20Histogram.go)

## Binary Search

1. [Binary Search](https://leetcode.com/problems/binary-search/) (easy) -[Problem](./)- [Solution](./5.Binary%20Search/704.%20Binary%20Search.go)

2. [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/) (medium) --[Problem](./) [Solution](./5.Binary%20Search/74.%20Search%20a%202D%20Matrix.go)

3. [Koko Eating Bananas ](https://leetcode.com/problems/koko-eating-bananas/) (medium) -[Problem](./)- [Solution](./5.Binary%20Search/875.%20Koko%20Eating%20Bananas.go)

4. [Search in Rotated Sorted Array ](https://leetcode.com/problems/search-in-rotated-sorted-array/) (medium) -[Problem](./)- [Solution](./5.Binary%20Search/33.%20Search%20in%20Rotated%20Sorted%20Array.go)

5. [Find Minimum in Rotated Sorted Array ](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) (medium) -[Problem](./)- [Solution](./5.Binary%20Search/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array.go)

6. [Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store/) (medium) -[Problem](./)- [Solution](./5.Binary%20Search/981.%20Time%20Based%20Key-Value%20Store.go)

7. [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) (hard) -[Problem](./)- [Solution](./5.Binary%20Search/4.%20Median%20of%20Two%20Sorted%20Arrays.go)

## Linked List

1. [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) (easy) -[Problem](./)- [Solution](./6.linked%20list/206.%20Reverse%20Linked%20List.go)

2. [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) (easy) -[Problem](./)- [Solution](./6.linked%20list/21.%20Merge%20Two%20Sorted%20Lists.go)

3. [Reorder List](https://leetcode.com/problems/reorder-list/) (medium) -[Problem](./)- [Solution](./6.linked%20list/143.%20Reorder%20List.go)

4. [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) (medium) -[Problem](./)- [Solution](./6.linked%20list/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.go)

5. [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/) (medium) -[Problem](./)- [Solution](./6.linked%20list/138.%20Copy%20List%20with%20Random%20Pointer.go)

6. [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) (medium) -[Problem](./)- [Solution](./6.linked%20list/2.%20Add%20Two%20Numbers.go)

7. [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) (easy) -[Problem](./)- [Solution](./6.linked%20list/141.%20Linked%20List%20Cycle.go)

8. [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) (medium) -[Problem](./)- [Solution](./6.linked%20list/287.%20Find%20the%20Duplicate%20Number.go)

9. [LRU Cache](https://leetcode.com/problems/lru-cache/) (medium) -[Problem](./)- [Solution](./6.linked%20list/146.%20LRU%20Cache.go)

10. [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) (hard) -[Problem](./)- [Solution](./6.linked%20list/23.%20Merge%20k%20Sorted%20Lists.go)

11. [Reverse Nodes in k-Group]( ) (hard) -[Problem](./)- [Solution](./6.linked%20list/25.%20Reverse%20Nodes%20in%20k-Group.go)

12.

## Trees

1. [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) (easy) - [Solution](./7.Trees/226.%20Invert%20Binary%20Tree.go)

2. [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) (easy) - [Solution](./7.Trees/104.%20Maximum%20Depth%20of%20Binary%20Tree.go)

3. [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) (easy) - [Solution](./7.Trees/543.%20Diameter%20of%20Binary%20Tree.go)

4. [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) (easy) - [Solution](./7.Trees/110.%20Balanced%20Binary%20Tree.go)

5. [Same Tree](https://leetcode.com/problems/same-tree/) (easy) - [Solution](./7.Trees/100.%20Same%20Tree.go)

6. [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/) (easy) - [Solution](./7.Trees/572.%20Subtree%20of%20Another%20Tree.go)

7. [Lowest Common Ancestor of a Binary Search Tree ](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) (medium) - [Solution](./7.Trees/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.go)

8. [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) (medium) - [Solution](./7.Trees/102.%20Binary%20Tree%20Level%20Order%20Traversal.go)

9. [Binary Tree Right Side View ](https://leetcode.com/problems/binary-tree-right-side-view/) (medium) - [Solution](./7.Trees/199.%20Binary%20Tree%20Right%20Side%20View.go)

10. [Count Good Nodes in Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/) (medium) - [Solution](./7.Trees/1448.%20Count%20Good%20Nodes%20in%20Binary%20Tree.go)

11. [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) (medium) - [Solution](./7.Trees/98.%20Validate%20Binary%20Search%20Tree.go)

12. [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) (medium) - [Solution](./7.Trees/230.%20Kth%20Smallest%20Element%20in%20a%20BST.go)

13. [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) (medium) - [Solution](./7.Trees/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.go)

14. [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) (hard) - [Solution](./7.Trees/124.%20Binary%20Tree%20Maximum%20Path%20Sum.go)

15. [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) (hard) - [Solution](./7.Trees/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.go)

## Tries

1. [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/) (medium) - [Solution](./8.Tries/208.%20Implement%20Trie%20(Prefix%20Tree).go)

2. [Design Add and Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/) (medium) - [Solution](./8.Tries/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure.go)

3. [Word Search II](https://leetcode.com/problems/word-search-ii/) (hard) - [Solution](./8.Tries/212.%20Word%20Search%20II.go)

## Heap

1. [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/) (easy) - [Solution](./9.Heap/703.%20Kth%20Largest%20Element%20in%20a%20Stream.go)

2. [Last Stone Weight](https://leetcode.com/problems/last-stone-weight/) (easy) - [Solution](./9.Heap/1046.%20Last%20Stone%20Weight.go)

3. [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/) (medium) - [Solution](./9.Heap%5CPriority%20Queue/973.%20K%20Closest%20Points%20to%20Origin.go)

4. [Kth Largest Element in an Array ](https://leetcode.com/problems/kth-largest-element-in-an-array/) (medium) - [Solution](./9.Heap%5CPriority%20Queue/215.%20Kth%20Largest%20Element%20in%20an%20Array.go)

5. [Task Scheduler](https://leetcode.com/problems/task-scheduler/) (medium) - [Solution](./9.Heap%5CPriority%20Queue/621.%20Task%20Scheduler.go)

6. [Design Twitter ](https://leetcode.com/problems/design-twitter/) (medium) - [Solution](./9.Heap%5CPriority%20Queue/355.%20Design%20Twitter.go)

7. [Find Median from Data Stream ](https://leetcode.com/problems/find-median-from-data-stream/) (hard) - [Solution](./9.Heap%5CPriority%20Queue/295.%20Find%20Median%20from%20Data%20Stream.go)

## Backtracking

1. [Subsets](https://leetcode.com/problems/subsets/) (medium) - [Solution](./10.%20Backtracking/78.%20Subsets.go)

2. [Combination Sum](https://leetcode.com/problems/combination-sum/) (medium) - [Solution](./10.%20Backtracking/39.%20Combination%20Sum.go)

3. [Permutations](https://leetcode.com/problems/permutations/) (medium) - [Solution](./10.%20Backtracking/46.%20Permutations.go)

4. [Subsets II](https://leetcode.com/problems/subsets-ii/) (medium) - [Solution](./10.%20Backtracking/90.%20Subsets%20II.go)

5. [Combination Sum II](https://leetcode.com/problems/combination-sum-ii/) (medium) - [Solution](./10.%20Backtracking/40.%20Combination%20Sum%20II.go)

6. [Word Search](https://leetcode.com/problems/word-search/) (medium) - [Solution](./10.%20Backtracking/79.%20Word%20Search.go)

7. [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/) (medium) - [Solution](./10.%20Backtracking/131.%20Palindrome%20Partitioning.go)

8. [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) (medium) - [Solution](./10.%20Backtracking/17.%20Letter%20Combinations%20of%20a%20Phone%20Number.go)

9. [N-Queens](https://leetcode.com/problems/n-queens/) (hard) - [Solution](./10.%20Backtracking/51.%20N-Queens.go)

## Graph

1. [Number of Islands](https://leetcode.com/problems/number-of-islands/) (medium) - [Solution](./11.Graph/200.%20Number%20of%20Islands.go)

2. [Clone Graph](https://leetcode.com/problems/clone-graph/) (medium) - [Solution](./11.%20Graph/133.%20Clone%20Graph.go)

3. [Max Area of Island](https://leetcode.com/problems/max-area-of-island/) (medium) - [Solution](./11.Graph/695.%20Max%20Area%20of%20Island.go)

4. [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/) (medium) - [Solution](./11.Graph/417.%20Pacific%20Atlantic%20Water%20Flow.go)

5. [Surrounded Regions](https://leetcode.com/problems/surrounded-regions/) (medium) - [Solution](./11.Graph/130.%20Surrounded%20Regions.go)

6. [Rotting Oranges](https://leetcode.com/problems/rotting-oranges/) (medium) - [Solution](./11.Graph/994.%20Rotting%20Oranges.go)

7. [Walls and Gates](https://leetcode.com/problems/walls-and-gates/) (medium) - [Solution](./11.Graph/286.%20Walls%20and%20Gates.go)

8. [Course Schedule](https://leetcode.com/problems/course-schedule/) (medium) - [Solution](./11.Graph/207.%20Course%20Schedule.go)

9. [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) (medium) - [Solution](./11.Graph/210.%20Course%20Schedule%20II.go)

10. [Redundant Connection](https://leetcode.com/problems/redundant-connection/) (medium) - [Solution](./11.Graph/684.%20Redundant%20Connection.go)

11. [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/) (medium) - [Solution](./11.Graph/323.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.go)

12. [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/) (medium) - [Solution](./11.Graph/261.%20Graph%20Valid%20Tree.go)

13. [Word Ladder](https://leetcode.com/problems/word-ladder/) (hard) - [Solution](./11.Graph/127.%20Word%20Ladder.go)

## Advanced Graph

1. [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/) (hard) - [Solution](./12.Advance%20Graph/332.%20Reconstruct%20Itinerary.go)

2. [Min Cost to Connect All Points](https://leetcode.com/problems/min-cost-to-connect-all-points/) (medium) - [Solution](./12.Advance%20Graph/1584.%20Min%20Cost%20to%20Connect%20All%20Points.go)

3. [Network Delay Time](https://leetcode.com/problems/network-delay-time/) (medium) - [Solution](./12.Advance%20Graph/743.%20Network%20Delay%20Time.go)

4. [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water/) (hard) - [Solution](./12.Advance%20Graph/778.%20Swim%20in%20Rising%20Water.go)

5. [Alien Dictionary](https://leetcode.com/problems/alien-dictionary/) (hard) - [Solution](./12.Advance%20Graph/269.%20Alien%20Dictionary.go)

6. [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops/) (medium) - [Solution](./12.Advance%20Graph/787.%20Cheapest%20Flights%20Within%20K%20Stops.go)

## 1-D Dynamic Programming

1. [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops/) (medium) - [Solution](./13.1-D%20Dynamic%20Programming/787.%20Cheapest%20Flights%20Within%20K%20Stops.go)

2. [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/) (easy) - [Solution](./13.1-D%20Dynamic%20Programming/746.%20Min%20Cost%20Climbing%20Stairs.go)

3. [House Robber](https://leetcode.com/problems/house-robber/) (medium) - [Solution](./13.1-D%20Dynamic%20Programming/198.%20House%20Robber.go)

4. [House Robber II](https://leetcode.com/problems/house-robber-ii/) (medium) - [Solution](./13.1-D%20Dynamic%20Programming/213.%20House%20Robber%20II.go)

5. [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) (medium) - [Solution](./13.1-D%20Dynamic%20Programming/5.%20Longest%20Palindromic%20Substring.go)

6. [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/) (medium) - [Solution](./13.1-D%20Dynamic%20Programming/647.%20Palindromic%20Substrings.go)

7. [Decode Ways](https://leetcode.com/problems/decode-ways/) (medium) - [Solution](./13.1-D%20Dynamic%20Programming/91.%20Decode%20Ways.go)

8. [Coin Change](https://leetcode.com/problems/coin-change/) (medium) - [Solution](./13.1-D%20Dynamic%20Programming/322.%20Coin%20Change.go)

9. [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) (medium) - [Solution](./13.1-D%20Dynamic%20Programming/152.%20Maximum%20Product%20Subarray.go)

10. [Word Break](https://leetcode.com/problems/word-break/) (medium) - [Solution](./13.1-D%20Dynamic%20Programming/139.%20Word%20Break.go)

11. [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) (medium) - [Solution](./13.1-D%20Dynamic%20Programming/300.%20Longest%20Increasing%20Subsequence.go)

12. [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/) (medium) - [Solution](./13.1-D%20Dynamic%20Programming/416.%20Partition%20Equal%20Subset%20Sum.go)

## 2-D Dynamic Programming

1. [Unique Paths](https://leetcode.com/problems/unique-paths/) (medium) - [Solution](./14.2-D%20Dynamic%20Programming/62.%20Unique%20Paths.go)

2. [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) (medium) - [Solution](./14.2-D%20Dynamic%20Programming/1143.%20Longest%20Common%20Subsequence.go)

3. [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/) (medium) - [Solution](./14.2-D%20Dynamic%20Programming/309.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown.go)

4. [Coin Change II](https://leetcode.com/problems/coin-change-ii/) (medium) - [Solution](./14.2-D%20Dynamic%20Programming/518.%20Coin%20Change%20II.go)

5. [Target Sum](https://leetcode.com/problems/target-sum/) (medium) - [Solution](./14.2-D%20Dynamic%20Programming/494.%20Target%20Sum.go)

6. [Interleaving String](https://leetcode.com/problems/interleaving-string/) (medium) - [Solution](./14.2-D%20Dynamic%20Programming/97.%20Interleaving%20String.go)

7. [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/) (hard) - [Solution](./14.2-D%20Dynamic%20Programming/329.%20Longest%20Increasing%20Path%20in%20a%20Matrix.go)

8. [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/) (hard) - [Solution](./14.2-D%20Dynamic%20Programming/115.%20Distinct%20Subsequences.go)

9. [Edit Distance](https://leetcode.com/problems/edit-distance/) (hard) - [Solution](./14.2-D%20Dynamic%20Programming/72.%20Edit%20Distance.go)

10. [Burst Balloons](https://leetcode.com/problems/burst-balloons/) (hard) - [Solution](./14.2-D%20Dynamic%20Programming/312.%20Burst%20Balloons.go)

11. [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/) (hard) - [Solution](./14.2-D%20Dynamic%20Programming/10.%20Regular%20Expression%20Matching.go)

## Greedy

1. [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) (medium) - [Solution](./15.Greedy/53.%20Maximum%20Subarray.go)

2. [Jump Game](https://leetcode.com/problems/jump-game/) (medium) - [Solution](./15.Greedy/55.%20Jump%20Game.go)

3. [Jump Game II](https://leetcode.com/problems/jump-game-ii/) (medium) - [Solution](./15.Greedy/45.%20Jump%20Game%20II.go)

4. [Gas Station](https://leetcode.com/problems/gas-station/) (medium) - [Solution](./15.Greedy/134.%20Gas%20Station.go)

5. [Hand of Straights](https://leetcode.com/problems/hand-of-straights/) (medium) - [Solution](./15.Greedy/846.%20Hand%20of%20Straights.go)

6. [Merge Triplets to Form Target Triplet](https://leetcode.com/problems/merge-triplets-to-form-target-triplet/) (medium) - [Solution](./15.Greedy/1899.%20Merge%20Triplets%20to%20Form%20Target%20Triplet.go)

7. [Partition Labels](https://leetcode.com/problems/partition-labels/) (medium) - [Solution](./15.Greedy/763.%20Partition%20Labels.go)

8. [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string/) (medium) - [Solution](./15.Greedy/678.%20Valid%20Parenthesis%20String.go)

## Interval

1. [Insert Interval](https://leetcode.com/problems/insert-interval/) (medium) - [Solution](./17.Interval/57.%20Insert%20Interval.go)

2. [Merge Intervals](https://leetcode.com/problems/merge-intervals/) (medium) - [Solution](./17.Interval/56.%20Merge%20Intervals.go)

3. [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/) (medium) - [Solution](./16.interval/435.%20Non-overlapping%20Intervals.go)

4. [Meeting Rooms](https://leetcode.com/problems/meeting-rooms/) (easy) - [Solution](./16.interval/252.%20Meeting%20Rooms.go)

5. [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/) (medium) - [Solution](./16.interval/252.%20Meeting%20Rooms%20II.go)

6. [Minimum Interval to Include Each Query](https://leetcode.com/problems/minimum-interval-to-include-each-query/) (hard) - [Solution](./16.interval/1851.%20Minimum%20Interval%20to%20Include%20Each%20Query.go)

## Math & Geometry

1. [Rotate Image](https://leetcode.com/problems/rotate-image/) (medium) - [Solution](./18.Math%26Geometry/48.%20Rotate%20Image.go)

2. [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) (medium) - [Solution](./18.Math%26Geometry/54.%20Spiral%20Matrix.go)

3. [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) (medium) - [Solution](./18.Math%26Geometry/73.%20Set%20Matrix%20Zeroes.go)

4. [Happy Number](https://leetcode.com/problems/happy-number/) (easy) - [Solution](./18.Math%26Geometry/202.%20Happy%20Number.go)

5. [Plus One](https://leetcode.com/problems/plus-one/) (easy) - [Solution](./18.Math%26Geometry/66.%20Plus%20One.go)

6. [Pow(x, n)](https://leetcode.com/problems/powx-n/) (medium) - [Solution](./18.Math%26Geometry/66.%20Plus%20One.go)

7. [Multiply Strings](https://leetcode.com/problems/multiply-strings/) (medium) - [Solution](./18.Math%26Geometry/43.%20Multiply%20Strings.go)

8. [Detect Squares](https://leetcode.com/problems/detect-squares/) (medium) - [Solution](./18.Math%26Geometry/1811.%20Detect%20Squares.go)

## Bit Manipulation

1. [Single Number](https://leetcode.com/problems/single-number/) (easy) - [Solution](./18.Bit%20Manipulation/136.%20Single%20Number.go)

2. [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) (easy) - [Solution](./18.Bit%20Manipulation/191.%20Number%20of%201%20Bits.go)

3. [Counting Bits](https://leetcode.com/problems/counting-bits/) (easy) - [Solution](./18.Bit%20Manipulation/338.%20Counting%20Bits.go)

4. [Reverse Bits](https://leetcode.com/problems/reverse-bits/) (easy) - [Solution](./18.Bit%20Manipulation/)

5. [Missing Number](https://leetcode.com/problems/missing-number/) (easy) - [Solution](./18.Bit%20Manipulation/268.%20Missing%20Number.go)

6. [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/) (medium) - [Solution](./18.Bit%20Manipulation/371.%20Sum%20of%20Two%20Integers.go)

7. [Reverse Integer](https://leetcode.com/problems/reverse-integer/) (medium) - [Solution](./18.Bit%20Manipulation/7.%20Reverse%20Integer.go)