KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#typescript #ai-agents #cli #open-source #ai #claude-code #codex #developer-tools #react #windows #deepseek-harness #ai-agent

Interview-Problems

★ 3 Open GitHub ↗

# Interview-Problems This repository contains my solutions to some of the interview problems from Leetcode and InterviewBit.

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Interview-Problems
This repository contains my solutions to some of the interview problems on Leetcode and InterviewBit.

## My Programming Handles
| Platform | Handle |
| -------- | ------ |
|Leetcode|[amit_839](https://leetcode.com/amit_839/)|
|Codechef|[amit_839](https://www.codechef.com/users/amit_839)|
|HackerRank|[akp_1997](https://www.hackerrank.com/akp_1997?hr_r=1)|
|Codeforces|[amit_839](https://codeforces.com/profile/amit_839)|
|Hackerearth|[amitpandey839](https://www.hackerearth.com/@amitpandey839)|
|Spoj|[amit_839](https://www.spoj.com/users/amit_839/)|

## C++ Solution for Leetcode

#### [Difficulty Level - Hard](./Leetcode/Hard/)

| # | Title | Solution |
|---| ----- | -------- |
|10|[Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/)|[C++](./Leetcode/Hard/10.cpp)|
|23|[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)|[C++](./Leetcode/Hard/23.cpp)|
|42|[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)|[C++](./Leetcode/Hard/42.cpp)|
|44|[Wildcard Matching](https://leetcode.com/problems/wildcard-matching/)|[C++](./Leetcode/Hard/44.cpp)|
|45|[Jump Game II](https://leetcode.com/problems/jump-game-ii)|[C++](./Leetcode/Hard/45.cpp)|
|72|[Edit Distance](https://leetcode.com/problems/edit-distance/)|[C++](./Leetcode/Hard/72.cpp)|
|97|[InterLeaving String](https://leetcode.com/problems/interleaving-string/)|[C++](./Leetcode/Hard/97.cpp)|
|99|[Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/)|[C++](./Leetcode/Hard/99.cpp), [Golang](./Leetcode/Hard/99.go)
|124|[Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/)|[C++](./Leetcode/Hard/124.cpp)|
|126|[Word Ladder II](https://leetcode.com/problems/word-ladder-ii/)|[C++](./Leetcode/Hard/126.cpp)|
|140|[Word Break II](https://leetcode.com/problems/word-break-ii/)|[C++](./Leetcode/Hard/140.cpp)|
|312|[Burst Balloons](https://leetcode.com/problems/burst-balloons/)|[C++](./Leetcode/Hard/312.cpp)|
|410|[Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/)|[C++](./Leetcode/Hard/410.cpp)|
|639|[Decode Ways II](https://leetcode.com/problems/decode-ways-ii/)|[C++](./Leetcode/Hard/639.cpp)|
|1000|[Minimum Cost to Merge Stones](https://leetcode.com/problems/minimum-cost-to-merge-stones/)|[C++](./Leetcode/Hard/1000.cpp)|
|1095|[Find in Mountain Array](https://leetcode.com/problems/find-in-mountain-array/)|[C++](./Leetcode/Hard/1095.cpp)|
|1434|[Number of Ways to Wear Different Hats to Each Other](https://leetcode.com/problems/number-of-ways-to-wear-different-hats-to-each-other/)|[C++](./Leetcode/Hard/1434.cpp)|

#### [Difficulty Level - Medium](./Leetcode/Medium/)
| # | Title | Solution |
|---| ----- | -------- |
|2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)|[C++](./Leetcode/Medium/2.cpp)|
|5|[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)|[C++](./Leetcode/Medium/5.cpp)|
|22|[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/)|[C++](./Leetcode/Medium/22.cpp)|
|33|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)|[C++](./Leetcode/Medium/33.cpp)|
|46|[Permutations](https://leetcode.com/problems/permutations/)|[C++](./Leetcode/Medium/46.cpp)|
|50|[Pow(x, n)](https://leetcode.com/problems/powx-n/)|[C++](./Leetcode/Medium/50.cpp)|
|54|[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)|[C++](./Leetcode/Medium/54.cpp)|
|55|[Jump Game](https://leetcode.com/problems/jump-game/)|[C++](./Leetcode/Medium/55.cpp)|
|62|[Unique Paths](https://leetcode.com/problems/unique-paths/)|[C++](./Leetcode/Medium/62.cpp)|
|64|[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/)|[C+++](./Leetcode/Medium/64.cpp)|
|78|[Subsets](https://leetcode.com/problems/subsets/)|[C++](./Leetcode/Medium/78.cpp)|
|79|[Word Search](https://leetcode.com/problems/word-search/)|[C++](./Leetcode/Medium/79.cpp)|
|91|[Decode Ways](https://leetcode.com/problems/decode-ways/)|[C++](./Leetcode/Medium/91.cpp)|
|94|[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)|[C++](./Leetcode/Medium/94.cpp)|
|98|[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)|[C++](./Leetcode/Medium/98.cpp)|
|127|[Word Ladder](https://leetcode.com/problems/word-ladder/)|[C++](./Leetcode/Medium/127.cpp)|
|138|[Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/)|[C++](./Leetcode/Medium/138.cpp)|
|139|[Word Break](https://leetcode.com/problems/word-break/)|[C++](./Leetcode/Medium/139.cpp)|
|152|[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)|[C++](./Leetcode/Medium/152.cpp)|
|162|[Find Peak Element](https://leetcode.com/problems/find-peak-element/)|[C++](./Leetcode/Medium/162.cpp)|
|179|[Largest Number](https://leetcode.com/problems/largest-number/)|[C++](./Leetcode/Medium/179.cpp)|
|220|[Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/)|[C++](./Leetcode/Medium/220.cpp)|
|230|[Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)|[C++](./Leetcode/Medium/230.cpp)|
|238|[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/)|[C++](./Leetcode/Medium/238.cpp)|
|279|[Perfect Squares](https://leetcode.com/problems/perfect-squares/)|[C++](./Leetcode/Medium/279.cpp)|
|300|[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)|[C++](./Leetcode/Medium/300.cpp)|
|322|[Coin Change](https://leetcode.com/problems/coin-change/)|[C++](./Leetcode/Medium/322.cpp)|
|334|[Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/)|[C++](./Leetcode/Medium/334.cpp)|
|347|[Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/)|[C++](./Leetcode/Medium/347.cpp)|
|394|[Decode String](https://leetcode.com/problems/decode-string/)|[C++](./Leetcode/Medium/394.cpp)|
|515|[Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/)|[C++](./Leetcode/Medium/515.cpp)|
|516|[Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/)|[C++](./Leetcode/Medium/516.cpp)|
|583|[Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings/)|[C++](./Leetcode/Medium/583.cpp)|
|647|[Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/)|[C++](./Leetcode/Medium/647.cpp)|
|866|[Prime Palindrome](https://leetcode.com/problems/prime-palindrome/)|[C++](./Leetcode/Medium/866.cpp)|
|898|[Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays/)|[C++](./Leetcode/Medium/898.cpp)|
|931|[Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum/)|[C++](./Leetcode/Medium/931.cpp)|
|1072|[Flip Columns For Maximum Number of Equal Rows](https://leetcode.com/problems/flip-columns-for-maximum-number-of-equal-rows/)|[C++](./Leetcode/Medium/1072.cpp)|
|1091|[Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/)|[C++](./Leetcode/Medium/1091.cpp)|
|1130|[Minimum Cost Tree From Leaf Values](https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/)|[C++](./Leetcode/Medium/1130.cpp)|
|1143|[Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)|[C++](./Leetcode/Medium/1143.cpp)|
|1171|[Remove Zero Sum Conescutive Nodes from Linked List](https://leetcode.com/contest/weekly-contest-151/problems/remove-zero-sum-consecutive-nodes-from-linked-list/)|[C++](./Leetcode/Medium/1171.cpp)|
|1177|[Can Make Palindrome from Substrings](https://leetcode.com/contest/weekly-contest-152/problems/can-make-palindrome-from-substring/)|[C++](./Leetcode/Medium/1177.cpp)|
|1186|[Maximum Subarray Sum with One Deletion](https://leetcode.com/problems/maximum-subarray-sum-with-one-deletion/)|[C++](./Leetcode/Medium/1186.cpp)|
|1219|[Path with Maximum Gold](https://leetcode.com/problems/path-with-maximum-gold/)|[C++](./Leetcode/Medium/1219.cpp)|
|1227|[Airplane Seat Assignment Probability](https://leetcode.com/problems/airplane-seat-assignment-probability/)|[C++](./Leetcode/Medium/1227.cpp)|
|1261|[Find Elements in a Contaminated Binary Tree](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/)|[C++](./Leetcode/Medium/1261.cpp)|
|1262|[Greatest Sum Divisible by Three](https://leetcode.com/problems/greatest-sum-divisible-by-three/)|[C++](./Leetcode/Medium/1262.cpp)|

#### [Difficulty Level - Easy](./Leetcode/Easy/)
| # | Title | Solution |
|---| ----- | -------- |
|20|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)|[C++](./Leetcode/Easy/20.cpp)|
|53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)|[C++](./Leetcode/Easy/53.cpp)|
|70|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)|[C++](./Leetcode/Easy/70.cpp)|
|104|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)|[C++](./Leetcode/Easy/104.cpp)|
|108|[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)|[C++](./Leetcode/Easy/108.cpp)|
|121|[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)|[C++](./Leetcode/Easy/121.cpp)|
|125|[Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)|[C++](./Leetcode/Easy/125.cpp)|
|136|[Single Number](https://leetcode.com/problems/single-number/submissions/)|[C++](./Leetcode/Easy/136.cpp)|
|160|[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/)|[C++](./Leetcode/Easy/160.cpp)|
|169|[Majority Element](https://leetcode.com/problems/majority-element/)|[C++](./Leetcode/Easy/169.cpp)|
|198|[House Robber](https://leetcode.com/problems/house-robber/)|[C++](./Leetcode/Easy/198.cpp)|
|206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)|[C++](./Leetcode/Easy/206.cpp)|
|237|[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)|[C++](./Leetcode/Easy/237.cpp)|
|283|[Move Zeros](https://leetcode.com/problems/move-zeroes/)|[C++](./Leetcode/Easy/283.cpp)|
|344|[Reverse String](https://leetcode.com/problems/reverse-string/)|[C++](./Leetcode/Easy/344.cpp)|
|345|[Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/)|[C++](./Leetcode/Easy/345.cpp)|
|371|[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)|[C++](./Leetcode/Easy/371.cpp)|
|387|[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/)|[C++](./Leetcode/Easy/387.cpp)|
|409|[Longest Palindrome](https://leetcode.com/problems/longest-palindrome/)|[C++](./Leetcode/Easy/409.cpp)|
|412|[Fizz Buzz](https://leetcode.com/problems/fizz-buzz/)|[C++](./Leetcode/Easy/412.cpp)|
|872|[Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees/)|[C++](./Leetcode/Easy/872.cpp)|
|953|[Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary/)|[C++](./Leetcode/Easy/953.cpp)|
|1022|[Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/)|[C++](./Leetcode/Easy/1022.cpp)|
|1170|[Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/)|[C++](./Leetcode/Easy/1170.cpp)|
|1175|[Prime Arrangements](https://leetcode.com/problems/prime-arrangements/)|[C++](./Leetcode/Easy/1175.cpp)|
|1260|[Shift 2D Grid](https://leetcode.com/problems/shift-2d-grid/)|[C++](./Leetcode/Easy/1260.cpp)|

Interview-Problems

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README