{"id":18772980,"url":"https://github.com/nimit95/leetcode","last_synced_at":"2025-12-13T15:30:13.630Z","repository":{"id":124114477,"uuid":"75617428","full_name":"nimit95/leetcode","owner":"nimit95","description":"LeetCode Problems' Solutions ","archived":false,"fork":false,"pushed_at":"2017-05-18T18:08:29.000Z","size":36,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-12-29T08:24:29.463Z","etag":null,"topics":["competettive-programming","datastructure","leetcode"],"latest_commit_sha":null,"homepage":null,"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/nimit95.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":"2016-12-05T11:14:13.000Z","updated_at":"2022-09-25T21:49:52.000Z","dependencies_parsed_at":null,"dependency_job_id":"d0812331-2e7f-47a0-9e45-b32de0db3d21","html_url":"https://github.com/nimit95/leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nimit95%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nimit95%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nimit95%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nimit95%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nimit95","download_url":"https://codeload.github.com/nimit95/leetcode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239680983,"owners_count":19679509,"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":["competettive-programming","datastructure","leetcode"],"created_at":"2024-11-07T19:32:03.993Z","updated_at":"2025-12-13T15:30:13.590Z","avatar_url":"https://github.com/nimit95.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"LeetCode\n========\nhttps://leetcode.com/nimit95/\n\n### LeetCode Algorithm\n\n| # | Title | Solution | Difficulty |\n|---| ----- | -------- | ---------- |\n|1|[Two Sum](https://leetcode.com/problems/two-sum/)| [C++](./cpp/2Sum.cpp)|Easy|\n|2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)| [C++](./cpp/addTwoNumbers.cpp)|Medium|\n|6|[ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/)| [C++](./cpp/zigZagConversion.cpp)|Easy|\n|7|[Reverse Integer](https://leetcode.com/problems/reverse-integer/)| [C++](./cpp/reverseinteger.cpp)|Easy|\n|9|[Palindrome Number](https://leetcode.com/problems/palindrome-number/)| [C++](./cpp/Palindromenumber.cpp)|Easy|\n|13|[Roman to Integer](https://leetcode.com/problems/roman-to-integer/)| [C++](./cpp/romanToIntegers.cpp)|Easy|\n|19|[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [C++](./cpp/removeNlistend.cpp)|Easy|\n|20|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)| [C++](./cpp/validParentheses.cpp)|Easy|\n|21|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)| [C++](./cpp/mergeTwoSortedList.cpp)|Easy|\n|24|[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/#/description)|[C++](./cpp/swap-nodes-in-pairs.cpp)|Medium|\n|26|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)| [C++](./cpp/RemoveDuplicates.c-p)|Easy|\n|27|[Remove Element](https://leetcode.com/problems/remove-element/)| [C++](./cpp/RemoveElement.cpp)|Easy|\n|35|[Search Insert Position](https://leetcode.com/problems/search-insert-position/#/description)|[C++](./cpp/search-insert-position.cpp)|Easy|\n|39|[Combination Sum](https://leetcode.com/problems/combination-sum/#/description)|[C++](./cpp/combination-sum.cpp)|Medium|\n|40|[Combination Sum 2](https://leetcode.com/problems/combination-sum-ii/#/description)|[C++](./cpp/combination-sum-ii.cpp)|Medium|\n|46|[Permutations](https://leetcode.com/problems/permutations/#/description)|[C++](./cpp/permutations.cpp)|Medium|\n|50|[Pow(x, n)](https://leetcode.com/problems/powx-n/#/description)|[C++](./cpp/powx-n.cpp)|Medium|\n|53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/#/description)|[C++](./cpp/maximum-subarray.cpp)|Easy|\n|61|[Rotate List](https://leetcode.com/problems/rotate-list/#/description)|[C++](./cpp/rotate-list.cpp)|Medium|\n|64|[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/#/description)|[C++](./cpp/minimum-path-sum.cpp)|Medium|\n|66|[Plus One](https://leetcode.com/problems/plus-one/#/description)|[C++](./cpp/plus-one.cpp)|Easy|\n|67|[Add Binary](https://leetcode.com/problems/add-binary/#/description)|[C++](./cpp/add-binary.cpp)|Easy|\n|70|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/#/description)|[C++](./cpp/climbing-stairs.cpp)|Easy|\n|77|[Combinations](https://leetcode.com/problems/combinations/#/description)|[C++](./cpp/combinations.cpp)|Medium|\n|78|[Subsets](https://leetcode.com/problems/subsets/#/description)|[C++](./cpp/subsets.cpp)|Medium|\n|82|[Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/#/description)|[C++](./cpp/remove-duplicates-from-sorted-list-ii.cpp)|Medium|\n|100|[Same Tree](https://leetcode.com/problems/same-tree/#/description)| [C++](./cpp/same-tree.cpp)|Easy|\n|101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree)| [C++](./cpp/symmetric-tree.cpp)|Easy|\n|104|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/#/description) | [C++](./cpp/maximum-depth-of-binary-tree.cpp)|Easy|\n|107|[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/#/description)|[C++](./cpp/binary-tree-level-order-traversal-ii.cpp)|Easy|\n|108|[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree)| [C++](./cpp/sorted-array-to-binary-search-tree.cpp) |Easy|\n|110|[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/)| [C++](./cpp/balanced-binary-tree.cpp)|Easy|\n|111|[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/#/description)|[C++](./cpp/minimum-depth-of-binary-tree.cpp)|Easy|\n|112|[Path Sum](https://leetcode.com/problems/path-sum/#/description)|[C++](./cpp/path-sum.cpp)|Easy|\n|120|[Triangle](https://leetcode.com/problems/triangle)| [C++](./cpp/triangle.cpp)|Medium|\n|226|[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/#/description)|[C++](./cpp/invert-binary-tree.cpp)|Easy|\n|235|[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/#/description)|[C++](./cpp/lowest-common-ancestor-of-a-bst.cpp)|Easy|\n|257|[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/#/description)|[C++](./cpp/binary-tree-paths.cpp)|Easy|\n|404|[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves)| [C++](./cpp/sumOfLeftLeaves.cpp)|Easy|\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnimit95%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnimit95%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnimit95%2Fleetcode/lists"}