{"id":25898301,"url":"https://github.com/iamabirakash/leetcode","last_synced_at":"2026-06-29T05:31:17.330Z","repository":{"id":247184650,"uuid":"825218621","full_name":"iamabirakash/Leetcode","owner":"iamabirakash","description":"A repository containing best solutions of daily LeetCode problems","archived":false,"fork":false,"pushed_at":"2026-06-23T09:25:16.000Z","size":978,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2026-06-23T12:11:29.757Z","etag":null,"topics":["daily-coding-problem","leetcode","leetcode-java","leetcode-python","leetcode-solutions"],"latest_commit_sha":null,"homepage":"https://leetcodehub.netlify.app/","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/iamabirakash.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2024-07-07T06:38:09.000Z","updated_at":"2026-06-23T09:25:19.000Z","dependencies_parsed_at":"2024-07-29T19:20:29.927Z","dependency_job_id":"f2c0ec15-0496-449b-9a45-06d43b58de6b","html_url":"https://github.com/iamabirakash/Leetcode","commit_stats":null,"previous_names":["iamabirakash/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/iamabirakash/Leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/iamabirakash%2FLeetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/iamabirakash%2FLeetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/iamabirakash%2FLeetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/iamabirakash%2FLeetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/iamabirakash","download_url":"https://codeload.github.com/iamabirakash/Leetcode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/iamabirakash%2FLeetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34915001,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-29T02:00:05.398Z","response_time":58,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["daily-coding-problem","leetcode","leetcode-java","leetcode-python","leetcode-solutions"],"created_at":"2025-03-03T00:17:59.748Z","updated_at":"2026-06-29T05:31:17.324Z","avatar_url":"https://github.com/iamabirakash.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Leetcode\n\n[iamabirakash](https://leetcode.com/u/iamabirakash/)\n\nA topic-wise index of the solution folders in this repository. Some problems appear in multiple sections when they naturally fit more than one pattern.\n\n## Topics\n\n- [Dynamic Programming](#dynamic-programming) (34)\n- [Graphs](#graphs) (8)\n- [Trees](#trees) (32)\n- [Matrix \u0026 Grid](#matrix-grid) (22)\n- [Strings](#strings) (43)\n- [Arrays](#arrays) (76)\n- [Linked List](#linked-list) (15)\n- [Stack](#stack) (13)\n- [Queue](#queue) (2)\n- [Heap / Priority Queue](#heap-priority-queue) (4)\n- [Sliding Window](#sliding-window) (22)\n- [Two Pointers](#two-pointers) (12)\n- [Binary Search](#binary-search) (9)\n- [Backtracking](#backtracking) (19)\n- [Greedy](#greedy) (16)\n- [Sorting](#sorting) (19)\n- [Hash Table](#hash-table) (16)\n- [Prefix Sum](#prefix-sum) (17)\n- [Bit Manipulation](#bit-manipulation) (11)\n- [Math](#math) (33)\n- [Simulation](#simulation) (19)\n- [Database / SQL](#database-sql) (1)\n\n## Dynamic Programming\n\n1. [2 Keys Keyboard](2%20Keys%20Keyboard)\n2. [Climbing Stairs](Climbing%20Stairs)\n3. [climbing-stairs](climbing-stairs)\n4. [Coin Change](Coin%20Change)\n5. [divisor-game](divisor-game)\n6. [DYNAMIC PROGRAMMING / Fibonacci Number](DYNAMIC%20PROGRAMMING/Fibonacci%20Number)\n7. [DYNAMIC PROGRAMMING / Friends Pairing Problem](DYNAMIC%20PROGRAMMING/Friends%20Pairing%20Problem)\n8. [DYNAMIC PROGRAMMING / House Robbers](DYNAMIC%20PROGRAMMING/House%20Robbers)\n9. [DYNAMIC PROGRAMMING / Min Cost Climbing Stairs](DYNAMIC%20PROGRAMMING/Min%20Cost%20Climbing%20Stairs)\n10. [DYNAMIC PROGRAMMING / N-th Tribonacci Number](DYNAMIC%20PROGRAMMING/N-th%20Tribonacci%20Number)\n11. [Fibonacci Number](Fibonacci%20Number)\n12. [fibonacci-number](fibonacci-number)\n13. [Filling Bookcase Shelves](Filling%20Bookcase%20Shelves)\n14. [Find the Maximum Number of Fruits Collected](Find%20the%20Maximum%20Number%20of%20Fruits%20Collected)\n15. [House Robber](House%20Robber)\n16. [House Robber II](House%20Robber%20II)\n17. [house-robber](house-robber)\n18. [house-robber-iii](house-robber-iii)\n19. [Longest Common Subsequence](Longest%20Common%20Subsequence)\n20. [Longest Increasing Subsequence](Longest%20Increasing%20Subsequence)\n21. [Minimum Falling Path Sum](Minimum%20Falling%20Path%20Sum)\n22. [Minimum Path Sum](Minimum%20Path%20Sum)\n23. [minimum-distance-to-type-a-word-using-two-fingers](minimum-distance-to-type-a-word-using-two-fingers)\n24. [number-of-zigzag-arrays-i](number-of-zigzag-arrays-i)\n25. [number-of-zigzag-arrays-ii](number-of-zigzag-arrays-ii)\n26. [Partition Equal Subset Sum](Partition%20Equal%20Subset%20Sum)\n27. [Pascal's Triangle](Pascal%27s%20Triangle)\n28. [pascals-triangle-ii](pascals-triangle-ii)\n29. [rotate-function](rotate-function)\n30. [Soup Servings](Soup%20Servings)\n31. [Triangle](Triangle)\n32. [Unique Paths](Unique%20Paths)\n33. [Unique Paths II](Unique%20Paths%20II)\n34. [Ways to Express an Integer as Sum of Powers](Ways%20to%20Express%20an%20Integer%20as%20Sum%20of%20Powers)\n\n## Graphs\n\n1. [check-if-there-is-a-valid-path-in-a-grid](check-if-there-is-a-valid-path-in-a-grid)\n2. [Course Schedule](Course%20Schedule)\n3. [Course Schedule II](Course%20Schedule%20II)\n4. [Find the City With the Smallest Number of Neighbors at a Threshold Distance](Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance)\n5. [keys-and-rooms](keys-and-rooms)\n6. [minimize-hamming-distance-after-swap-operations](minimize-hamming-distance-after-swap-operations)\n7. [number-of-provinces](number-of-provinces)\n8. [Regions Cut By Slashes](Regions%20Cut%20By%20Slashes)\n\n## Trees\n\n1. [Binary Tree Inorder Traversal](Binary%20Tree%20Inorder%20Traversal)\n2. [Binary Tree Node to Another](Binary%20Tree%20Node%20to%20Another)\n3. [binary-tree-paths](binary-tree-paths)\n4. [binary-tree-postorder-traversal](binary-tree-postorder-traversal)\n5. [binary-tree-preorder-traversal](binary-tree-preorder-traversal)\n6. [binary-tree-right-side-view](binary-tree-right-side-view)\n7. [convert-sorted-array-to-binary-search-tree](convert-sorted-array-to-binary-search-tree)\n8. [Count Complete Tree Nodes](Count%20Complete%20Tree%20Nodes)\n9. [count-good-nodes-in-binary-tree](count-good-nodes-in-binary-tree)\n10. [Create Binary Tree](Create%20Binary%20Tree)\n11. [Delete Nodes And Return Forest](Delete%20Nodes%20And%20Return%20Forest)\n12. [diameter-of-binary-tree](diameter-of-binary-tree)\n13. [find-mode-in-binary-search-tree](find-mode-in-binary-search-tree)\n14. [Implement Trie (Prefix Tree)](Implement%20Trie%20%28Prefix%20Tree%29)\n15. [leaf-similar-trees](leaf-similar-trees)\n16. [Longest Substring Without Repeating Characters](Longest%20Substring%20Without%20Repeating%20Characters)\n17. [longest-substring-without-repeating-characters](longest-substring-without-repeating-characters)\n18. [maximum-depth-of-binary-tree](maximum-depth-of-binary-tree)\n19. [maximum-level-sum-of-a-binary-tree](maximum-level-sum-of-a-binary-tree)\n20. [maximum-number-of-vowels-in-a-substring-of-given-length](maximum-number-of-vowels-in-a-substring-of-given-length)\n21. [Minimum String Length After Removing Substrings](Minimum%20String%20Length%20After%20Removing%20Substrings)\n22. [minimum-absolute-difference-in-bst](minimum-absolute-difference-in-bst)\n23. [minimum-depth-of-binary-tree](minimum-depth-of-binary-tree)\n24. [Number of Good Leaf Nodes Pairs](Number%20of%20Good%20Leaf%20Nodes%20Pairs)\n25. [number-of-substrings-containing-all-three-characters](number-of-substrings-containing-all-three-characters)\n26. [path-sum](path-sum)\n27. [path-sum-ii](path-sum-ii)\n28. [Reversed Substring Paranthesis](Reversed%20Substring%20Paranthesis)\n29. [same-tree](same-tree)\n30. [Search in a Binary Search Tree](Search%20in%20a%20Binary%20Search%20Tree)\n31. [sum-of-left-leaves](sum-of-left-leaves)\n32. [symmetric-tree](symmetric-tree)\n\n## Matrix \u0026 Grid\n\n1. [Build a Matrix With Conditions](Build%20a%20Matrix%20With%20Conditions)\n2. [check-if-there-is-a-valid-path-in-a-grid](check-if-there-is-a-valid-path-in-a-grid)\n3. [Find Valid Matrix Given Row and Column Sums](Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums)\n4. [island-perimeter](island-perimeter)\n5. [Length of Longest V-Shaped Diagonal Segment](Length%20of%20Longest%20V-Shaped%20Diagonal%20Segment)\n6. [Lucky Numbers in a Matrix](Lucky%20Numbers%20in%20a%20Matrix)\n7. [Magic Squares In Grid](Magic%20Squares%20In%20Grid)\n8. [Maximum Area of Longest Diagonal Rectangle](Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle)\n9. [Minimum Falling Path Sum](Minimum%20Falling%20Path%20Sum)\n10. [Minimum Number of Days to Disconnect Island](Minimum%20Number%20of%20Days%20to%20Disconnect%20Island)\n11. [Minimum Path Sum](Minimum%20Path%20Sum)\n12. [minimum-operations-to-make-a-uni-value-grid](minimum-operations-to-make-a-uni-value-grid)\n13. [number-of-islands](number-of-islands)\n14. [Regions Cut By Slashes](Regions%20Cut%20By%20Slashes)\n15. [Rotate Image](Rotate%20Image)\n16. [rotting-oranges](rotting-oranges)\n17. [Sort Matrix by Diagonals](Sort%20Matrix%20by%20Diagonals)\n18. [Spiral Matrix III](Spiral%20Matrix%20III)\n19. [Unique Paths](Unique%20Paths)\n20. [Unique Paths II](Unique%20Paths%20II)\n21. [Valid Sudoku](Valid%20Sudoku)\n22. [word-search](word-search)\n\n## Strings\n\n1. [1935. Maximum Number of Words You Can Type](1935.%20Maximum%20Number%20of%20Words%20You%20Can%20Type)\n2. [Add Binary](Add%20Binary)\n3. [Break a Palindrome](Break%20a%20Palindrome)\n4. [Clear Digits](Clear%20Digits)\n5. [Decode String](Decode%20String)\n6. [GCD Strings](GCD_Strings)\n7. [Implement Trie (Prefix Tree)](Implement%20Trie%20%28Prefix%20Tree%29)\n8. [Integer to English Words](Integer%20to%20English%20Words)\n9. [Integer to Roman](Integer%20to%20Roman)\n10. [is-subsequence](is-subsequence)\n11. [Isomorphic Strings](Isomorphic%20Strings)\n12. [Largest 3-Same-Digit Number in String](Largest%203-Same-Digit%20Number%20in%20String)\n13. [Letter Combinations of a Phone Number](Letter%20Combinations%20of%20a%20Phone%20Number)\n14. [letter-combinations-of-a-phone-number](letter-combinations-of-a-phone-number)\n15. [Longest Substring Without Repeating Characters](Longest%20Substring%20Without%20Repeating%20Characters)\n16. [longest-substring-without-repeating-characters](longest-substring-without-repeating-characters)\n17. [Make The String Great](Make%20The%20String%20Great)\n18. [Maximum Score](Maximum%20Score)\n19. [maximum-number-of-balloons](maximum-number-of-balloons)\n20. [maximum-number-of-vowels-in-a-substring-of-given-length](maximum-number-of-vowels-in-a-substring-of-given-length)\n21. [Minimum Deletions to Make String Balanced](Minimum%20Deletions%20to%20Make%20String%20Balanced)\n22. [Minimum String Length After Removing Substrings](Minimum%20String%20Length%20After%20Removing%20Substrings)\n23. [minimum-distance-to-type-a-word-using-two-fingers](minimum-distance-to-type-a-word-using-two-fingers)\n24. [Multiply Strings](Multiply%20Strings)\n25. [Number Of Atoms](Number%20Of%20Atoms)\n26. [Number of Senior Citizens](Number%20of%20Senior%20Citizens)\n27. [number-of-substrings-containing-all-three-characters](number-of-substrings-containing-all-three-characters)\n28. [Palindrome Partitioning](Palindrome%20Partitioning)\n29. [process-string-with-special-operations-i](process-string-with-special-operations-i)\n30. [process-string-with-special-operations-ii](process-string-with-special-operations-ii)\n31. [Reverse Words in a String](Reverse%20Words%20in%20a%20String)\n32. [reverse-vowels-of-a-string](reverse-vowels-of-a-string)\n33. [reverse-words-in-a-string](reverse-words-in-a-string)\n34. [Reversed Substring Paranthesis](Reversed%20Substring%20Paranthesis)\n35. [Sort Vowels in a String](Sort%20Vowels%20in%20a%20String)\n36. [String to Integer (atoi)](String%20to%20Integer%20%28atoi%29)\n37. [subtract-the-product-and-sum-of-digits-of-an-integer](subtract-the-product-and-sum-of-digits-of-an-integer)\n38. [Valid Parentheses](Valid%20Parentheses)\n39. [Valid Parenthesis String](Valid%20Parenthesis%20String)\n40. [weighted-word-mapping](weighted-word-mapping)\n41. [word-search](word-search)\n42. [words-within-two-edits-of-dictionary](words-within-two-edits-of-dictionary)\n43. [zigzag-conversion](zigzag-conversion)\n\n## Arrays\n\n1. [Assign Cookies](Assign%20Cookies)\n2. [Bag of Tokens](Bag%20of%20Tokens)\n3. [binary-subarrays-with-sum](binary-subarrays-with-sum)\n4. [Boats to Save People](Boats%20to%20Save%20People)\n5. [closest-equal-element-queries](closest-equal-element-queries)\n6. [concatenation-of-array](concatenation-of-array)\n7. [convert-sorted-array-to-binary-search-tree](convert-sorted-array-to-binary-search-tree)\n8. [Count Hills and Valleys in an Array](Count%20Hills%20and%20Valleys%20in%20an%20Array)\n9. [Count Number of Maximum Bitwise-OR Subsets](Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets)\n10. [Count Number of Teams](Count%20Number%20of%20Teams)\n11. [count-number-of-nice-subarrays](count-number-of-nice-subarrays)\n12. [count-subarrays-with-majority-element-i](count-subarrays-with-majority-element-i)\n13. [Final Prices With a Special Discount in a Shop](Final%20Prices%20With%20a%20Special%20Discount%20in%20a%20Shop)\n14. [Find the Maximum Number of Fruits Collected](Find%20the%20Maximum%20Number%20of%20Fruits%20Collected)\n15. [Find Valid Matrix Given Row and Column Sums](Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums)\n16. [find-the-highest-altitude](find-the-highest-altitude)\n17. [Fruit Into Baskets](Fruit%20Into%20Baskets)\n18. [fruit-into-baskets](fruit-into-baskets)\n19. [Fruits Into Baskets II](Fruits%20Into%20Baskets%20II)\n20. [increasing-triplet-subsequence](increasing-triplet-subsequence)\n21. [Intersection Two Arrays](Intersection_Two_Arrays)\n22. [is-subsequence](is-subsequence)\n23. [kids-with-the-greatest-number-of-candies](kids-with-the-greatest-number-of-candies)\n24. [Kth Largest Element in a Stream](Kth%20Largest%20Element%20in%20a%20Stream)\n25. [Kth Largest Element in an Array](Kth%20Largest%20Element%20in%20an%20Array)\n26. [kth-largest-element-in-an-array](kth-largest-element-in-an-array)\n27. [Longest Common Subsequence](Longest%20Common%20Subsequence)\n28. [Longest Increasing Subsequence](Longest%20Increasing%20Subsequence)\n29. [longest-subarray-of-1s-after-deleting-one-element](longest-subarray-of-1s-after-deleting-one-element)\n30. [Lucky Numbers in a Matrix](Lucky%20Numbers%20in%20a%20Matrix)\n31. [maximize-the-distance-between-points-on-a-square](maximize-the-distance-between-points-on-a-square)\n32. [Maximum Area of Longest Diagonal Rectangle](Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle)\n33. [Maximum Element After Decreasing and Rearranging](Maximum%20Element%20After%20Decreasing%20and%20Rearranging)\n34. [Maximum Ice Cream Bars](Maximum%20Ice%20Cream%20Bars)\n35. [Maximum Points You Can Obtain from Cards](Maximum%20Points%20You%20Can%20Obtain%20from%20Cards)\n36. [Maximum Subarray](Maximum%20Subarray)\n37. [maximum-average-subarray-i](maximum-average-subarray-i)\n38. [maximum-ice-cream-bars](maximum-ice-cream-bars)\n39. [maximum-subsequence-score](maximum-subsequence-score)\n40. [maximum-sum-of-distinct-subarrays-with-length-k](maximum-sum-of-distinct-subarrays-with-length-k)\n41. [Median Of Two Sorted Arrays](Median%20Of%20Two%20Sorted%20Arrays)\n42. [Merge Intervals](Merge%20Intervals)\n43. [Minimum Difference](Minimum_Difference)\n44. [Minimum Number of Operations to Make Array Empty](Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Empty)\n45. [Minimum Swaps to Group All 1's Together II](Minimum%20Swaps%20to%20Group%20All%201%27s%20Together%20II)\n46. [minimum-distance-between-three-equal-elements-ii](minimum-distance-between-three-equal-elements-ii)\n47. [minimum-size-subarray-sum](minimum-size-subarray-sum)\n48. [move-zeroes](move-zeroes)\n49. [Next Permutation](Next%20Permutation)\n50. [number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold](number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold)\n51. [number-of-zigzag-arrays-i](number-of-zigzag-arrays-i)\n52. [number-of-zigzag-arrays-ii](number-of-zigzag-arrays-ii)\n53. [Partition Equal Subset Sum](Partition%20Equal%20Subset%20Sum)\n54. [Pascal's Triangle](Pascal%27s%20Triangle)\n55. [pascals-triangle-ii](pascals-triangle-ii)\n56. [permutations](permutations)\n57. [permutations-ii](permutations-ii)\n58. [Range Product Queries of Powers](Range%20Product%20Queries%20of%20Powers)\n59. [Rearranging Fruits](Rearranging%20Fruits)\n60. [Remove Element](Remove%20Element)\n61. [Replace Elements with Greatest Element on Right Side](Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side)\n62. [running-sum-of-1d-array](running-sum-of-1d-array)\n63. [shortest-subarray-to-be-removed-to-make-array-sorted](shortest-subarray-to-be-removed-to-make-array-sorted)\n64. [Sort an Array](Sort%20an%20Array)\n65. [Sort Array by Increasing Frequency](Sort%20Array%20by%20Increasing%20Frequency)\n66. [Sort the People](Sort%20the%20People)\n67. [subsets](subsets)\n68. [Subsets II](Subsets%20II)\n69. [subsets-ii](subsets-ii)\n70. [Sum of Subarray Minimums](Sum%20of%20Subarray%20Minimums)\n71. [sum-of-all-subset-xor-totals](sum-of-all-subset-xor-totals)\n72. [sum-of-distances](sum-of-distances)\n73. [total-cost-to-hire-k-workers](total-cost-to-hire-k-workers)\n74. [Two Sum](Two%20Sum)\n75. [Valid Sudoku](Valid%20Sudoku)\n76. [xor-after-range-multiplication-queries-i](xor-after-range-multiplication-queries-i)\n\n## Linked List\n\n1. [Delete Node in a Linked List](Delete%20Node%20in%20a%20Linked%20List)\n2. [Delete the Middle Node of a Linked List](Delete%20the%20Middle%20Node%20of%20a%20Linked%20List)\n3. [delete-the-middle-node-of-a-linked-list](delete-the-middle-node-of-a-linked-list)\n4. [Intersection of Two Linked Lists](Intersection%20of%20Two%20Linked%20Lists)\n5. [Linked List Cycle](Linked%20List%20Cycle)\n6. [maximum-twin-sum-of-a-linked-list](maximum-twin-sum-of-a-linked-list)\n7. [Merge Two Sorted Lists](Merge%20Two%20Sorted%20Lists)\n8. [Merged Notes Between Zeros](Merged_Notes_Between_Zeros)\n9. [Middle of the Linked List](Middle%20of%20the%20Linked%20List)\n10. [Min Max No Nodes](Min_Max_No_Nodes)\n11. [Odd Even Linked List](Odd%20Even%20Linked%20List)\n12. [Remove Nodes From Linked List](Remove%20Nodes%20From%20Linked%20List)\n13. [reorder-list](reorder-list)\n14. [REVERSE LINKED LIST](REVERSE%20LINKED%20LIST)\n15. [Sort List](Sort%20List)\n\n## Stack\n\n1. [Asteroid Collision](Asteroid%20Collision)\n2. [Clear Digits](Clear%20Digits)\n3. [Daily Temperatures](Daily%20Temperatures)\n4. [daily-temperatures](daily-temperatures)\n5. [Decode String](Decode%20String)\n6. [Final Prices With a Special Discount in a Shop](Final%20Prices%20With%20a%20Special%20Discount%20in%20a%20Shop)\n7. [generate-parentheses](generate-parentheses)\n8. [Make The String Great](Make%20The%20String%20Great)\n9. [Minimum String Length After Removing Substrings](Minimum%20String%20Length%20After%20Removing%20Substrings)\n10. [Robot Collisions](Robot%20Collisions)\n11. [Sum of Subarray Minimums](Sum%20of%20Subarray%20Minimums)\n12. [Valid Parentheses](Valid%20Parentheses)\n13. [Valid Parenthesis String](Valid%20Parenthesis%20String)\n\n## Queue\n\n1. [Kth Largest Element in a Stream](Kth%20Largest%20Element%20in%20a%20Stream)\n2. [rotting-oranges](rotting-oranges)\n\n## Heap / Priority Queue\n\n1. [Kth Largest Element in a Stream](Kth%20Largest%20Element%20in%20a%20Stream)\n2. [Kth Largest Element in an Array](Kth%20Largest%20Element%20in%20an%20Array)\n3. [kth-largest-element-in-an-array](kth-largest-element-in-an-array)\n4. [total-cost-to-hire-k-workers](total-cost-to-hire-k-workers)\n\n## Sliding Window\n\n1. [binary-subarrays-with-sum](binary-subarrays-with-sum)\n2. [count-number-of-nice-subarrays](count-number-of-nice-subarrays)\n3. [count-subarrays-with-majority-element-i](count-subarrays-with-majority-element-i)\n4. [Fruit Into Baskets](Fruit%20Into%20Baskets)\n5. [fruit-into-baskets](fruit-into-baskets)\n6. [Longest Repeating Character Replacement](Longest%20Repeating%20Character%20Replacement)\n7. [Longest Substring Without Repeating Characters](Longest%20Substring%20Without%20Repeating%20Characters)\n8. [longest-repeating-character-replacement](longest-repeating-character-replacement)\n9. [longest-subarray-of-1s-after-deleting-one-element](longest-subarray-of-1s-after-deleting-one-element)\n10. [longest-substring-without-repeating-characters](longest-substring-without-repeating-characters)\n11. [Max Consecutive Ones III](Max%20Consecutive%20Ones%20III)\n12. [max-consecutive-ones-iii](max-consecutive-ones-iii)\n13. [Maximum Points You Can Obtain from Cards](Maximum%20Points%20You%20Can%20Obtain%20from%20Cards)\n14. [Maximum Subarray](Maximum%20Subarray)\n15. [maximum-average-subarray-i](maximum-average-subarray-i)\n16. [maximum-number-of-vowels-in-a-substring-of-given-length](maximum-number-of-vowels-in-a-substring-of-given-length)\n17. [maximum-sum-of-distinct-subarrays-with-length-k](maximum-sum-of-distinct-subarrays-with-length-k)\n18. [minimum-size-subarray-sum](minimum-size-subarray-sum)\n19. [number-of-substrings-containing-all-three-characters](number-of-substrings-containing-all-three-characters)\n20. [shortest-subarray-to-be-removed-to-make-array-sorted](shortest-subarray-to-be-removed-to-make-array-sorted)\n21. [Sliding Window Maximum](Sliding%20Window%20Maximum)\n22. [Sum of Subarray Minimums](Sum%20of%20Subarray%20Minimums)\n\n## Two Pointers\n\n1. [Boats to Save People](Boats%20to%20Save%20People)\n2. [is-subsequence](is-subsequence)\n3. [Linked List Cycle](Linked%20List%20Cycle)\n4. [Median Of Two Sorted Arrays](Median%20Of%20Two%20Sorted%20Arrays)\n5. [Merge Intervals](Merge%20Intervals)\n6. [Merge Two Sorted Lists](Merge%20Two%20Sorted%20Lists)\n7. [Middle of the Linked List](Middle%20of%20the%20Linked%20List)\n8. [Minimum Swaps to Group All 1's Together II](Minimum%20Swaps%20to%20Group%20All%201%27s%20Together%20II)\n9. [move-zeroes](move-zeroes)\n10. [reverse-vowels-of-a-string](reverse-vowels-of-a-string)\n11. [Sort Vowels in a String](Sort%20Vowels%20in%20a%20String)\n12. [Two Sum](Two%20Sum)\n\n## Binary Search\n\n1. [binary-search](binary-search)\n2. [convert-sorted-array-to-binary-search-tree](convert-sorted-array-to-binary-search-tree)\n3. [find-mode-in-binary-search-tree](find-mode-in-binary-search-tree)\n4. [Kth Largest Element in an Array](Kth%20Largest%20Element%20in%20an%20Array)\n5. [kth-largest-element-in-an-array](kth-largest-element-in-an-array)\n6. [maximize-the-distance-between-points-on-a-square](maximize-the-distance-between-points-on-a-square)\n7. [Median Of Two Sorted Arrays](Median%20Of%20Two%20Sorted%20Arrays)\n8. [minimum-size-subarray-sum](minimum-size-subarray-sum)\n9. [Search in a Binary Search Tree](Search%20in%20a%20Binary%20Search%20Tree)\n\n## Backtracking\n\n1. [Combination Sum](Combination%20Sum)\n2. [combination-sum](combination-sum)\n3. [combination-sum-ii](combination-sum-ii)\n4. [combination-sum-iii](combination-sum-iii)\n5. [combinations](combinations)\n6. [Count Number of Maximum Bitwise-OR Subsets](Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets)\n7. [generate-parentheses](generate-parentheses)\n8. [Letter Combinations of a Phone Number](Letter%20Combinations%20of%20a%20Phone%20Number)\n9. [letter-combinations-of-a-phone-number](letter-combinations-of-a-phone-number)\n10. [N-Queens](N-Queens)\n11. [n-queens-ii](n-queens-ii)\n12. [Next Permutation](Next%20Permutation)\n13. [Palindrome Partitioning](Palindrome%20Partitioning)\n14. [permutations](permutations)\n15. [permutations-ii](permutations-ii)\n16. [subsets](subsets)\n17. [Subsets II](Subsets%20II)\n18. [subsets-ii](subsets-ii)\n19. [word-search](word-search)\n\n## Greedy\n\n1. [Assign Cookies](Assign%20Cookies)\n2. [Bag of Tokens](Bag%20of%20Tokens)\n3. [Best Time to Buy and Sell Stock](Best%20Time%20to%20Buy%20and%20Sell%20Stock)\n4. [Boats to Save People](Boats%20to%20Save%20People)\n5. [Broken Calculator](Broken%20Calculator)\n6. [can-place-flowers](can-place-flowers)\n7. [jump-game](jump-game)\n8. [Maximum Element After Decreasing and Rearranging](Maximum%20Element%20After%20Decreasing%20and%20Rearranging)\n9. [Maximum Ice Cream Bars](Maximum%20Ice%20Cream%20Bars)\n10. [Maximum Score](Maximum%20Score)\n11. [maximum-ice-cream-bars](maximum-ice-cream-bars)\n12. [maximum-subsequence-score](maximum-subsequence-score)\n13. [Minimum Number of Operations to Make Array Empty](Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Empty)\n14. [Rearranging Fruits](Rearranging%20Fruits)\n15. [Remove Colored Pieces if Both Neighbors are the Same Color](Remove%20Colored%20Pieces%20if%20Both%20Neighbors%20are%20the%20Same%20Color)\n16. [Valid Parenthesis String](Valid%20Parenthesis%20String)\n\n## Sorting\n\n1. [convert-sorted-array-to-binary-search-tree](convert-sorted-array-to-binary-search-tree)\n2. [Kth Largest Element in a Stream](Kth%20Largest%20Element%20in%20a%20Stream)\n3. [Kth Largest Element in an Array](Kth%20Largest%20Element%20in%20an%20Array)\n4. [kth-largest-element-in-an-array](kth-largest-element-in-an-array)\n5. [Maximum Element After Decreasing and Rearranging](Maximum%20Element%20After%20Decreasing%20and%20Rearranging)\n6. [Maximum Ice Cream Bars](Maximum%20Ice%20Cream%20Bars)\n7. [maximum-ice-cream-bars](maximum-ice-cream-bars)\n8. [Median Of Two Sorted Arrays](Median%20Of%20Two%20Sorted%20Arrays)\n9. [Merge Intervals](Merge%20Intervals)\n10. [Merge Two Sorted Lists](Merge%20Two%20Sorted%20Lists)\n11. [Minimum Difference](Minimum_Difference)\n12. [Rearranging Fruits](Rearranging%20Fruits)\n13. [shortest-subarray-to-be-removed-to-make-array-sorted](shortest-subarray-to-be-removed-to-make-array-sorted)\n14. [Sort an Array](Sort%20an%20Array)\n15. [Sort Array by Increasing Frequency](Sort%20Array%20by%20Increasing%20Frequency)\n16. [Sort List](Sort%20List)\n17. [Sort Matrix by Diagonals](Sort%20Matrix%20by%20Diagonals)\n18. [Sort the People](Sort%20the%20People)\n19. [Sort Vowels in a String](Sort%20Vowels%20in%20a%20String)\n\n## Hash Table\n\n1. [closest-equal-element-queries](closest-equal-element-queries)\n2. [count-subarrays-with-majority-element-i](count-subarrays-with-majority-element-i)\n3. [find-mode-in-binary-search-tree](find-mode-in-binary-search-tree)\n4. [Intersection of Two Linked Lists](Intersection%20of%20Two%20Linked%20Lists)\n5. [Intersection Two Arrays](Intersection_Two_Arrays)\n6. [Isomorphic Strings](Isomorphic%20Strings)\n7. [maximum-number-of-balloons](maximum-number-of-balloons)\n8. [minimize-hamming-distance-after-swap-operations](minimize-hamming-distance-after-swap-operations)\n9. [minimum-distance-between-three-equal-elements-ii](minimum-distance-between-three-equal-elements-ii)\n10. [Number Of Atoms](Number%20Of%20Atoms)\n11. [number-of-substrings-containing-all-three-characters](number-of-substrings-containing-all-three-characters)\n12. [repeated-dna-sequences](repeated-dna-sequences)\n13. [Two Sum](Two%20Sum)\n14. [Valid Sudoku](Valid%20Sudoku)\n15. [weighted-word-mapping](weighted-word-mapping)\n16. [words-within-two-edits-of-dictionary](words-within-two-edits-of-dictionary)\n\n## Prefix Sum\n\n1. [binary-subarrays-with-sum](binary-subarrays-with-sum)\n2. [count-number-of-nice-subarrays](count-number-of-nice-subarrays)\n3. [count-subarrays-with-majority-element-i](count-subarrays-with-majority-element-i)\n4. [Find the City With the Smallest Number of Neighbors at a Threshold Distance](Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance)\n5. [find-the-highest-altitude](find-the-highest-altitude)\n6. [longest-subarray-of-1s-after-deleting-one-element](longest-subarray-of-1s-after-deleting-one-element)\n7. [Maximum Points You Can Obtain from Cards](Maximum%20Points%20You%20Can%20Obtain%20from%20Cards)\n8. [Maximum Subarray](Maximum%20Subarray)\n9. [maximum-average-subarray-i](maximum-average-subarray-i)\n10. [maximum-sum-of-distinct-subarrays-with-length-k](maximum-sum-of-distinct-subarrays-with-length-k)\n11. [minimum-size-subarray-sum](minimum-size-subarray-sum)\n12. [number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold](number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold)\n13. [Range Product Queries of Powers](Range%20Product%20Queries%20of%20Powers)\n14. [running-sum-of-1d-array](running-sum-of-1d-array)\n15. [shortest-subarray-to-be-removed-to-make-array-sorted](shortest-subarray-to-be-removed-to-make-array-sorted)\n16. [Sum of Subarray Minimums](Sum%20of%20Subarray%20Minimums)\n17. [xor-after-range-multiplication-queries-i](xor-after-range-multiplication-queries-i)\n\n## Bit Manipulation\n\n1. [Count Number of Maximum Bitwise-OR Subsets](Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets)\n2. [counting-bits](counting-bits)\n3. [Power of Four](Power%20of%20Four)\n4. [Power of Three](Power%20of%20Three)\n5. [Power of Two](Power%20of%20Two)\n6. [Reordered Power of 2](Reordered%20Power%20of%202)\n7. [Single Number](Single%20Number)\n8. [Single Number II](Single%20Number%20II)\n9. [single-number](single-number)\n10. [sum-of-all-subset-xor-totals](sum-of-all-subset-xor-totals)\n11. [xor-after-range-multiplication-queries-i](xor-after-range-multiplication-queries-i)\n\n## Math\n\n1. [Alice and Bob Playing Flower Game](Alice%20and%20Bob%20Playing%20Flower%20Game)\n2. [angle-between-hands-of-a-clock](angle-between-hands-of-a-clock)\n3. [Broken Calculator](Broken%20Calculator)\n4. [Count Number of Maximum Bitwise-OR Subsets](Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets)\n5. [Count Number of Teams](Count%20Number%20of%20Teams)\n6. [count-number-of-nice-subarrays](count-number-of-nice-subarrays)\n7. [DYNAMIC PROGRAMMING / Fibonacci Number](DYNAMIC%20PROGRAMMING/Fibonacci%20Number)\n8. [DYNAMIC PROGRAMMING / N-th Tribonacci Number](DYNAMIC%20PROGRAMMING/N-th%20Tribonacci%20Number)\n9. [Fibonacci Number](Fibonacci%20Number)\n10. [fibonacci-number](fibonacci-number)\n11. [Find Closest Person](Find%20Closest%20Person)\n12. [fizz-buzz](fizz-buzz)\n13. [Integer to English Words](Integer%20to%20English%20Words)\n14. [Integer to Roman](Integer%20to%20Roman)\n15. [Maximum Area of Longest Diagonal Rectangle](Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle)\n16. [Number of Senior Citizens](Number%20of%20Senior%20Citizens)\n17. [Pascal's Triangle](Pascal%27s%20Triangle)\n18. [pascals-triangle-ii](pascals-triangle-ii)\n19. [Pass The Pillow](Pass%20The%20Pillow)\n20. [Power of Four](Power%20of%20Four)\n21. [Power of Three](Power%20of%20Three)\n22. [Power of Two](Power%20of%20Two)\n23. [Range Product Queries of Powers](Range%20Product%20Queries%20of%20Powers)\n24. [Reordered Power of 2](Reordered%20Power%20of%202)\n25. [rotate-function](rotate-function)\n26. [Soup Servings](Soup%20Servings)\n27. [String to Integer (atoi)](String%20to%20Integer%20%28atoi%29)\n28. [subtract-the-product-and-sum-of-digits-of-an-integer](subtract-the-product-and-sum-of-digits-of-an-integer)\n29. [total-waviness-of-numbers-in-range-i](total-waviness-of-numbers-in-range-i)\n30. [Triangle](Triangle)\n31. [Water Bottles](Water_Bottles)\n32. [Ways to Express an Integer as Sum of Powers](Ways%20to%20Express%20an%20Integer%20as%20Sum%20of%20Powers)\n33. [zigzag-conversion](zigzag-conversion)\n\n## Simulation\n\n1. [Alice and Bob Playing Flower Game](Alice%20and%20Bob%20Playing%20Flower%20Game)\n2. [Asteroid Collision](Asteroid%20Collision)\n3. [Average Waiting Time](Average%20Waiting%20Time)\n4. [Circular Game](Circular_Game)\n5. [Crawler Log Folder](Crawler%20Log%20Folder)\n6. [divisor-game](divisor-game)\n7. [earliest-finish-time-for-land-and-water-rides-i](earliest-finish-time-for-land-and-water-rides-i)\n8. [earliest-finish-time-for-land-and-water-rides-ii](earliest-finish-time-for-land-and-water-rides-ii)\n9. [Final Prices With a Special Discount in a Shop](Final%20Prices%20With%20a%20Special%20Discount%20in%20a%20Shop)\n10. [Find Closest Person](Find%20Closest%20Person)\n11. [fizz-buzz](fizz-buzz)\n12. [jump-game](jump-game)\n13. [Pass The Pillow](Pass%20The%20Pillow)\n14. [process-string-with-special-operations-i](process-string-with-special-operations-i)\n15. [process-string-with-special-operations-ii](process-string-with-special-operations-ii)\n16. [Robot Collisions](Robot%20Collisions)\n17. [Rotate Image](Rotate%20Image)\n18. [Spiral Matrix III](Spiral%20Matrix%20III)\n19. [Walking Robot Simulation](Walking%20Robot%20Simulation)\n\n## Database / SQL\n\n1. [Combine Two Tables](Combine_Two_Tables)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fiamabirakash%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fiamabirakash%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fiamabirakash%2Fleetcode/lists"}