{"id":19039546,"url":"https://github.com/codedecks-in/leetcode-solutions","last_synced_at":"2025-05-14T15:05:43.370Z","repository":{"id":37301242,"uuid":"260873676","full_name":"codedecks-in/LeetCode-Solutions","owner":"codedecks-in","description":"This repository consists of solutions to the problem from LeetCode platform. Subscribe to our Channel for more updates","archived":false,"fork":false,"pushed_at":"2025-03-18T13:19:42.000Z","size":985,"stargazers_count":848,"open_issues_count":202,"forks_count":423,"subscribers_count":18,"default_branch":"master","last_synced_at":"2025-04-15T08:45:38.712Z","etag":null,"topics":["beginner-friendly","breadth","codedecks","first-timers","first-timers-only","good-first-issue","hacktoberfest","hacktoberfest-accepted","hacktoberfest-starter","hacktoberfest2023","help-wanted","leetcode","leetcode-cpp","leetcode-java","leetcode-platform","leetcode-practice","leetcode-python","leetcode-questions","leetcode-solutions","low-hanging-fruit"],"latest_commit_sha":null,"homepage":"https://www.youtube.com/c/codedecks","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/codedecks-in.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":".github/FUNDING.yml","license":"LICENSE","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},"funding":{"github":["codedecks-in"],"custom":["https://paypal.me/codedecks"]}},"created_at":"2020-05-03T09:52:28.000Z","updated_at":"2025-04-12T03:33:07.000Z","dependencies_parsed_at":"2025-04-07T23:00:39.538Z","dependency_job_id":"24aab2fa-e0e9-4d84-9727-826defdd71a5","html_url":"https://github.com/codedecks-in/LeetCode-Solutions","commit_stats":null,"previous_names":[],"tags_count":2,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codedecks-in%2FLeetCode-Solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codedecks-in%2FLeetCode-Solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codedecks-in%2FLeetCode-Solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codedecks-in%2FLeetCode-Solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/codedecks-in","download_url":"https://codeload.github.com/codedecks-in/LeetCode-Solutions/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254168802,"owners_count":22026206,"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":["beginner-friendly","breadth","codedecks","first-timers","first-timers-only","good-first-issue","hacktoberfest","hacktoberfest-accepted","hacktoberfest-starter","hacktoberfest2023","help-wanted","leetcode","leetcode-cpp","leetcode-java","leetcode-platform","leetcode-practice","leetcode-python","leetcode-questions","leetcode-solutions","low-hanging-fruit"],"created_at":"2024-11-08T22:17:34.548Z","updated_at":"2025-05-14T15:05:43.309Z","avatar_url":"https://github.com/codedecks-in.png","language":"C++","readme":"# [LeetCode-Solutions](https://www.youtube.com/playlist?list=PLlUdLC2oSxz2Y1g6V8oRCzauOvbnKl2Ee)\n\n\u003cp align=\"center\"\u003e\n \u003ch2\u003eJoin Us on Telegram \u0026 Facebook\u003c/h2\u003e\n \u003ca href=\"https://t.me/codecks\"\u003e\n \u003cimg align=\"left\" height=100 src=\"https://media.giphy.com/media/wlR4kWTnwEyY8RwHKM/giphy.gif\"\u003e\n \u003c/a\u003e\n \u003ca href=\"https://www.facebook.com/groups/codedecks\"\u003e\n \u003cimg align=\"left\" height=100 src=\"https://static1.squarespace.com/static/5994a0f17131a5643f407c37/t/5bf9070c0ebbe88c3392b17c/1543047009836/facebook_button.png\"\u003e\n \u003c/a\u003e\n \u003ca href=\"https://www.youtube.com/c/codedecks?sub_confirmation=1\"\u003e\n \u003cimg align=\"right\" height=400 src=\"https://media.giphy.com/media/XeXtOVyYF961jhiPbt/giphy.gif\"\u003e\n \u003c/a\u003e\n \u003cp/\u003e\n\n\u003cimg src=\"https://sloc.xyz/github/codedecks-in/LeetCode-Solutions\" alt=\"LOC\"/\u003e \u003ca href=\"https://github.com/codedecks-in/LeetCode-Solutions/stargazers\"\u003e\u003cimg src=\"https://img.shields.io/github/stars/codedecks-in/LeetCode-Solutions\" alt=\"Stars Badge\"/\u003e\u003c/a\u003e\n\u003ca href=\"https://github.com/codedecks-in/LeetCode-Solutions/network/members\"\u003e\u003cimg src=\"https://img.shields.io/github/forks/codedecks-in/LeetCode-Solutions\" alt=\"Forks Badge\"/\u003e\u003c/a\u003e\n\u003ca href=\"https://github.com/codedecks-in/LeetCode-Solutions/graphs/contributors\"\u003e\u003cimg alt=\"GitHub contributors\" src=\"https://img.shields.io/github/contributors/codedecks-in/LeetCode-Solutions?color=2b9348\"\u003e\u003c/a\u003e\n\n\u003c!--[![GitHub issues by-label](https://img.shields.io/github/issues-pr-closed-raw/codedecks-in/LeetCode-Solutions.svg)](https://github.com/codedecks-in/LeetCode-Solutions/pulls?q=is%3Apr+is%3Aclosed)\n\n\u003c!--[![GitHub issues by-label](https://img.shields.io/github/issues-pr/codedecks-in/LeetCode-Solutions.svg)](https://github.com/codedecks-in/LeetCode-Solutions/pulls?q=is%3Aopen+is%3Apr)--\u003e\n\n---\n\n![Language](https://img.shields.io/badge/language-Python%20%2F%20Java%20%2F%20JS%20%2F%20C++-orange.svg)\u0026nbsp;\n[![License](https://img.shields.io/badge/license-MIT-blue.svg)](./LICENSE)\u0026nbsp;\n[![contributions welcome](https://img.shields.io/badge/contributions-welcome-brightgreen.svg?style=flat)](https://github.com/dwyl/esta/issues)\n[![Discord](https://img.shields.io/discord/463752820026376202.svg?label=\u0026logo=discord\u0026logoColor=ffffff\u0026color=7389D8\u0026labelColor=6A7EC2)](https://discord.gg/umYVGnvvAg)\n[![first-timers-only-friendly](http://img.shields.io/badge/first--timers--only-friendly-blue.svg?style=flat-square)](https://code.publiclab.org#r=all)\n\n\u003c!--[![Open Source Love](https://badges.frapsoft.com/os/v1/open-source.svg?v=103)](https://github.com/ellerbrock/open-source-badges/)\n\u003ca href=\"https://github.com/codedecks-in/LeetCode-Solutions/pulls\"\u003e\u003cimg src=\"https://img.shields.io/github/issues-pr/codedecks-in/LeetCode-Solutions\" alt=\"Pull Requests Badge\"/\u003e\u003c/a\u003e\n\u003ca href=\"https://github.com/codedecks-in/LeetCode-Solutions/issues\"\u003e\u003cimg src=\"https://img.shields.io/github/issues/codedecks-in/LeetCode-Solutions\" alt=\"Issues Badge\"/\u003e\u003c/a\u003e\n--\u003e\n\n### Got stuck in a LeetCode question? \n### This repository will help you by providing approach of solving the problems from LeetCode platform.\n\n### [Contributors](#contributors) helped us in providing these Awesome solutions.\n\n### If you want to contribute, please create a Pull Request. If you are new to Github please check pull request procedure ---\u003e [PR process](https://github.com/codedecks-in/LeetCode-Solutions/blob/master/PULL_REQUEST_PROCESS.md)\n\nCheck out ---\u003e [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pull/3)\n\n- There are new LeetCode questions every week. I'll keep updating for full summary and better solutions.\n- For more challenging problem solutions, you can also see our [HackerRank-Solutions](https://github.com/codedecks-in/HackerRank-Solutions), [ProjectEuler](https://github.com/codedecks-in/ProjectEuler-Solutions) repositories.\n- Hope you enjoy the journey of learning data structures and algorithms.\n- Notes: \"🔒\" means your subscription of [LeetCode premium membership](https://leetcode.com/subscribe/) is required for reading the question.\n\n### Don't forget to give us a 🌟 to support us.\n\n## Check out -\u003e [Learning Resources](#learning-resources)\n\n# Algorithms\n\n- [Bit Manipulation](#bit-manipulation)\n- [Array](#array)\n- [String](#string)\n- [Linked List](#linked-list)\n- [Stack](#stack)\n- [Queue](#queue)\n- [Heap](#heap)\n- [Tree](#tree)\n- [Hash Table](#hash-table)\n- [Math](#math)\n- [Two Pointers](#two-pointers)\n- [Sort](#sort)\n- [Recursion](#recursion)\n- [Binary Search](#binary-search)\n- [Binary Search Tree](#binary-search-tree)\n- [Breadth-First Search](#breadth-first-search)\n- [Depth-First Search](#depth-first-search)\n- [Backtracking](#backtracking)\n- [Dynamic Programming](#dynamic-programming)\n- [Greedy](#greedy)\n- [Graph](#graph)\n- [Geometry](#geometry)\n- [Simulation](#simulation)\n- [Design](#design)\n- [Concurrency](#concurrency)\n\n# Bit Manipulation\n\n| # | Title | Solution | Time | Space | Difficulty | Tag | Tutorial |\n| ---- | ------------------------------------------------------------------------------------- | -------------------------------------------------------------------------------------------------------------- | ------ | ------ | ---------- | --- | ---------------------------------------- |\n| 136 | [Single Number](https://leetcode.com/problems/single-number/) | [Java](./Java/single-number.java) \u003cbr\u003e [Python](./Python/single-number.py) \u003cbr\u003e [C++](./C++/Single-Number.cpp) \u003cbr\u003e [JavaScript](./JavaScript/single-number.js) | _O(n)_ | _O(1)_ | Easy | | Using XOR |\n| 137 | [Single Number II](https://leetcode.com/problems/single-number-ii/) | [Python](./Python/single-number-ii.py)\u003cbr/\u003e [C++](./C++/Single-Number-II.cpp) | _O(n)_ | _O(1)_ | Medium | | |\n| 260 | [Single Number III](https://leetcode.com/problems/single-number-iii/) | [Python](./Python/single-number-iii.py) \u003cbr/\u003e [C++](./C++/Single-Number-III.cpp) | _O(n)_ | _O(1)_ | Medium | | |\n| 371 | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/) | [Java](./Java/Sum_of_two_integers.java) | _O(1)_ | _O(1)_ | Medium | \n| 476 | [Number Complement](https://leetcode.com/problems/number-complement/) | [Java](./Java/number-complement.java) \u003cbr/\u003e [C++](./C++/Number-Complement.cpp) | _O(1)_ | _O(1)_ | Easy | | [Tutorial](https://youtu.be/6bp5V-O3zts) |\n| 520 | [Detect Capital Use](https://leetcode.com/problems/detect-capital/) | [Python](./Python/detect-capital.py) \u003cbr/\u003e [C++](./C++/Detect-Capital.cpp) | _O(n)_ | _O(1)_ | Easy | | |\n| 1486 | [XOR Operation in an Array](https://leetcode.com/problems/xor-operation-in-an-array/) | [Java](./Java/xor-op-in-array.java) \u003cbr/\u003e [C++](./C++/xor-operation-in-an-array.cpp) | _O(n)_ | _O(1)_ | Easy | | Using XOR |\n\n\u003cbr/\u003e\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#algorithms\"\u003e⬆️ Back to Top\u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n\n# Sort\n\n| # | Title | Solution | Time | Space | Difficulty | Tag | Tutorial |\n| --- | --------------------------------------------------------------------------------------- | ------------------------------------------- | ------ | ------ | ---------- | --- | -------- |\n| 973 | [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/) | [C++](./C++/k-closest-points-to-origin.cpp) | _O(n)_ | _O(1)_ | Medium | | |\n\n\u003cbr/\u003e\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#algorithms\"\u003e⬆️ Back to Top\u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n\n# Array\n\n| # | Title | Solution | Time | Space | Difficulty | Note | Video Explaination |\n| ------- | ----------------------------------------------------------------------------------------------------------------------------- | ----------------------------------------------------------------------------------------------------------------- | ------------ | ------------- | ---------- | ------------------ | ---------------------------------------- |\n| 118 | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) | [Java](./Java/PascalsTriangle118.java) | _O(N^2)_ | _O(N)_ | Easy | | |\n| 56 | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | [Python](./Python/56_MergeIntervals.py) | _O(nlogn)_ | _O(n)_ | Medium | Intervals | |\n| 268 | [Missing Number](https://leetcode.com/problems/missing-number) | [Java](./Java/missing-number.java) | _O(n)_ | _O(1)_ | Easy | Array | [Tutorial](https://youtu.be/VwvGEE_OGss) |\n| 697 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | [Java](./Java/Degree-of-an-Array.java) | _O(n)_ | _O(n)_ | Easy | Array | |\n| 1089 | [Duplicate Zeroes](https://leetcode.com/problems/duplicate-zeros/) | [JavaScript](./JavaScript/Duplicate-Zeroes.js) | _O(n)_ | _O(n)_ | Easy | Array | |\n| 1502 | [Can Make Arithmetic Progression From Sequence](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/) | [Java](./Java/can-make-arithmetic-progression-from-sequence.java) | _O(n)_ | _O(1)_ | Easy | Array | |\n| 122 | [Best Time to buy and sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | [Python](./Python/best-time-to-buy-and-sell-stock-ii.py) \u003cbr\u003e [C++](./C++/Best-Time-to-Buy-and-Sell-Stock-II.cpp) | _O(N)_ | _O(1)_ | Medium | Stocks | |\n| 119 | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii) | [Python](./Python/pascals-triangle-ii.py) | _O(N^2)_ | _O(K)_ | Easy | | |\n| 1480 | [Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/) | [Java](./Java/running-sum-of-1d-array.java) | _O(N)_ | _O(N)_ | Easy | Simple sum | |\n| 42 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | [Python](./Python/trapping_rain.py) | _O(N^2)_ | _O(N)_ | Hard | Array | |\n| 11 | [Container with Most Water](https://leetcode.com/problems/container-with-most-water/) | [Python](./Python/container_with_most_water.py) \u003cbr\u003e [C++](./C++/container-with-most-water.cpp) | _O(N)_ | _O(N)_ | Medium | Array Two Pointers | |\n| 1134 🔒 | [Armstrong Number](https://leetcode.com/problems/armstrong-number/) | [Java](./Java/Armstrong-Number.java) | _O(N)_ | _O(1)_ | Easy | | |\n| 1534 | [Count Good Triplets](https://leetcode.com/problems/count-good-triplets/) | [Python](./Python/count-good-triplets.py) | _O(N^3)_ | _O(1)_ | Easy | | |\n| 1572 | [Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/) | [Java](./Java/matrix-diagonal-sum.java) | _O(N)_ | _O(1)_ | Easy | | |\n| 811 | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/) | [Javascript](./JavaScript/Subdomain-Visit-Count.js) | _O(N\\*M)_ | _O(N\\*M + N)_ | Easy | | |\n| 53 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | [C++](./C++/maximum-subarray.cpp) | _O(N)_ | _O(1)_ | Easy | Array | |\n| 495 | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking) | [C++](./C++/teemo-attacking.cpp) | _O(n)_ | _O(1)_ | Medium | Array | |\n| 15 | [3 Sum](https://leetcode.com/problems/3sum/) | [Python](./Python/ThreeNumbersSum.py) | O( nLog(n) ) | O(1) | Medium | Array |\n| 1200 | [Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/) | [Python](./python/SmallestDifference.py) | O(n) | O(1) | Easy | Array |\n| 532 | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/) | [C++](./C++/k-diff-pairs-in-an-array.cpp) | O(n) | O(n) | Medium | Array |\n| 152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | [Javascript](./JavaScript/152.Maximum-Product-Subarray.js) | O(n) | O(n) | Medium | Array |\n| 073 | [Set-Matrix-Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | [Java](./Java/set-matrix-zeroes.java) | O(MN) | O(1) | Medium | Array |\n| 1288 | [Remove-Covered-Intervals](https://leetcode.com/problems/remove-covered-intervals) | [C++](./C++/Remove-Covered-Intervals.cpp) | O(N\\*N) | O(1) | Medium | Array |\n| 189 | [Rotate-Array](https://leetcode.com/problems/rotate-array/) | [Python](./Python/rotate-array.py) | O(N) | O(1) | Medium | Array |\n| 496 | [next-greater-element-i](https://leetcode.com/problems/next-greater-element-i) | [Python](./Python/496_nextgreaterelement.py) | O(N) | O(1) | Medium | Array |\n| 1470 | [Shuffle the Array](https://leetcode.com/problems/shuffle-the-array) | [Java](./Java/shuffle-the-array.java) | O(N) | O(1) | Easy | Array |\n| 124 | [Permutation by Recussion](https://leetcode.com/problems/permutations/) | [Java](./Java/shuffle-the-array.java) | O(N) | O(N) | Easy | Array |\n| 283 | [Move-Zeroes](https://leetcode.com/problems/move-zeroes/) | [C++](./C++/Move-Zeroes.cpp) | O(N) | O(1) | Easy | Array |\n| 27 | [Remove-Element](https://leetcode.com/problems/remove-element/) | [C++](./C++/remove-element.cpp) | O(N) | O(1) | Easy | Array |\n| 36 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) | [Java](./Java/valid-sudoku.java) | O(N^2) | O(N) | Medium | Array, 2D Matrix |\n| 1512 | [Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs/) | [Java](./Java/Number-of-Good-Pairs.java) | O(N^2) | O(1) | Easy | Array |\n| 162 | [Find Peak element](https://leetcode.com/problems/find-peak-element/) | [javascript](https://github.com/codedecks-in/LeetCode-Solutions/blob/master/JavaScript/findPeakElement.js) | o(Logn) | O(1) | Medium | Array |\n| 54 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | [C++](./C++/Spiral-matrix.cpp) | O(M\\*N) | O(M\\*N) | Medium | Array |\n| 238 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | [C++](./C++/238.Product_of_array_except_self) | O(N) | O(N) | Medium | Array |\n\n\n\u003cbr/\u003e\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#algorithms\"\u003e⬆️ Back to Top\u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n\n# String\n\n| # | Title | Solution | Time | Space | Difficulty | Tag | Note |\n| :--: | ----------------------------------------------------------------------------------------------------------------------------------------------- | -------------------------------------------------------------------------- | ------ | ------ | ---------- | --- | --------------- |\n| 3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [Python](./Python/Longest_Substring_Without_Repeating_Characters.py) | _O(n)_ | _O(n)_ | Medium | `Hash Table`\u003cbr/\u003e`Sliding Window` | Open for improvisation, mentioned time and space complexities unconfirmed |\n| 8 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/) | [Java](./Java/string-to-integer-atoi.java) | _O(n)_ | _O(1)_ | Medium | | |\n| 9 | [Palindrome Number](https://leetcode.com/problems/palindrome-number/) | [Java](./Java/palindrome-number.java) | _O(n)_ | _O(1)_ | Easy | | |\n| 151 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/) | [Java](./Java/reverse-words-in-a-string.java) | _O(1)_ | _O(n)_ | Medium | | |\n| 383 | [Ransom Note](https://leetcode.com/problems/ransom-note/) | [Java](./Java/ransom-note.java) | _O(1)_ | _O(n)_ | Easy | | Character Count |\n| 387 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | [Java](./Java/first-unique-character-in-a-string.java) | _O(n)_ | _O(1)_ | Easy | | Character Count |\n| 520 | [Detect Capital Use](https://leetcode.com/problems/detect-capital/) | [Java](./Java/detect-capital-use.java) | _O(n)_ | _O(1)_ | Easy | | |\n| 767 | [Reorganize String](https://leetcode.com/problems/reorganize-string/) | [Python](./Python/reorganize-string.py) | _O(n)_ | _O(n)_ | Medium | | |\n| 859 | [Buddy Strings](https://leetcode.com/problems/buddy-strings/) | [Java](./Java/buddy-strings.java) | _O(n)_ | _O(1)_ | Easy | | |\n| 1221 | [Split a String in Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings/) | [Python](./Python/split-a-string-in-balanced-strings.py) | _O(n)_ | _O(1)_ | Easy | | |\n| 1374 | [Generate a String With Characters That Have Odd Counts](https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts/) | [Java](./Java/generate-a-string-with-characters-that-have-odd-counts.java) | _O(n)_ | _O(1)_ | Easy | | |\n| 1614 | [Maximum Nesting Depth of the Parentheses](https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/) | [Java](./Java/max-nesting-depth-parentheses.java) | _O(n)_ | _O(1)_ | Easy | | |\n\u003cbr/\u003e\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#algorithms\"\u003e⬆️ Back to Top\u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n\n# Linked List\n\n| # | Title | Solution | Time | Space | Difficulty | Tag | Tutorial |\n| --- | --------------------------------------------------------------------------------------------------------------------- | ----------------------------------------------------------------------------------- | ---------- | ------ | ---------- | ------------------ | ---------------------------------------- |\n| 002 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | [Java](./Java/Add-Two-Numbers.java) | _O(n)_ | _O(n)_ | Medium | Math | |\n| 19 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | [Java](./Java/remove-nth-node-from-end-of-list.java) | _O(n)_ | _O(1)_ | Medium | Two pointers | |\n| 23 | [Merge K sorted lists](https://leetcode.com/problems/merge-k-sorted-lists/) | [C++](./C++/merge-k-sorted-lists.cpp) | _O(nlogn)_ | _O(n)_ | Hard | sorting and append | |\n| 109 | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/) | [Java](./Java/convert-sorted-list-to-binary-search-tree.java) | _O(n)_ | _O(n)_ | Medium | LinkedList | |\n| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | [Java](./Java/linked-list-cycle.java) | _O(n)_ | _O(1)_ | Easy | Slow-Fast Pointers | |\n| 142 | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/) | [Java](./Java/linked-list-cycle-ii.java) \u003cbr\u003e [C++](./C++/Linked-List-Cycle-II.cpp) | _O(n)_ | _O(1)_ | Medium | Slow-Fast Pointers | |\n| 146 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | [C++](./C++/LRU-Cache.cpp) \u003cbr\u003e [Python](./Python/LRUCache.py) | _O(1)_ | _O(k)_ | Medium | Hash Map | |\n| 160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | [Java](./Java/intersection-of-two-linked-lists.java) | _O(n)_ | _O(1)_ | Easy | Two Pointers | [Tutorial](https://youtu.be/uozGB0-gbvI) |\n| 186 | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/) | [Java](./Java/middle-of-the-linked-list.java) | _O(n)_ | _O(1)_ | Easy | Two pointers | \n| 143 | [Reorder List](https://leetcode.com/problems/reorder-list/) | [C++](./C++/143.Reorder_List.cpp) | _O(n)_ | _O(n)_ | Medium | Iteration and Stack |\n| 24 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) | [C++](./C++/Swap-nodes-in-pairs.cpp) | _O(n)_ | _O(1)_ | Medium | Two pointers |\n \n\n\u003cbr/\u003e\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#algorithms\"\u003e⬆️ Back to Top\u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n\n# Stack\n\n| # | Title | Solution | Time | Space | Difficulty | Tag | Note |\n| ---- | ------------------------------------------------------------------------------------------------------------------- | ----------------------------------------------------------- | ------ | ------ | ---------- | ---------------------- | ---- |\n| 020 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | [Python](./Python/20_ValidParentheses.py) [C++](./C++/Vlalid_Parentheses.cpp)[Java](./Java/20.ValidParentheses.java) | _O(n)_ | _O(n)_ | Easy | Stack | |\n| 084 | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/) | [C++](./C++/Largest-Rectangle-in-Histogram.cpp) | _O(n)_ | _O(n)_ | Hard | Stack |\n| 150 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) | [Python](./Python/150.EvaluateReversePolishNotation.py) \u003cbr\u003e [Java](./Java/evaluate_reverse_polish_notation.java) | _O(n)_ | _O(1)_ | Medium | Stack | |\n| 1047 | [Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/) | [C++](./C++/remove-all-adjacent-duplicates-in-string.cpp) | _O(n)_ | _O(n)_ | Easy | Stack | |\n| 682 | [Baseball Game](https://leetcode.com/problems/baseball-game/) | [C++](./C++/Baseball-Game.cpp) | _O(n)_ | _O(n)_ | Easy | Stack | |\n| 1381 | [Design a Stack With Increment Operation](https://leetcode.com/problems/design-a-stack-with-increment-operation/) | [Java](./Java/Design-a-Stack-With-Increment-Operation.java) | _O(n)_ | _O(n)_ | Medium | Stack | |\n| 1598 | [Crawler Log Folder](https://leetcode.com/problems/crawler-log-folder/) | [C++](./C++/Crawler-Log-Folder.cpp) | _O(n)_ | _O(n)_ | Easy | Stack |\n| 94 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | [Python](./Python/binary-tree-inorder-traversal.py) | _O(n)_ | _O(n)_ | Medium | Recursion, Binary Tree |\n| 735 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision/) | [C++](./C++/asteroid-collision.cpp) | _O(n)_ | _O(1)_ | Medium | Stack | |\n| 394 | [Decode String](https://leetcode.com/problems/decode-string/) | [C++](./C++/decode-string.cpp) | _O(n)_ | _O(1)_ | Medium | Stack | |\n| 921 | [Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/) | [C++](./C++/minimum-add-to-make-parentheses-valid.cpp) | _O(n)_ | _O(1)_ | Medium | Stack | |\n| 32 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) | [Python](.Python/longest-valid-parentheses.py) | _O(n)_ | _O(n)_ | Hard | Stack | |\n| 1249 | [Minimum Remove to Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/) | [C++](./C++/minimum-remove-to-make-valid-parentheses.cpp) | _O(n)_ | _O(n)_ | Medium | Stack | |\n\n\u003cbr/\u003e\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#algorithms\"\u003e⬆️ Back to Top\u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n\n# Queue\n\n| # | Title | Solution | Time | Space | Difficulty | Tag | Note |\n| --- | ------------------------------------------------------------------------------- | ------------------------------------------------ | ------ | ------ | ---------- | --------------------- | ---- |\n| 933 | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls/) | [C++](./C++/Number-of-Recent-Calls.cpp) | _O(1)_ | _O(1)_ | Easy | Queue, Sliding Window |\n| 641 | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque/) | [Java](./Java/design-circular-deque.java/) | _O(n)_ | _O(n)_ | Medium | Queue, Design |\n| 621 | [Task Scheduler ](https://leetcode.com/problems/task-scheduler/) | [Python](./Python/621-Task-Scheduler.py/) | _O(n)_ | _O(n)_ | Medium | Queue |\n| 622 | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue/) | [Python](./Python/622-Design-Circular-Queue.py/) | _O(n)_ | _O(n)_ | Medium | Queue |\n\n\u003cbr/\u003e\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#algorithms\"\u003e⬆️ Back to Top\u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n\n# Tree\n\n| # | Title | Solution | Time | Space | Difficulty | Tag | Note |\n| ---- | --------------------------------------------------------------------------------------------------------------- | ---------------------------------------------------------------------------------------------------------------- | ----------- | ----------- | ---------- | ---------------------------------------------- | ---- |\n| 094 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | [Java](./Java/binary-tree-inorder-traversal.java) \u003cbr\u003e [Python](./Python/Iterative-Inorder-tree-traversal) | _O(n)_ | _O(logn)_ | Medium | Binary Tree, Stack, HashTable | |\n| 100 | [Same Tree](https://leetcode.com/problems/same-tree/) | [Python](./Python/100.SymmetricTree.py)\u003cbr\u003e[Java](./Java/Same-Tree.java) | _O(n)_ | _O(n)_ | Easy | Tree, Depth-first Search | |\n| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) | [Java](./Java/symmetric-tree.java)\u003cbr\u003e[Python](./Python/101.SymmetricTree.py) | _O(n)_ | _O(n)_ | Easy | Tree, Breadth-first Search, Depth-first Search | |\n| 144 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/) | [Java](./Java/binary-tree-preorder-traversal.java) | _O(n)_ | _O(logn)_ | Medium | Binary Tree, Stack | |\n| 145 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/) | [Java](./Java/binary-tree-postorder-traversal.java) | _O(n)_ | _O(logn)_ | Hard | Binary Tree, Stack | |\n| 103 | [ZigZag Level Order](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/) | [JavaScript](./JavaScript/Binary-Tree-ZigZag-Traversal.js) \u003cbr\u003e [C++](./C++/binary-tree-preorder-traversal.java) | _O(n)_ | _O(n)_ | Medium | Binary Tree | |\n| 129 | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/) | [Java](./Java/sum-root-to-leaf-numbers.java) | _O(n)_ | _O(logn)_ | Medium | Binary Tree, Depth First Search | |\n| 307 | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/) | [Java](./Java/Range-Sum-Query-Mutable.java) | _O(logn)_ | _O(n)_ | Medium | Segment Tree | |\n| 919 | [Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter/) | [Java](./Java/complete-binary-tree-inserter.java) | _O(n)_ | _O(n)_ | Medium | Tree | |\n| 124 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | [C++](./C++/Binary-Tree-Maximum-Path-Sum.cpp) | _O(n)_ | _O(n)_ | Hard | Tree | |\n| 1028 | [Recover a Tree From Preorder Traversal](https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/) | [C++](./C++/Recover-a-Tree-From-Preorder-Traversal.cpp) | _O(n)_ | _O(n)_ | Hard | Tree | |\n| 968 | [Binary Tree Cameras](https://leetcode.com/problems/binary-tree-cameras/) | [C++](./C++/Binary-Tree-Cameras.cpp) | _O(n)_ | _O(logn)_ | Hard | Binary Tree, Dynamic Programming |\n| 98 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | [Javascript](./JavaScript/98.Validate-Binary-Search-Tree.js) | _O(log(n))_ | _O(log(n))_ | Medium | Binary Tree |\n| 684 | [Redundant Connection](https://leetcode.com/problems/redundant-connection/) | [Java](./Java/Redundant-Connection/redundant-connection.java) | _O(N)_ | _O(N)_ | Medium | Tree, Union Find |\n| 102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) |[C++](./C++/Binary-Tree-Level-Order-Traversal.cpp)| _O(n)_ | _O(n)_ | Medium | Binary Tree, map | |\n\n\u003cbr/\u003e\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#algorithms\"\u003e⬆️ Back to Top\u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n\n# Hash Table\n\n| # | Title | Solution | Time | Space | Difficulty | Tag | Video Explanation |\n| --- | ------------------------------------------------------------------------- | --------------------------------------------------------------------------------------------- | ----------- | ------ | ---------- | --- | ------------------------------------------------------- |\n| 001 | [Two Sum](https://leetcode.com/problems/two-sum/) | [Java](./Java/two-sum.java) \u003cbr\u003e [Python](./Python/1_TwoSum.py) \u003cbr\u003e [C++](./C++/two-sum.cpp) | _O(N)_ | _O(N)_ | Easy | | [Tutorial](https://youtu.be/47xMuvwP7zQ) |\n| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | [Java](./Java/valid-anagram.java) | _O(n)_ | _O(1)_ | Easy | | [Tutorial](https://www.youtube.com/watch?v=sbX1Ze9lNQE) |\n| 146 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | [Java](./Java/LRU-Cache.java) | | | Medium | | |\n| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [Python](./Python/contains-duplicate.py) | _O(n)_ | _O(n)_ | | |\n| 554 | [Brick Wall](https://leetcode.com/problems/brick-wall/) | [C++](./C++/brick-walls.cpp) | _O(n)_ | _O(n)_ | Medium | |\n| 049 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | [Python](./Python/group_anagram.py) | _O(nlogn)_ | _O(1)_ | Easy | |\n| 554 | [Brick Wall](https://leetcode.com/problems/brick-wall/) | [C++](./C++/brick-walls.cpp) | _O(n)_ | _O(n)_ | Medium | |\n| 146 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | [Javascript](../JavaScript/146.LRU-Cache.js) | _O(log(n))_ | _O(n)_ | Medium | |\n| 389 | [Find The Difference](https://leetcode.com/problems/find-the-difference/) | [C++](../C++/Find-The-Difference.cpp) | _O(n)_ | _O(1)_ | Easy | |\n\n\u003cbr/\u003e\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#algorithms\"\u003e⬆️ Back to Top\u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n\n# Two Pointers\n\n| # | Title | Solution | Time | Space | Difficulty | Tag | Note |\n| --- | --------------------------------------------------------------------------------------------- | ---------------------------------------------------------------------------------------------------------------------- | ---------------------- | ------------------ | ---------- | ----------- | ---------------- |\n| 005 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | [Python](./Python/5_LongestPalindromicSubstring.py) \u003cbr\u003e [JavaScript](./JavaScript/5.Longest-Palindromic-Substring.js) | _O(N^2)_ \u003cbr\u003e _O(N^2)_ | _O(N)_ \u003cbr\u003e _O(1)_ | Medium | | Expand the Wings |\n| 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [Java](./Java/median-of-two-sorted-arrays.java) | _O(log(min(m,n)))_ | _O(1)_ | Hard | | |\n| 845 | [Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array/) | [C++](./C++/Longest-Mountain-in-Array.cpp) | _O(N)_ | _O(1)_ | Medium | Two Pointer |\n| 015 | [3 Sum](https://leetcode.com/problems/3sum/) | [C++](./C++/3sum.cpp) | _O(N)_ | _O(1)_ | Medium | Two Pointer | |\n| 021 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | [C++](./C++/Longest-Mountain-in-Array.cpp) | _O(N)_ | _O(1)_ | Easy | Two Pointer | |\n\n\n\u003cbr/\u003e\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#algorithms\"\u003e⬆️ Back to Top\u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n\n# Math\n\n| # | Title | Solution | Time | Space | Difficulty | Tag | Note |\n| --- | ------------------------------------------------------------------------------------- | -------------------------------------------------------------------------- | ----------------- | ------ | ---------- | ------ | ------------- |\n| 050 | [Pow(x, n)](https://leetcode.com/problems/powx-n/) | [Python](./Python/50.Powxn.py) \u003cbr\u003e [JavaScript](./JavaScript/50.Powxn.js) | _O(n)_ | _O(1)_ | Medium | Math | |\n| 204 | [Count Primes](https://leetcode.com/problems/count-primes) | [C++](./C++/Count-Primes.cpp) | _O(n(log(logn)))_ | _O(n)_ | Easy | Math | |\n| 171 | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/) | [C++](./C++/Excel-Sheet-Column-Number.cpp) | _O(n)_ | _O(1)_ | Easy | String | |\n| 168 | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) | [C++](./C++/Excel-Sheet-Column-Title.cpp) | _O(n)_ | _O(n)_ | Easy | String | |\n| 007 | [Reverse Integer](https://leetcode.com/problems/reverse-integer) | [Java](./Java/reverse-integer.java) \u003cbr\u003e [C++](./C++/Reverse-Integer.cpp) | _O(n)_ | _O(n)_ | Easy | Math | |\n| 202 | [Happy Number](https://leetcode.com/problems/happy-number) | [Java](./Java/Happy-Number.java) | _O(n^2)_ | _O(n)_ | Easy | Math | |\n| 326 | [Power of Three](https://leetcode.com/problems/power-of-three) | [Java](./Java/Power-of-Three.java) | _O(logn)_ | _O(n)_ | Easy | Math | |\n| 12 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman) | [Java](./Java/integer-to-roman.java) | _O(n)_ | _O(1)_ | Medium | Math | |\n| 13 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | [Java](./Java/roman-to-integer.java) \u003cbr\u003e [C++](./C++/Roman_to_Integer.cpp)| _O(n)_ | _O(1)_ | Easy | Math | | \n| 14 | [Arithmetic Subarrays](https://leetcode.com/problems/arithmetic-subarrays/) | [Java](./Java/Arithmetic-Subarrays.java) | _O(m\\*n)_ | _O(n)_ | Medium | Math | Pattern Count |\n| 263 | [Ugly Number](https://leetcode.com/problems/ugly-number/) | [Java](./Java/Ugly-Number.java) | _O(n)_ | _O(n)_ | Easy | Math | |\n| 412 | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz/) | [Java](./Java/FizzBuzz.java) | _O(n)_ | _O(n)_ | Easy | Math | |\n| 1518 | [Water Bottles](https://leetcode.com/problems/water-bottles/) | [Java](./Java/WaterBottles.java) | _O(n)_ | _O(n)_ | Easy | Math | |\n| 1822 | [Sign Of Product](https://leetcode.com/problems/sign-of-the-product-of-an-array/) | [Java](./Java/SignOf.java) | _O(n)_ | _O(n)_ | Easy | Math | |\n| 991 | [Broken Calculator](https://leetcode.com/problems/broken-calculator/) | [Java](./Java/BrokenCalculator.java) | _O(n)_ | _O(n)_ | Medium | Math | |\n| 1837 | [Sum of Digits in Base K](https://leetcode.com/problems/sum-of-digits-in-base-k/) | [Python](./Python/baseK.py) | _O(n)_ | _O(1)_ | Easy | Math | |\n\n\u003cbr/\u003e\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#algorithms\"\u003e⬆️ Back to Top\u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n\n# Breadth-First Search\n\n| # | Title | Solution | Time | Space | Difficulty | Tag | Note |\n| ---- | ----------------------------------------------------------------------------------------------------------------------------------------------------------------- | -------------------------------------------------------------------------------- | ------------------------- | ----------------- | ---------- | --- | ---- |\n| 1284 | [Minimum Number of Flips to Convert Binary Matrix to Zero Matrix](https://leetcode.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/) | [C++](./C++/Minimum-Number-of-Flips-to-Convert-Binary-Matrix-to-Zero-Matrix.cpp) | _O(m * n * 2 ^ (m \\* n))_ | _O(2 ^ (m \\* n))_ | Hard | BFS | |\n| 200 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | [Java](./Java/NumberOfIslands.java) | O(R \\* C) | O(R \\* C) | Medium | BFS |\n| 127 | [Word Ladder](https://leetcode.com/problems/word-ladder/) | [Java](./Java/word-ladder.java) | O(N^2 \\* M) | O(N \\* M) | Medium | BFS |\n| 994 | [Rotten Oranges](https://leetcode.com/problems/rotting-oranges/) | [Python](./Python/994_Rotting_Oranges.py) | O(N \\* M) | O(N \\* M) | Medium | BFS |\n| 743 | [Network Delay Time](https://leetcode.com/problems/network-delay-time/) | [C++](./C++/Network-delay-time.cpp) | _O(V+E))_ | O(V) | Medium | BFS |\n| 111 | [Min Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/) | [JavaScript](./JavaScript/111-minimum-depth-of-binary-tree.js) | O(nlogn) | O(nlogn) | Easy | BFS |\n| 100 | [Same Tree](https://leetcode.com/problems/same-tree/) | [C++](https://github.com/codedecks-in/LeetCode-Solutions/blob/master/C%2B%2B/100_Same_Tree.cpp) | O(N) | O(N) | Easy | BFS | \n \n \n\u003cbr/\u003e\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#algorithms\"\u003e⬆️ Back to Top\u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n\n# Depth-First Search\n\n| # | Title | Solution | Time | Space | Difficulty | Tag | Note |\n| ---- | ---------------------------------------------------------------------------------------------------------- | -------------------------------------------------- | ----------- | ----------- | ---------- | --- | ---- |\n| 1463 | [Cherry Pickup II](https://leetcode.com/problems/cherry-pickup-ii/) | [C++](./C++/Cherry-Pickup-II.cpp) | _O(n \\* m)_ | _O(n \\* m)_ | Hard | DFS | |\n| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | [python](./Python/maximum-depth-of-binary-tree.py) | _O(n)_ | _O(n)_ | Easy | DFS | |\n| 112 | [Path Sum](https://leetcode.com/problems/path-sum/) | [Java](./Java/path-sum.java) | _O(n)_ | _O(n)_ | Easy | DFS | |\n| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | [Java](./Java/Balanced-Binary-Tree.java) | _O(n)_ | _O(n)_ | Easy | DFS | |\n| 1376 | [ Time Needed to Inform All Employees](https://leetcode.com/problems/time-needed-to-inform-all-employees/) | [C++](./C++/Cherry-Pickup-II.cpp) | _O(n)_ | _O(n)_ | Medium | DFS | |\n| 200 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | [C++](./C++/number-of-islands.cpp) | _O(m * n)_ | _O(m * n)_ | Medium | DFS | |\n\n\u003cbr/\u003e\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#algorithms\"\u003e⬆️ Back to Top\u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n\n# BackTracking\n\n| # | Title | Solution | Time | Space | Difficulty | Tag | Note |\n| --- | ------------------------------------------------------------------- | --------------------------------- | ------------------------- | ----------- | ---------- | ------------------- | ---- |\n| 037 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver/) | [C++](./C++/Sudoku-Solver.cpp) | _O(n^2)_ | _O(1)_ | Hard | Hash Table | |\n| 980 | [Unique Paths III](https://leetcode.com/problems/unique-paths-iii/) | [C++](./C++/Unique-Paths-III.cpp) | _O(R * C * 2 ^ (R \\* C))_ | _O(R \\* C)_ | Hard | DFS, Memoization | |\n| 39 | [Combination Sum](https://leetcode.com/problems/combination-sum/) | [C++](./C++/combination-sum.cpp) | _O(2^n)_ | _O(n)_ | Medium | Array, Backtracking | |\n| 17 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | [C++](./C++/letter-combinations-of-a-phone-number.cpp) | _O(4^n)_ | _O(n)_ | Medium | String, Hash Table, Backtracking | |\n\n\u003cbr/\u003e\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#algorithms\"\u003e⬆️ Back to Top\u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n\n# Dynamic Programming\n\n| # | Title | Solution | Time | Space | Difficulty | Tag | Note |\n| ---- | ------------------------------------------------------------------------------------------------------------------- | --------------------------------------------------------- | --------- | --------- | ---------- | -------------------- | ---- |\n| 416 | [ Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/) | [C++](./C++/Partition-Equal-Subset-Sum.cpp) | _O(n^2)_ | _O(n^2)_ | Medium | DP | |\n| 056 | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching/) | [Python](./Python/wildcard-matching.py) | _O(n^2)_ | _O(n^2)_ | Hard | |\n| 343 | [Integer Break](https://leetcode.com/problems/integer-break/) | [C++](./C++/Integer-Break.cpp) | _O(n^2)_ | _O(n)_ | Medium | |\n| 139 | [Word Break](https://leetcode.com/problems/word-break/) | [Python](./Python/word-break-1.py) | _O(n^3)_ | _O(n)_ | Medium | DP | |\n| 1092 | [Shortest Common Supersequence](https://leetcode.com/problems/shortest-common-supersequence/) | [C++](./C++/Shortest-Common-Supersequence.cpp) | _O(n^2)_ | _O(n^2)_ | Hard | DP | |\n| 72 | [Edit Distance](https://leetcode.com/problems/edit-distance/) | [Python](./Python/edit-distance.py) | _O(N\\*M)_ | _O(n^2)_ | Medium | Levenshtein Distance | |\n| 91 | [Decode ways](https://leetcode.com/problems/decode-ways/) | [Python](./Python/decode-ways.py) | _O(N)_ | _O(N)_ | Easy | DP | |\n| 1025 | [Divisor Game](https://leetcode.com/problems/divisor-game/) | [Python](./Python/divisor-game.py) | _O(N^2)_ | _O(N)_ | Easy | DP | |\n| 174 | [Dungeon Game](https://leetcode.com/problems/dungeon-game/) | [C++](./C++/dungeon-game.pp) | _O(M\\*N)_ | _O(M\\*N)_ | Hard | Dynamic Programming | |\n| 070 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | [Java](./Java/climbing-stairs.java) | _O(N)_ | _O(1)_ | Easy | DP | |\n| 730 | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences/) | [C++](./C++/Count-Different-Palindromic-Subsequences.cpp) | _O(N\\*N)_ | _O(N\\*N)_ | Hard | DP | |\n| 55 | [Jump Game](https://leetcode.com/problems/jump-game/) | [Python](./Python/jumpGame.py) | _O(N)_ | _O(N)_ | Medium | DP | |\n\n\u003cbr/\u003e\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#algorithms\"\u003e⬆️ Back to Top\u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n\n# Binary Search\n\n| # | Title | Solution | Time | Space | Difficulty | Tag | Note |\n| --- | ----------------------------------------------------------------------------------------------------------- | ------------------------------------------------------------------------------------------------------------------------- | --------- | ------ | ---------- | --- | ------------- |\n| 035 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | [Python](./Python/35.SearchInsertPosition.py) | _O(logn)_ | _O(1)_ | Easy | | Binary Search |\n| 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version/) | [Java](./Java/May-LeetCoding-Challenge/Day-1-First-Bad-Version.java) \u003cbr\u003e [JavaScript](./JavaScript/First-Bad-Version.js) | _O(logn)_ | _O(1)_ | Easy | | Binary Search |\n| 033 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [Python](./Python/search-in-rotated-sorted-array.py) | _O(logn)_ | _O(1)_ | Medium | | Binary Search |\n| 153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | [Python](./Python/find-minimum-in-rotated-sorted-array.py) | _O(logn)_ | _O(1)_ | Medium | | Binary Search |\n| 704 | [Binary Search](https://leetcode.com/problems/binary-search/) | [C++](./C++/BinarySearch.cpp) | _O(logn)_ | _O(1)_ | Easy | | Binary Search |\n\n\u003cbr/\u003e\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#algorithms\"\u003e⬆️ Back to Top\u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n\n# Graph\n\n| # | Title | Solution | Time | Space | Difficulty | Tag | Note |\n| ---- | ------------------------------------------------------------------------------------------------------------------------- | ------------------------------------------------------------ | --------------- | --------- | ---------- | ----- | --------------------------------- |\n| 207 | [Course Schedule](https://leetcode.com/problems/course-schedule/) | [C++](./C++/Course-Schedule.cpp) | _O(V+E)_ | _O(V+E)_ | Medium | Graph | Cycle Detection in Directed Graph |\n| 1042 | [Flower Planting with No Adjacent](https://leetcode.com/problems/flower-planting-with-no-adjacent/) | [Python](./Python/1042_FlowerPlantingwithNoAdjacent.py) | _O(V+E)_ | _O(2V+E)_ | Medium | Graph | Graph Coloring |\n| 797 | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target/) | [Java](./Java/All_Paths_From_Source_to_Target.java) | _O(N^2)_ | _O(N)_ | Medium | Graph | DFS |\n| 934 | [Shortest Bridge](https://leetcode.com/problems/shortest-bridge/) | [C++](./C++/Shortest-Bridge.cpp) | _O(V)_ | _O(V)_ | Medium | Graph | DFS + BFS |\n| 1192 | [Critical Connections in a Network](https://leetcode.com/problems/critical-connections-in-a-network/) | [C++](./C++/Critical-Connections-in-a-Network.cpp) | _O(V+E)_ | _O(4V+E)_ | Hard | Graph | Tarjan's Algorithm |\n| 113 | [Path Sum II](https://leetcode.com/problems/path-sum-ii/) | [C++](./C++/Critical-Path-Sum-II.cpp) | _O(V+E)_ | _O(V)_ | Medium | Graph | DFS |\n| 785 | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite/) | [C++](./C++/Is-Graph-Bipartite.cpp) | _O(V+E)_ | _O(V)_ | Medium | Graph | BFS |\n| 947 | [Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/) | [C++](./C++/Most-Stones-Removed-with-Same-Row-or-Column.cpp) | _O(V)_ | _O(2V)_ | Medium | Graph | Union Find | | [C++](./C++/Most-Stones-Removed-with-Same-Row-or-Column.cpp) | _O(V)_ | _O(2V)_ | Medium | Graph | Union Find |\n| 210 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | [C++](./C++/Course-Schedule-II.cpp) | _O(V+E)_ | _O(V)_ | Medium | Graph | BFS |\n| 1627 | [Graph Connectivity with Threshold](https://leetcode.com/problems/graph-connectivity-with-threshold/) | [Java](./Java/graph_connectivity_with_threshold.java) | _O(V.logV + Q)_ | _O(V)_ | Hard | Graph | Union Find + Sieve |\n| 1631 | [Path with Minimum Effort](https://leetcode.com/problems/path-with-minimum-effort/) | [Java](./Java/path-with-minimum-effort.java) | _O(V^2)_ | _O(V)_ | Medium | Graph | Dijkstra's Shortest Path |\n\n\u003cbr/\u003e\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#algorithms\"\u003e⬆️ Back to Top\u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n\n# Learning Resources\n\n\u003ca target=\"_blank\" href=\"https://www.amazon.in/gp/search?ie=UTF8\u0026tag=codedecks0d-21\u0026linkCode=ur2\u0026linkId=ad5e11b5c15f960da1985687dfcec2e8\u0026camp=3638\u0026creative=24630\u0026index=books\u0026keywords=java, data structures, algorithms, system design\"\u003ecodedecks\u003c/a\u003e\u003cimg src=\"//ir-in.amazon-adsystem.com/e/ir?t=codedecks0d-21\u0026l=ur2\u0026o=31\" width=\"1\" height=\"1\" border=\"0\" alt=\"\" style=\"border:none !important; margin:0px !important;\"/\u003e\n\n1.) [Cracking the Coding Interview (Indian Edition)](https://amzn.to/2H0dHy6)\n\n2.) [Data Structures and Algorithms Made Easy in Java](https://amzn.to/33YqWbT)\n\n3.) [Data Structure and Algorithmic Thinking with Python](https://amzn.to/3lz22p4)\n\n4.) [Head First Design Patterns](https://amzn.to/37426Jk)\n\n5.) [Dynamic Programming for Coding Interviews](https://amzn.to/3jVSPqu)\n\nDISCLAIMER: This above mentioned resources have affiliate links, which means if you buy one of the product from my links, I’ll receive a small commission. This helps support the channel and allows us to continue to add more tutorial. Thank you for the support!\n\n\u003cbr/\u003e\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#algorithms\"\u003e⬆️ Back to Top\u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n\n## Authors\n\n- | [Gourav Rusiya](https://github.com/GouravRusiya30/) \u003cbr\u003e \u003cimg src=\"https://github.com/GouravRusiya30.png\" width=\"100\" height=\"100\"\u003e\n\n\u003cbr\u003e\n\n## Contributors\n\n| Name | Country | Programming Language | Where to find you\u003cbr\u003e\u003csup\u003e(add all links to your profiles eg on Hackerrank, Codechef, LeetCode...)\u003c/sup\u003e |\n| -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | -------------- | -------------------- | --------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |\n| [Gourav R](https://github.com/GouravRusiya30/) \u003cbr\u003e \u003cimg src=\"https://github.com/GouravRusiya30.png\" width=\"100\" height=\"100\"\u003e | India | Java | [codedecks](https://www.youtube.com/c/codedecks/) \u003cbr\u003e [Hackerrank](https://www.hackerrank.com/gouravrusiya786) \u003cbr\u003e [LeetCode](https://leetcode.com/rusiya/) |\n| [Dima Vishnevetsky](https://github.com/dimshik100) \u003cbr\u003e \u003cimg src=\"https://github.com/dimshik100.png\" width=\"100\" height=\"100\"\u003e | Israel | JavaScript | [Twitter](https://twitter.com/dimshik100) \u003cbr\u003e [Facebook](https://www.facebook.com/dimshik) |\n| [Anuj Sharma](https://github.com/Optider/) \u003cbr\u003e \u003cimg src=\"https://github.com/Optider.png\" width=\"100\" height=\"100\"\u003e | India | Python | [Github](https://github.com/Optider) |\n| [Lokendra Bohra](https://github.com/lokendra1704/) \u003cbr\u003e \u003cimg src=\"https://github.com/lokendra1704.png\" width=\"100\" height=\"100\"\u003e | India | Python | [Leetcode](https://t.co/u0OByxhcHA) \u003cbr\u003e [Hackerrank](https://www.hackerrank.com/lokendra17) |\n| [Yuri Spiridonov](https://github.com/YuriSpiridonov) \u003cbr\u003e \u003cimg src=\"https://github.com/YuriSpiridonov.png\" width=\"100\" height=\"100\"\u003e | Russia | Python | [Twitter](https://twitter.com/YuriSpiridonov)\u003cbr\u003e[Leetcode](https://leetcode.com/yurispiridonov/)\u003cbr\u003e[Hackerrank](https://www.hackerrank.com/YuriSpiridonov) |\n| [Naveen Kashyap](https://github.com/naveenkash) \u003cbr\u003e \u003cimg src=\"https://github.com/naveenkash.png\" width=\"100\" height=\"100\"\u003e | India | Javascript | [Twitter](https://twitter.com/naveen_kashyapp)\u003cbr\u003e[Leetcode](https://leetcode.com/naveenkash/) |\n| [Rudra Mishra](https://github.com/Rudra407) \u003cbr\u003e \u003cimg src=\"https://github.com/Rudra407.png\" width=\"100\" height=\"100\"\u003e | India | C++ | [Twitter](https://twitter.com/ruDra_Mishra407)\u003cbr\u003e[Leetcode](https://leetcode.com/rudramishra/) |\n| [Sachin Singh Negi](https://github.com/sachinnegi) \u003cbr\u003e \u003cimg src=\"https://github.com/sachinnegi.png\" width=\"100\" height=\"100\"\u003e | India | Python | [Twitter](https://twitter.com/SachinSinghNe17)\u003cbr\u003e[Leetcode](https://leetcode.com/negisachin688/)\u003cbr\u003e[Hackerrrak](https://www.hackerrank.com/negisachin688) |\n| [Girish Thatte](https://github.com/girishgr8/) \u003cbr\u003e \u003cimg src=\"https://github.com/girishgr8.png\" width=\"100\" height=\"100\"\u003e | India | Java | [Leetcode](https://leetcode.com/girish13/) \u003cbr\u003e [Hackerrank](https://www.hackerrank.com/procoder_13) \u003cbr\u003e [Codechef](https://www.codechef.com/procoder_13) |\n| [Kevin Chittilapilly](https://github.com/KevinChittilapilly) \u003cbr\u003e \u003cimg src=\"https://github.com/KevinChittilapilly.png\" width=\"100\" height=\"100\"\u003e | India | Java | [Leetcode](https://leetcode.com/being_kevin/) \u003cbr\u003e [Hackerrank](https://www.hackerrank.com/ckevinvarghese11) \u003cbr\u003e [Kaggle](https://www.kaggle.com/kevinchittilapilly) |\n| [Nour Grati](https://github.com/Nour-Grati) \u003cbr\u003e \u003cimg src=\"https://github.com/Nour-Grati.png\" width=\"100\" height=\"100\"\u003e | Tunisia | Python | [Leetcode](https://leetcode.com/nourgrati/) \u003cbr\u003e [Hackerrank](https://www.hackerrank.com/noor_grati) \u003cbr\u003e [Twitter](https://twitter.com/GratiNour1) |\n| [Avinash Trivedi](https://github.com/trivediavinash) \u003cbr\u003e \u003cimg src=\"https://github.com/trivediavinash.png\" width=\"100\" height=\"100\"\u003e | India | C++ | [Leetcode](https://leetcode.com/avi_002/) |\n| [Ishika Goel](https://github.com/ishikagoel5628) \u003cbr\u003e \u003cimg src=\"https://github.com/Nour-Grati.png\" width=\"100\" height=\"100\"\u003e | India | C++ | [Leetcode](https://leetcode.com/ishikagoel5628/) |\n| [Fenil Dobariya](https://github.com/ifenil) \u003cbr\u003e \u003cimg src=\"https://rb.gy/iascx3\" width=\"100\" height=\"100\"\u003e | India | Java | [Github](https://github.com/ifenil) |\n| [Prashansa Tanwar](https://github.com/prashansatanwar) \u003cbr\u003e \u003cimg src=\"https://github.com/prashansatanwar.png\" width=\"100\" height=\"100\"\u003e | India | C++ | [Leetcode](https://leetcode.com/prashansaaa/) |\n| [Ishu Raj](https://github.com/ir2010) \u003cbr\u003e \u003cimg src=\"https://github.com/ir2010.png\" width=\"100\" height=\"100\"\u003e | India | C++ | [Leetcode](https://leetcode.com/ishuraj2010/) |\n| [Rakesh Bhadhavath](https://github.com/Revenge-Rakesh) \u003cbr\u003e \u003cimg src=\"https://avatars2.githubusercontent.com/u/36032275?v=4\" width=\"100\" height=\"100\"\u003e | India | Java | [Leetcode](https://leetcode.com/goal_cracker/) |\n| [Tarun Singh](https://github.com/TarunSingh56) \u003cbr\u003e \u003cimg src=\"https://avatars3.githubusercontent.com/u/25122604?s=400\u0026u=d01f190e9a8c3790d408c38387c68b6bc9db2ea6\u0026v=4\" width=\"100\" height=\"100\"\u003e | India | C++ | [Leetcode](https://leetcode.com/_tarun/) |\n| [Hardik Gupta](https://github.com/harrdy272) \u003cbr\u003e \u003cimg src=\"https://avatars3.githubusercontent.com/u/42604986?s=460\u0026u=609a0839312a620d3d658ef19e8eac1e226a6eb4\u0026v=4\" width=\"100\" height=\"100\"\u003e | India | C++ | [codeforces](https://codeforces.com/profile/harrdy272) \u003cbr\u003e[codechef](https://www.codechef.com/users/hardikg272) \u003cbr\u003e [Hackerrank](https://www.hackerrank.com/hardikg272) \u003cbr\u003e [LeetCode](https://leetcode.com/hardikg272/) |\n| [Jaseem ck](https://github.com/Jaseemck) \u003cbr\u003e \u003cimg src=\"https://github.com/Optider.png\" width=\"100\" height=\"100\"\u003e | India | Python | [Github](https://github.com/Jaseemck) |\n| [Ilias Khan](https://github.com/IliasKhan) \u003cbr\u003e \u003cimg src=\"https://avatars3.githubusercontent.com/u/26863936?s=460\u0026u=4501ffba5efd1a7b978416e8e434dff599c85384\u0026v=4\" width=\"100\" height=\"100\"\u003e | India | C++ | [codechef](https://www.codechef.com/users/iliaskhan) \u003cbr\u003e [Hackerrank](ckerrank.com/iliaskhan57) \u003cbr\u003e [LeetCode](https://leetcode.com/ilias_khan/) \u003cbr\u003e [codeforces](http://codeforces.com/profile/iliaskhan) |\n| [Shamoyeeta Saha](https://github.com/Shamoyeeta) \u003cbr\u003e \u003cimg src=\"https://i.pinimg.com/236x/dc/ef/3a/dcef3abedf0e0761203aaeb85886a6f3--jedi-knight-open-source.jpg\" width=\"100\" height=\"100\"\u003e | India | C++ | [Hackerrank](https://www.hackerrank.com/sahashamoyeeta) \u003cbr\u003e [Github](https://github.com/Shamoyeeta) |\n| [James Y](https://github.com/jameszu) \u003cbr\u003e \u003cimg src=\"https://avatars0.githubusercontent.com/u/41566813?s=400\u0026u=af77d15517566ea590a316030b4a6d402b0041b6\u0026v=4\" width=\"100\" height=\"100\"\u003e | New Zealand | python | [Github](https://github.com/jameszu) |\n| [Hamza B](https://github.com/9Hamza) \u003cbr\u003e \u003cimg src=\"https://avatars2.githubusercontent.com/u/56516922?s=400\u0026u=2c1adeef0194a2859361d464f28783bfba698638\u0026v=4\" width=\"100\" height=\"100\"\u003e | Saudi Arabia | Java | [Github](https://github.com/9Hamza) |\n| [Meli Haktas](https://github.com/MercerFrey) \u003cbr\u003e \u003cimg src=\"https://avatars1.githubusercontent.com/u/29127873?s=460\u0026u=149319db4468ec2316e49a75eb5e05b35eb05eef\u0026v=4\" width=\"100\" height=\"100\"\u003e | Turkey | python | [Github](https://github.com/MercerFrey) |\n| [Saurav Prateek](https://github.com/SauravP97) \u003cbr\u003e \u003cimg src=\"https://avatars3.githubusercontent.com/u/26816418?s=460\u0026u=4b5222d5b6db79389efba062714c9dfba263732f\u0026v=4\" width=\"100\" height=\"100\"\u003e | India | Java | [Github](https://github.com/SauravP97) \u003cbr\u003e [Codechef](https://www.codechef.com/users/srvptk) \u003cbr\u003e [Codeforces](https://codeforces.com/profile/srvptk97) \u003cbr\u003e [Leetcode](https://leetcode.com/srvptk97) |\n| [Anushka Verma](https://github.com/verma-anushka) \u003cbr\u003e \u003cimg src=\"https://avatars0.githubusercontent.com/u/46157435?s=400\u0026u=aa3db9cf25b4a9644a16607d0c8bd6c98763a62d\u0026v=4\" width=\"100\" height=\"100\"\u003e | India | C++ | [Portfolio](https://verma-anushka.github.io/anushkaverma/) \u003cbr\u003e [LeetCode](https://leetcode.com/anushka_verma/) |\n| [James H](https://github.com/HoangJames) \u003cbr\u003e \u003cimg src=\"https://avatars2.githubusercontent.com/u/15057250?s=460\u0026v=4\" width=\"100\" height=\"100\"\u003e | United Kingdom | C++ | [Github](https://github.com/HoangJames) |\n| [Franchis N. Saikia](https://github.com/Francode007) \u003cbr\u003e \u003cimg src=\"https://avatars0.githubusercontent.com/u/63102937?s=400\u0026v=4\" width=\"100\" height=\"100\"\u003e | India | C++ | [Github](https://github.com/Francode007) |\n| [Yarncha](https://github.com/yarncha) \u003cbr\u003e \u003cimg src=\"https://avatars0.githubusercontent.com/u/33623182?s=400\u0026v=4\" width=\"100\" height=\"100\"\u003e | South Korea | C++ | [LeetCode](https://leetcode.com/yamcha/) |\n| [Gamez0](https://github.com/Gamez0) \u003cbr\u003e \u003cimg src=\"https://avatars3.githubusercontent.com/u/34051876?s=400\u0026v=4\" width=\"100\" height=\"100\"\u003e | South Korea | Python | [LeetCode](https://leetcode.com/Gamez0/) |\n| [JeongDaHyeon](https://github.com/JeongDaHyeon) \u003cbr\u003e \u003cimg src=\"https://avatars0.githubusercontent.com/u/48541114?s=460\u0026v=4\" width=\"100\" height=\"100\"\u003e | South Korea | Java | [GitHub](https://github.com/JeongDaHyeon) |\n| [Aysia](https://www.linkedin.com/in/aysiaelise/) \u003cbr\u003e \u003cimg src=\"https://avatars.githubusercontent.com/u/70167431?s=460\u0026u=1637be8636b6db6e35343ed9c1318c23e909b463\u0026v=4\" width=\"100\" height=\"100\"\u003e | USA | JavaScript | [GitHub](https://github.com/aysiae) |\n| [Poorvi Garg](https://github.com/POORVI111) \u003cbr\u003e \u003cimg src=\"https://avatars.githubusercontent.com/u/68559217?s=400\u0026v=4\" width=\"100\" height=\"100\"\u003e | India | C++ | [GitHub](https://github.com/POORVI111) |\n| [Lakshmanan Meiyappan](https://laxmena.com) \u003cbr\u003e \u003cimg src=\"https://avatars.githubusercontent.com/u/12819059?s=400\u0026v=4\" width=\"100\" height=\"100\"\u003e | India | C++ | [Website - Blog](https://laxmena.com)\u003cbr/\u003e [GitHub](https://github.com/laxmena) \u003cbr/\u003e [LinekdIn](https://www.linkedin.com/in/lakshmanan-meiyappan/) |\n| [Sachin_Upadhyay](https://github.com/sachsbu) \u003cbr\u003e \u003cimg src=\"https://avatars.githubusercontent.com/u/24941685?v=4\" width=\"100\" height=\"100\"\u003e | India | Java | [GitHub](https://github.com/sachsbu) \n| [Amisha Sahu](https://github.com/Amisha328) \u003cbr\u003e \u003cimg src = \"https://avatars.githubusercontent.com/u/58816552?v=4\" width=\"100\" height=\"100\"\u003e | India | C++ | [CodeChef](https://www.codechef.com/users/amisha328)\u003cbr/\u003e[LeetCode](https://leetcode.com/Mishi328/)\u003cbr/\u003e[HackerRank](https://www.hackerrank.com/amishasahu328)\n| [Shrimadh V Rao](https://github.com/Shrimadh) \u003cbr\u003e \u003cimg src=\"https://avatars.githubusercontent.com/u/64469917?v=4\" width=\"100\" height=\"100\"\u003e | India | C++ | [GitHub](https://github.com/Shrimadh)\n| [Shreyas Shrawage](https://github.com/shreyventure) \u003cbr\u003e \u003cimg src = \"https://avatars.githubusercontent.com/u/55741087?v=4\" width=\"100\" height=\"100\"\u003e | India | Python | [CodeChef](https://www.codechef.com/users/shreyventure)\u003cbr/\u003e[LeetCode](https://leetcode.com/shreyventure/)\u003cbr/\u003e[HackerRank](https://www.hackerrank.com/shreyas_shrawage)\n| [Surbhi Mayank](https://github.com/surbhi2408) \u003cbr\u003e \u003cimg src=\"https://avatars.githubusercontent.com/u/58289829?s=400\u0026u=68fd396819b927ec4d8820d87d6d1e311c3abd01\u0026v=4\" width=\"100\" height=\"100\"\u003e | India | C++ | [GitHub](https://github.com/surbhi2408)\n| [Amrit Kumar](https://github.com/amrit-GH23) \u003cbr\u003e \u003cimg src=\"https://avatars.githubusercontent.com/u/146119347?s=400\u0026u=599ba9f51c94e08861dc01580db03fadde609ad8\u0026v=4\" width=\"100\" height=\"100\"\u003e | India | C++ | [CodeChef](https://www.codechef.com/users/amrit_kumar08)\u003cbr/\u003e[Linkedin](https://www.linkedin.com/in/amrit-kumar-28053b253/)\n\n\u003cdiv align=\"right\"\u003e\n \u003cb\u003e\u003ca href=\"#algorithms\"\u003e⬆️ Back to Top\u003c/a\u003e\u003c/b\u003e\n\u003c/div\u003e\n\u003cbr/\u003e\n","funding_links":["https://github.com/sponsors/codedecks-in","https://paypal.me/codedecks"],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodedecks-in%2Fleetcode-solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcodedecks-in%2Fleetcode-solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodedecks-in%2Fleetcode-solutions/lists"}