{"id":20269458,"url":"https://github.com/thammami01/leetcode-solutions","last_synced_at":"2026-04-29T01:02:52.237Z","repository":{"id":196059693,"uuid":"462617061","full_name":"THammami01/leetcode-solutions","owner":"THammami01","description":"All of LeetCode problems solutions in TypeScript/Java that I participated in, including LeetCode essential \u0026 trending 75 plan.","archived":false,"fork":false,"pushed_at":"2024-03-16T03:24:16.000Z","size":72,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-04T21:35:38.683Z","etag":null,"topics":["java","leetcode-75","leetcode-solutions","typescript"],"latest_commit_sha":null,"homepage":"https://leetcode.com/THammami01/","language":"Java","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/THammami01.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}},"created_at":"2022-02-23T06:55:37.000Z","updated_at":"2024-03-17T15:35:01.000Z","dependencies_parsed_at":"2024-03-22T11:15:15.082Z","dependency_job_id":null,"html_url":"https://github.com/THammami01/leetcode-solutions","commit_stats":null,"previous_names":["thammami01/leetcode-solutions"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/THammami01/leetcode-solutions","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/THammami01%2Fleetcode-solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/THammami01%2Fleetcode-solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/THammami01%2Fleetcode-solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/THammami01%2Fleetcode-solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/THammami01","download_url":"https://codeload.github.com/THammami01/leetcode-solutions/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/THammami01%2Fleetcode-solutions/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32405904,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-28T19:38:08.556Z","status":"ssl_error","status_checked_at":"2026-04-28T19:37:55.688Z","response_time":56,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["java","leetcode-75","leetcode-solutions","typescript"],"created_at":"2024-11-14T12:25:19.357Z","updated_at":"2026-04-29T01:02:52.213Z","avatar_url":"https://github.com/THammami01.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode Solutions\n\n## LeetCode 75\n\n### Summary\n\n| \u003cimg src=\"https://res.cloudinary.com/dgihbgsnz/image/upload/v1702699978/LeetCode_75_3-240x240_u8qyed.png\" alt=\"LeetCode 75\" width=\"175\" /\u003e |\n:-:\n| 75 Essential \u0026 Trending Problems\u003cbr/\u003eMust-do problem list for interview prep\u003cbr/\u003eBest for 1~3 month of prep time |\n\n#### I. Array / String\n\n- [X] [01. Merge Strings Alternately](/LeetCode-75/01-1768.ts)\n- [X] [02. Greatest Common Divisor of Strings](/LeetCode-75/02-1071.ts)\n- [X] [03. Kids With the Greatest Number of Candies](/LeetCode-75/03-1431.ts)\n- [X] [04. Can Place Flowers](/LeetCode-75/04-605.ts)\n- [X] [05. Reverse Vowels of a String](/LeetCode-75/05-345.ts)\n- [X] [06. Reverse Words in a String](/LeetCode-75/06-151.ts)\n- [X] [07. Product of Array Except Self](/LeetCode-75/07-238.ts)\n- [X] [08. Increasing Triplet Subsequence](/LeetCode-75/08-334.ts)\n- [X] [09. String Compression](/LeetCode-75/09-443.ts)\n\n#### II. Two Pointers\n\n- [X] [10. Move Zeroes](/LeetCode-75/10-283.ts)\n- [X] [11. Is Subsequence](/LeetCode-75/11-392.ts)\n- [X] [12. Container With Most Water](/LeetCode-75/12-11.ts)\n- [X] [13. Max Number of K-Sum Pairs](/LeetCode-75/13-1679.ts)\n\n#### III. Sliding Window\n\n- [X] [14. Maximum Average Subarray I](/LeetCode-75/14-643.ts)\n- [X] [15. Maximum Number of Vowels in a Substring of Given Length](/LeetCode-75/15-1456.ts)\n- [X] [16. Max Consecutive Ones III](/LeetCode-75/16-1004.ts)\n- [X] [17. Longest Subarray of 1's After Deleting One Element](/LeetCode-75/17-1493.ts)\n\n#### IV. Prefix Sum\n\n- [X] [18. Find the Highest Altitude](/LeetCode-75/18-1732.ts)\n- [X] [19. Find Pivot Index](/LeetCode-75/19-724.ts)\n\n#### V. Hash Map / Set\n\n- [X] [20. Find the Difference of Two Arrays](/LeetCode-75/20-2215.ts)\n- [X] [21. Unique Number of Occurrences](/LeetCode-75/21-1207.ts)\n- [X] [22. Determine if Two Strings Are Close](/LeetCode-75/22-1657.ts)\n- [X] [23. Equal Row and Column Pairs](/LeetCode-75/23-2352.ts)\n\n#### VI. Stack\n\n- [X] [24. Removing Stars From a String](/LeetCode-75/24-2390.ts)\n- [X] [25. Asteroid Collision](/LeetCode-75/25-731.ts)\n- [X] [26. Decode String](/LeetCode-75/26-394.ts)\n\n#### VII. Queue\n\n- [X] [27. Number of Recent Calls](/LeetCode-75/27-933.ts)\n- [X] [28. Dota2 Senate](/LeetCode-75/28-649.ts)\n\n#### VIII. Linked List\n\n- [X] [29. Delete the Middle Node of a Linked List](/LeetCode-75/29-2095.ts)\n- [X] [30. Odd Even Linked List](/LeetCode-75/30-328.ts)\n- [X] [31. Reverse Linked List](/LeetCode-75/31-206.ts)\n- [X] [32. Maximum Twin Sum of a Linked List](/LeetCode-75/32-2130.ts)\n\n#### IX. Binary Tree - DFS\n\n- [X] [33. Maximum Depth of Binary Tree](/LeetCode-75/33-104.ts)\n- [X] [34. Leaf-Similar Trees](/LeetCode-75/34-872.ts)\n- [X] [35. Count Good Nodes in Binary Tree](/LeetCode-75/35-1448.ts)\n- [X] [36. Path Sum III](/LeetCode-75/36-437.ts)\n- [X] [37. Longest ZigZag Path in a Binary Tree](/LeetCode-75/37-1372.ts)\n- [X] [38. Lowest Common Ancestor of a Binary Tree](/LeetCode-75/38-236.ts)\n\n#### X. Binary Tree - BFS\n\n- [X] [39. Binary Tree Right Side View](/LeetCode-75/39-199.ts)\n- [X] [40. Maximum Level Sum of a Binary Tree](/LeetCode-75/40-1161.ts)\n\n#### XI. Binary Search Tree\n\n- [X] [41. Search in a Binary Search Tree](/LeetCode-75/41-700.ts)\n- [X] [42. Delete Node in a BST](/LeetCode-75/42-450.ts)\n\n#### XII. Graphs - DFS\n\n- [ ] 43. Keys and Rooms\n- [ ] 44. Number of Provinces\n- [ ] 45. Reorder Routes to Make All Paths Lead to the City Zero\n- [ ] 46. Evaluate Division\n\n#### XIII. Graphs - BFS\n\n- [ ] 47. Nearest Exit from Entrance in Maze\n- [ ] 48. Rotting Oranges\n\n#### XIV. Heap / Priority Queue\n\n- [ ] 49. Kth Largest Element in an Array\n- [ ] 50. Smallest Number in Infinite Set\n- [ ] 51. Maximum Subsequence Score\n- [ ] 52. Total Cost to Hire K Workers\n\n#### XV. Binary Search\n\n- [ ] 53. Guess Number Higher or Lower\n- [ ] 54. Successful Pairs of Spells and Potions\n- [ ] 55. Find Peak Element\n- [ ] 56. Koko Eating Bananas\n\n#### XVI. Backtracking\n\n- [ ] 57. Letter Combinations of a Phone Number\n- [ ] 58. Combination Sum III\n\n#### XVII. DP - 1D\n\n- [ ] 59. N-th Tribonacci Number\n- [ ] 60. Min Cost Climbing Stairs\n- [ ] 61. House Robber\n- [ ] 62. Domino and Tromino Tiling\n\n#### XVIII. DP - Multidimensional\n\n- [ ] 63. Unique Paths\n- [ ] 64. Longest Common Subsequence\n- [ ] 65. Best Time to Buy and Sell Stock with Transaction Fee\n- [ ] 66. Edit Distance\n\n#### XIX. Bit Manipulation\n\n- [ ] 67. Counting Bits\n- [ ] 68. Single Number\n- [ ] 69. Minimum Flips to Make a OR b Equal to c\n\n#### XX. Trie\n\n- [ ] 70. Implement Trie (Prefix Tree)\n- [ ] 71. Search Suggestions System\n\n#### XXI. Intervals\n\n- [ ] 72. Non-overlapping Intervals\n- [ ] 73. Minimum Number of Arrows to Burst Balloons\n\n#### XXII. Monotonic Stack\n\n- [ ] 74. Daily Temperatures\n- [ ] 75. Online Stock Span\n\n## LeetCode 150\n\n### Summary\n\n| \u003cimg src=\"https://res.cloudinary.com/dgihbgsnz/image/upload/v1702699959/Top_Interview_150_3-240x240_uexuix.png\" alt=\"LeetCode 150\" width=\"175\" /\u003e |\n:-:\n| 150 Original \u0026 Classic Questions\u003cbr/\u003eCovers comprehensive interview topics\u003cbr/\u003eBest for 3+ months of prep time |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthammami01%2Fleetcode-solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fthammami01%2Fleetcode-solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthammami01%2Fleetcode-solutions/lists"}