Collection of LeetCode ,Smart Interviews,Interviewbit,Codeforces questions etc I have solved till date
This repository contains solutions to various problems on InterviewBit,Leetcode,Smart Interviews covering a wide range of topics and difficulty levels. The code snippets provided are as solved on the platform.
The repository includes solutions for problems in the following categories:
- Programming: Comprehensive solutions across all major domains, including arrays, strings, dynamic programming, graph algorithms, and more.
- Fork the Repository: Start by forking this repository to your own GitHub account.
- Make Changes: Add, delete, or modify the solutions as needed.
- Create a Pull Request: Submit your changes for review by creating a pull request.
Contributions are welcome under the following scenarios:
- New Solutions:
- If a problem lacks a solution in the main branch, feel free to add your implementation.
- Improved Solutions:
- If your solution is asymptotically faster than the existing one, replace the original with your implementation.
- If your algorithm has the same time complexity but with reduced code size, comment out the original solution and provide your optimized version.
- Alternative Methods:
- If your approach is slower but offers an interesting perspective or learning value, comment it within the main file alongside the original solution.
- Please ensure your contributions are well-documented with appropriate comments.
- Adhere to the repository's structure and naming conventions for consistency.
- Test your solutions on respective platforms before submitting.
Contributions to this repository not only enhance its utility but also help the community prepare better for coding interviews. Happy coding! 🎉
| 0238-product-of-array-except-self |
| 0560-subarray-sum-equals-k |
| 0219-contains-duplicate-ii |
| 2599-take-k-of-each-character-from-left-and-right |
| 2868-continuous-subarrays |
| 3267-find-longest-special-substring-that-occurs-thrice-i |
| 0053-maximum-subarray |
| 0190-reverse-bits |
| 0191-number-of-1-bits |
| 0240-search-a-2d-matrix-ii |
| 0007-reverse-integer |
| 0069-sqrtx |
| 0204-count-primes |
| 0231-power-of-two |
| 0371-sum-of-two-integers |
| 1236-n-th-tribonacci-number |
| 3555-final-array-state-after-k-multiplication-operations-i |
| 0021-merge-two-sorted-lists |
| 0231-power-of-two |
| 0042-trapping-rain-water |
| 0053-maximum-subarray |
| 0121-best-time-to-buy-and-sell-stock |
| 0338-counting-bits |
| 0647-palindromic-substrings |
| 1236-n-th-tribonacci-number |
| 2076-sum-of-digits-of-string-after-convert |
| 2232-adding-spaces-to-a-string |
| 2551-apply-operations-to-an-array |
| 3555-final-array-state-after-k-multiplication-operations-i |
| 0204-count-primes |
| 0204-count-primes |
| 0128-longest-consecutive-sequence |
| 0021-merge-two-sorted-lists |
| 0141-linked-list-cycle |
| 0817-design-hashmap |
| 1331-path-with-maximum-gold |
| 0074-search-a-2d-matrix |
| 0240-search-a-2d-matrix-ii |
| 1331-path-with-maximum-gold |
| 1476-count-negative-numbers-in-a-sorted-matrix |
| 3267-find-longest-special-substring-that-occurs-thrice-i |
| 0817-design-hashmap |
| 0817-design-hashmap |
| 2868-continuous-subarrays |
| 2868-continuous-subarrays |
| 3555-final-array-state-after-k-multiplication-operations-i |
| 2868-continuous-subarrays |
| 2868-continuous-subarrays |
| 0020-valid-parentheses |
| 0042-trapping-rain-water |
| 0042-trapping-rain-water |
| 0102-binary-tree-level-order-traversal |
| 0104-maximum-depth-of-binary-tree |
| 0104-maximum-depth-of-binary-tree |
| 0110-balanced-binary-tree |
| 0235-lowest-common-ancestor-of-a-binary-search-tree |
| 0437-path-sum-iii |
| 0904-leaf-similar-trees |
| 0235-lowest-common-ancestor-of-a-binary-search-tree |
| 0450-delete-node-in-a-bst |
| 0015-3sum |
| 0217-contains-duplicate |
| 1236-n-th-tribonacci-number |