{"id":26291207,"url":"https://github.com/harsh971/leetcode-solutions","last_synced_at":"2026-05-10T00:45:40.527Z","repository":{"id":60553088,"uuid":"528714173","full_name":"Harsh971/LeetCode-Solutions","owner":"Harsh971","description":"Here you will get All Solutions for Topics from LeetCode Platform which i Solve on Regular Basic","archived":false,"fork":false,"pushed_at":"2023-01-06T18:35:21.000Z","size":160,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2023-03-05T08:23:04.591Z","etag":null,"topics":["c","cpp","java","leetcode","leetcode-cpp","leetcode-solutions","solutions"],"latest_commit_sha":null,"homepage":"","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/Harsh971.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}},"created_at":"2022-08-25T05:56:15.000Z","updated_at":"2022-08-30T07:28:26.000Z","dependencies_parsed_at":"2023-02-06T07:46:43.664Z","dependency_job_id":null,"html_url":"https://github.com/Harsh971/LeetCode-Solutions","commit_stats":null,"previous_names":[],"tags_count":null,"template":null,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Harsh971%2FLeetCode-Solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Harsh971%2FLeetCode-Solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Harsh971%2FLeetCode-Solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Harsh971%2FLeetCode-Solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Harsh971","download_url":"https://codeload.github.com/Harsh971/LeetCode-Solutions/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243668008,"owners_count":20328035,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["c","cpp","java","leetcode","leetcode-cpp","leetcode-solutions","solutions"],"created_at":"2025-03-15T00:35:57.254Z","updated_at":"2026-05-10T00:45:40.490Z","avatar_url":"https://github.com/Harsh971.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003cp align=\"center\"\u003e\n  \u003ca href=\"https://leetcode.com/harshthakkar36/\"\u003e\n    \u003cimg alt=\"LeetCode\" height=\"50%\" width=\"50%\"  src=\"https://github.com/Harsh971/LeetCode-Solutions/blob/main/LeetCode.png\"\u003e\n  \u003c/a\u003e\n\u003c/p\u003e\n\n# LeetCode_Solutions\n\nHere you will get All Solutions for Topics from LeetCode Platform which i Solve on Regular Basic\n\n\n\n\n## 🛠 Skills Used in this Repository...\n \n \u003ca href=\"https://www.w3schools.com/cpp/\" target=\"_blank\" rel=\"noreferrer\"\u003e \u003cimg src=\"https://raw.githubusercontent.com/devicons/devicon/master/icons/cplusplus/cplusplus-original.svg\" alt=\"cplusplus\" height=\"50\" width=\"50\"/\u003e \u003c/a\u003e\n   \u0026nbsp;\u0026nbsp;\n  \u003ca href=\"https://www.java.com\" target=\"_blank\" rel=\"noreferrer\"\u003e \u003cimg src=\"https://raw.githubusercontent.com/devicons/devicon/master/icons/java/java-original.svg\" alt=\"java\" height=\"50\" width=\"50\"/\u003e \u003c/a\u003e\n  \n\n## Sections... (Click on these to View Solutions of them Individually...)\n\n- [LeetCode 75 Study Plan to Ace Interview Level 1](https://github.com/Harsh971/LeetCode-Solutions/tree/main/LeetCode%2075%20Study%20Plan%20to%20Ace%20Interview%20Level%201)\n- [LeetCode 75 Study Plan to Ace Interview Level 2](https://github.com/Harsh971/LeetCode-Solutions/tree/main/LeetCode%2075%20Study%20Plan%20to%20Ace%20Interview%20Level%202)\n- [All Practice Problems](#all-practice-problems)\n\n\n\n## All Practice Problems\n\n|  | Problem Name     |Difficulty Level|Solution|Time Complexity|Space Complexity|\n| :-: | :-: |:-:| :-: | :-:|:-:|\n| 1      | Two Sum | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Two-Sum.java)|O(n)|O(n)|\n| 9      | Palindrome Number | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Palindrome-Number.cpp)|O(log n)|O(log n)|\n| 13     | Roman to Integer | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Roman-to-Integer.cpp)|O(n)|O(1)|\n| 16     | 3Sum Closest | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/3Sum-Closest.cpp)|O(n^n)|O(ans)|\n| 21     | Merge Two Sorted Lists | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Merge-Two-Sorted-Lists.cpp)|O(n1+n2)|O(n1+n2)|\n| 62     | Unique Paths | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Unique-Paths.cpp)|O(m*n)|O(n)|\n| 70     | Climbing Stairs | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Climbing-Stairs.cpp)|O(n)|O(1)|\n| 98     | Validate Binary Search Tree | Medum|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Validate-Binary-Search-Tree.cpp)|O(n)|O(h)|\n| 102    | Binary Tree Level Order Traversal | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Binary-Tree-Level-Order-Traversal.cpp)|O(n)|O(n)|\n| 110    | Balanced Binary Tree | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Balanced-Binary-Tree.cpp)|O(n log n)|O(h)|\n| 121    | Best Time to Buy and Sell Stock | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Best-Time-to-Buy-and-Sell-Stock.cpp)|O(n)|O(1)|\n| 142    | Linked List Cycle 2 | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Linked-List-Cycle-2.cpp)|O(n)|O(1)|\n| 173    | Balanced Search Tree Iterator | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Binary-Search-Tree-Iterator.cpp)|O(h)|O(h)|\n| 199    | Binary Tree Right Side View | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Binary-Tree-Right-Side-View.cpp)|O(n)|O(n)|\n| 200    | Number of Islands | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Number-of-Islands.cpp)|O(m*n)|O(min(m,n))|\n| 205    | Isomorphic Strings | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Isomorphic-Strings.cpp)|O(n)|O(1)|\n| 206    | Reverse Linked List | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Reverse-Linked-List.cpp)|O(n)|O(1)|\n| 227    | Basic Calculator 2 | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Basic-Calculator-II.cpp)|O(n)|O(1)|\n| 278    | First Bad Version | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/First-Bad-Version.cpp)|O(log n)|O(1)|\n| 235    | Lowest Common Ancestor of a Binary Search Tree | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Lowest-Common-Ancestor-of-a-Binary-Search-Tree.cpp)|O(h)|O(h)|\n| 299    | Bulls and Cows | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Bulls-and-Cows.cpp)|O(n)|O(1)|\n| 322    | Coin Change | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Coin-Change.cpp)|O(m*n)|O(m)|\n| 392    | Is Subsequence | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Is-SubSequence.cpp)|O(n)|O(1)|\n| 394    | Decode String | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Decode-String.cpp)|O(n)|O(n)|\n| 409    | Longest Palindrome | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Longest-Palindrome.cpp)|O(n)|O(1)|\n| 424    | Longest Repeating Character Replacement | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Longest-Repeating-Character-Replacement.cpp)|O(n)|O(1)|\n| 438    | Find All Anagrams in a String | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Find-All-Anagrams-in-a-String.cpp)|O(n)|O(1)|\n| 509    | Fibonacci Number | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Fibonnaic-Number.cpp)|O(n)|O(1)|\n| 589    | N-ary-Tree-Preorder-Traversal | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/N-ary-Tree-Preorder-Traversal.cpp)|O(n)|O(n)|\n| 629    | Top K Frequent Words | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Top-K-Frequent-Words.cpp)|O(n)|O(n)|\n| 704    | Binary Search | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Binary-Search.cpp)|O(log n)|O(1)|\n| 724    | Find Pivot Index | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Find-Pivot-Index.cpp)|O(n)|O(1)|\n| 733    | Flood Fill | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Flood-Fill.cpp)|O(n^2)|O(n^2)|\n| 735    | Asteroid Collision | Medium|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Asteroid-Collision.cpp)|O(n)|O(n)|\n| 746    | Min Cost Climbing Stairs | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Min-Cost-Climbing-Stairs.cpp)|O(n)|O(1)|\n| 815    | Bus Routes | Hard|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Bus-Routes.cpp)|O(n^2)|O(n^2)|\n| 844    | Backspace String Compare | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Backspace-String-Compare.cpp)|O(n)|O(1)|\n| 876    | Middle of the Linked List | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Middle-of-the-Linked-List.cpp)|O(n)|O(1)|\n| 1046   | Last Stone Weight | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Last-Stone-Weight.cpp)|O(n log n)|O(n)|\n| 1480   | Running Sum of 1d Array | Easy|[Click Here](https://github.com/Harsh971/LeetCode-Solutions/blob/main/Solutions/Running-Sum-of-1d-Array.cpp)|O(n)|O(1)|\n\n\n## Feedback\nIf you have any feedback, please reach out to us at harsh.thakkar0369@gmail.com\n\n## \u003cimg src=\"https://t3.ftcdn.net/jpg/03/55/16/48/360_F_355164871_fQLc5jgqvYaqKbrlM20WQ09r1xqune1J.jpg\" alt=\"harshthakkar971\" width=\"30\" /\u003e Connect with Me\n\u003cp\u003e\n\n \u003ca href=\"https://twitter.com/HarshThakkar971\" target=\"blank\"\u003e\u003cimg align=\"center\" src=\"https://upload.wikimedia.org/wikipedia/commons/thumb/4/4f/Twitter-logo.svg/1200px-Twitter-logo.svg.png\" alt=\"HarshThakkar971\" height=\"40\" width=\"50\" /\u003e\u003c/a\u003e\n  \u0026nbsp;\u0026nbsp;\n  \t\u003ca href=\"https://linkedin.com/in/harsh-thakkar-7764bb1a4\" target=\"blank\"\u003e\u003cimg align=\"center\" src=\"https://upload.wikimedia.org/wikipedia/commons/thumb/c/ca/LinkedIn_logo_initials.png/800px-LinkedIn_logo_initials.png\" alt=\"harsh-thakkar-7764bb1a4\" height=\"40\" width=\"40\" /\u003e\u003c/a\u003e\n  \u0026nbsp;\u0026nbsp;\n \u003ca href=\"https://instagram.com/harsh_thakkar09\" target=\"blank\"\u003e\u003cimg align=\"center\" src=\"https://upload.wikimedia.org/wikipedia/commons/thumb/e/e7/Instagram_logo_2016.svg/768px-Instagram_logo_2016.svg.png\" alt=\"harsh_thakkar09\" height=\"40\" width=\"40\" /\u003e\u003c/a\u003e\n\u003c/p\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fharsh971%2Fleetcode-solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fharsh971%2Fleetcode-solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fharsh971%2Fleetcode-solutions/lists"}