https://github.com/nimit95/leetcode

LeetCode Problems' Solutions
https://github.com/nimit95/leetcode

competettive-programming datastructure leetcode

Last synced: 24 days ago
JSON representation

LeetCode Problems' Solutions

• Host: GitHub
• URL: https://github.com/nimit95/leetcode
• Owner: nimit95
• Created: 2016-12-05T11:14:13.000Z (about 8 years ago)
• Default Branch: master
• Last Pushed: 2017-05-18T18:08:29.000Z (over 7 years ago)
• Last Synced: 2024-11-07T19:43:15.687Z (3 months ago)
• Topics: competettive-programming, datastructure, leetcode
• Language: C++
• Size: 35.2 KB
• Stars: 3
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
LeetCode

========

https://leetcode.com/nimit95/

### LeetCode Algorithm

| # | Title | Solution | Difficulty |

|---| ----- | -------- | ---------- |

|1|[Two Sum](https://leetcode.com/problems/two-sum/)| [C++](./cpp/2Sum.cpp)|Easy|

|2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)| [C++](./cpp/addTwoNumbers.cpp)|Medium|

|6|[ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/)| [C++](./cpp/zigZagConversion.cpp)|Easy|

|7|[Reverse Integer](https://leetcode.com/problems/reverse-integer/)| [C++](./cpp/reverseinteger.cpp)|Easy|

|9|[Palindrome Number](https://leetcode.com/problems/palindrome-number/)| [C++](./cpp/Palindromenumber.cpp)|Easy|

|13|[Roman to Integer](https://leetcode.com/problems/roman-to-integer/)| [C++](./cpp/romanToIntegers.cpp)|Easy|

|19|[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [C++](./cpp/removeNlistend.cpp)|Easy|

|20|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)| [C++](./cpp/validParentheses.cpp)|Easy|

|21|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)| [C++](./cpp/mergeTwoSortedList.cpp)|Easy|

|24|[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/#/description)|[C++](./cpp/swap-nodes-in-pairs.cpp)|Medium|

|26|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)| [C++](./cpp/RemoveDuplicates.c-p)|Easy|

|27|[Remove Element](https://leetcode.com/problems/remove-element/)| [C++](./cpp/RemoveElement.cpp)|Easy|

|35|[Search Insert Position](https://leetcode.com/problems/search-insert-position/#/description)|[C++](./cpp/search-insert-position.cpp)|Easy|

|39|[Combination Sum](https://leetcode.com/problems/combination-sum/#/description)|[C++](./cpp/combination-sum.cpp)|Medium|

|40|[Combination Sum 2](https://leetcode.com/problems/combination-sum-ii/#/description)|[C++](./cpp/combination-sum-ii.cpp)|Medium|

|46|[Permutations](https://leetcode.com/problems/permutations/#/description)|[C++](./cpp/permutations.cpp)|Medium|

|50|[Pow(x, n)](https://leetcode.com/problems/powx-n/#/description)|[C++](./cpp/powx-n.cpp)|Medium|

|53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/#/description)|[C++](./cpp/maximum-subarray.cpp)|Easy|

|61|[Rotate List](https://leetcode.com/problems/rotate-list/#/description)|[C++](./cpp/rotate-list.cpp)|Medium|

|64|[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/#/description)|[C++](./cpp/minimum-path-sum.cpp)|Medium|

|66|[Plus One](https://leetcode.com/problems/plus-one/#/description)|[C++](./cpp/plus-one.cpp)|Easy|

|67|[Add Binary](https://leetcode.com/problems/add-binary/#/description)|[C++](./cpp/add-binary.cpp)|Easy|

|70|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/#/description)|[C++](./cpp/climbing-stairs.cpp)|Easy|

|77|[Combinations](https://leetcode.com/problems/combinations/#/description)|[C++](./cpp/combinations.cpp)|Medium|

|78|[Subsets](https://leetcode.com/problems/subsets/#/description)|[C++](./cpp/subsets.cpp)|Medium|

|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|

|100|[Same Tree](https://leetcode.com/problems/same-tree/#/description)| [C++](./cpp/same-tree.cpp)|Easy|

|101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree)| [C++](./cpp/symmetric-tree.cpp)|Easy|

|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|

|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|

|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|

|110|[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/)| [C++](./cpp/balanced-binary-tree.cpp)|Easy|

|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|

|112|[Path Sum](https://leetcode.com/problems/path-sum/#/description)|[C++](./cpp/path-sum.cpp)|Easy|

|120|[Triangle](https://leetcode.com/problems/triangle)| [C++](./cpp/triangle.cpp)|Medium|

|226|[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/#/description)|[C++](./cpp/invert-binary-tree.cpp)|Easy|

|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|

|257|[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/#/description)|[C++](./cpp/binary-tree-paths.cpp)|Easy|

|404|[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves)| [C++](./cpp/sumOfLeftLeaves.cpp)|Easy|