{"id":15042816,"url":"https://github.com/praisepaul/leetcode_challenges","last_synced_at":"2026-04-06T06:32:24.366Z","repository":{"id":251805559,"uuid":"838486264","full_name":"Praisepaul/LeetCode_Challenges","owner":"Praisepaul","description":null,"archived":false,"fork":false,"pushed_at":"2024-08-13T18:20:15.000Z","size":69,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-13T17:26:35.876Z","etag":null,"topics":["competitive-programming","java-8"],"latest_commit_sha":null,"homepage":"https://praisepaul.live","language":"Java","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/Praisepaul.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":"2024-08-05T18:31:49.000Z","updated_at":"2024-08-13T18:20:18.000Z","dependencies_parsed_at":"2024-11-19T10:40:26.827Z","dependency_job_id":"c5cb04d6-a2a5-4c9d-9548-32385a65bb09","html_url":"https://github.com/Praisepaul/LeetCode_Challenges","commit_stats":null,"previous_names":["praisepaul/leetcode_challenges"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Praisepaul%2FLeetCode_Challenges","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Praisepaul%2FLeetCode_Challenges/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Praisepaul%2FLeetCode_Challenges/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Praisepaul%2FLeetCode_Challenges/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Praisepaul","download_url":"https://codeload.github.com/Praisepaul/LeetCode_Challenges/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243447642,"owners_count":20292455,"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":["competitive-programming","java-8"],"created_at":"2024-09-24T20:48:01.229Z","updated_at":"2025-12-30T06:59:22.997Z","avatar_url":"https://github.com/Praisepaul.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Leetcode Problems Solutions\n\n\u003e **\"The only way to do great work is to love what you do.\"** -Steve Jobs \n\nThis repository contains my solutions to various Leetcode problems. Below is a table listing all the problems, along with their tags, difficulty level, and a checkbox for you to mark if you've solved the problem. \n\nFeel free to fork this repository and contribute by adding more problems or improving the existing solutions.\n\n## Problems List\n\n| ID  | Title                                                                                                                                             | Tags                               | Difficulty | Solved             | Solution File                        |\n| --- | ------------------------------------------------------------------------------------------------------------------------------------------------- | ---------------------------------- | ---------- | ------------------ | ------------------------------------ |\n| 1   | [Two Sum](https://leetcode.com/problems/two-sum/)                                                                                                 | Array, Hash Table                  | Easy       | :heavy_check_mark: | [Two Sum.java](./Two_Sum.java)       |\n| 2   | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)                                                                                 | Linked List, Math                  | Medium     | :heavy_check_mark: | [Add 2 Number.java](./Add_to_nums.java)   |\n| 3   | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)                   | Hash Table, String, Sliding Window | Medium     | :heavy_check_mark: | [Longest Substring Without Repeatition.java](./longestSubstringWithoutRepeatition.java)   |\n| 4   | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)                                                         | Array, Binary Search               | Hard       | :heavy_check_mark: | [Median Of 2 Sorted Array.java](./medianOf2SortedArray.java)   |\n| 5   | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)                                                     | String, Dynamic Programming        | Medium     | :x:                | [ ](./Solution5.java)   |\n| 6   | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/)                                                                             | String                             | Medium     | :x:                | [ ](./Solution6.java)   |\n| 7   | [Reverse Integer](https://leetcode.com/problems/reverse-integer/)                                                                                 | Math                               | Easy       | :heavy_check_mark: | [Reverse Integer.java](./reverseInteger.java)   |\n| 8   | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/)                                                                 | String                             | Medium     | :heavy_check_mark: | [String To Integer.java](./stringToInteger.java)   |\n| 9   | [Palindrome Number](https://leetcode.com/problems/palindrome-number/)                                                                             | Math                               | Easy       | :heavy_check_mark: | [Pallindrome Number.java](./pallindromeNum.java)   |\n| 10  | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/)                                                         | String, Dynamic Programming        | Hard       | :x:                | [ ](./Solution10.java) |\n| 11  | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/)                                                             | Array, Two Pointers                | Medium     | :x:                | [ ](./Solution11.java) |\n| 12  | [Integer to Roman](https://leetcode.com/problems/integer-to-roman/)                                                                               | Math                               | Medium     | :heavy_check_mark:                | [Integer To Roman.java](./integerToRoman.java) |\n| 13  | [Roman to Integer](https://leetcode.com/problems/roman-to-integer/)                                                                               | Math                               | Easy       | :heavy_check_mark:                | [Roman To Integer.java](./romantoInteger.java) |\n| 14  | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)                                                                     | String                             | Easy       | :heavy_check_mark:               | [Longest Common Prefix.java](./longestCommonPrefix.java) |\n| 15  | [3Sum](https://leetcode.com/problems/3sum/)                                                                                                       | Array, Two Pointers                | Medium     | :x:                | [Letter Combination Of Phone Number.java](./letterCombinationOfPhoneNum.java) |\n| 16  | [3Sum Closest](https://leetcode.com/problems/3sum-closest/)                                                                                       | Array, Two Pointers                | Medium     | :x:                | [ ](./Solution16.java) |\n| 17  | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)                                     | Backtracking, String               | Medium     | :heavy_check_mark:                | [Letter Combination Of Phone Numbers.java](.letterCombinationOfPhoneNum.java) |\n| 18  | [4Sum](https://leetcode.com/problems/4sum/)                                                                                                       | Array, Two Pointers                | Medium     | :x:                | [ ](./Solution18.java) |\n| 19  | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)                                               | Linked List                        | Medium     | :heavy_check_mark:                | [Remove Nth Node From End.java](./removeNthNodeFromEnd.java) |\n| 20  | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)                                                                             | Stack, String                      | Easy       | :heavy_check_mark:                | [Valid Paranthesis.java](./validParanthesis.java) |\n| 21  | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)                                                                   | Linked List                        | Easy       | :heavy_check_mark:                | [Merge Two Sorted Lists.java](./mergeTwoSortedLists.java) |\n| 22  | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/)                                                                       | Backtracking                       | Medium     | :heavy_check_mark:               | [Generate Parantheses.java](./generateParantheses.java) |\n| 23  | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)                                                                       | Linked List, Divide and Conquer    | Hard       | :heavy_check_mark:                | [Merge K Sorted Lists.java](./mergeKSortedLists.java) |\n| 24  | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)                                                                         | Linked List                        | Medium     | :x:                | [Solution24.java](./Solution24.java) |\n| 25  | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/)                                                               | Linked List                        | Hard       | :heavy_check_mark:                | [Reverse Nodes In K Groups.java](./reverseNodesKGroups.java) |\n| 26  | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)                                         | Array                              | Easy       | :heavy_check_mark:                | [Remove Duplicates From Sorted Array.java](./removeDuplicatesFromSortedArray.java) |\n| 27  | [Remove Element](https://leetcode.com/problems/remove-element/)                                                                                   | Array                              | Easy       | :heavy_check_mark:                | [Remove Element.java](./removeElement.java) |\n| 28  | [Find the Index Of First Occurence In A String](https://leetcode.com/problems/implement-strstr/)                                                                             | String                             | Easy       | :heavy_check_mark:                | [Index Of First Occurence In A String.java](./indexOfFirstOccurenceInAString.java) |\n| 29  | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)                                                                         | Math                               | Medium     | :x:                | [Solution29.java](./Solution29.java) |\n| 30  | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/)                             | Hash Table, String, Sliding Window | Hard       | :x:                | [Solution30.java](./Solution30.java) |\n| 31  | [Next Permutation](https://leetcode.com/problems/next-permutation/)                                                                               | Array, Two Pointers                | Medium     | :x:                | [Solution31.java](./Solution31.java) |\n| 32  | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/)                                                             | String, Stack                      | Hard       | :heavy_check_mark:                | [Longest Valid Parantheses.java](./longestValidParantheses.java) |\n| 33  | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)                                                   | Array, Binary Search               | Medium     | :heavy_check_mark:                | [Search In Rotated Sorted Array.java](./searchInRotatedSortedArray.java) |\n| 34  | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/) | Array, Binary Search               | Medium     | :heavy_check_mark:                | [First And Last Position Of Element In Sorted Array.java](./firstAndLastPositionOfElementInSortedArray.java) |\n| 35  | [Search Insert Position](https://leetcode.com/problems/search-insert-position/)                                                                   | Array, Binary Search               | Easy       | :heavy_check_mark:                | [Search Insert Position.java](./searchInsertPosition.java) |\n| 36  | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)                                                                                       | Array, Hash Table                  | Medium     | :x:                | [Solution36.java](./Solution36.java) |\n| 37  | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver/)                                                                                     | Backtracking                       | Hard       | :x:                | [Solution37.java](./Solution37.java) |\n| 38  | [Count and Say](https://leetcode.com/problems/count-and-say/)                                                                                     | String                             | Easy       | :x:                | [Solution38.java](./Solution38.java) |\n| 39  | [Combination Sum](https://leetcode.com/problems/combination-sum/)                                                                                 | Backtracking                       | Medium     | :x:                | [Solution39.java](./Solution39.java) |\n| 40  | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii/)                                                                           | Backtracking                       | Medium     | :x:                | [Solution40.java](./Solution40.java) |\n| 41  | [First Missing Positive](https://leetcode.com/problems/first-missing-positive/)                                                                   | Array                              | Hard       | :heavy_check_mark:               | [First Missing Positive.java](./firstMissingPositive.java) |\n| 42  | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)                                                                         | Array, Two Pointers                | Hard       | :heavy_check_mark:               | [Trapping Rain Water.java](./trappingRainWater.java) |\n| 43  | [Multiply Strings](https://leetcode.com/problems/multiply-strings/)                                                                               | Math, String                       | Medium     | :x:                | [Solution43.java](./Solution43.java) |\n| 44  | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching/)                                                                             | String, Dynamic Programming        | Hard       | :x:                | [Solution44.java](./Solution44.java) |\n| 45  | [Jump Game II](https://leetcode.com/problems/jump-game-ii/)                                                                                       | Array, Greedy                      | Hard       | :x:                | [Solution45.java](./Solution45.java) |\n| 46  | [Permutations](https://leetcode.com/problems/permutations/)                                                                                       | Backtracking                       | Medium     | :x:                | [Solution46.java](./Solution46.java) |\n| 47  | [Permutations II](https://leetcode.com/problems/permutations-ii/)                                                                                 | Backtracking                       | Medium     | :x:                | [Solution47.java](./Solution47.java) |\n| 48  | [Rotate Image](https://leetcode.com/problems/rotate-image/)                                                                                       | Array                              | Medium     | :x:                | [Solution48.java](./Solution48.java) |\n| 49  | [Group Anagrams](https://leetcode.com/problems/group-anagrams/)                                                                                   | Hash Table, String                 | Medium     | :heavy_check_mark:                | [Group Anagrams.java](./groupAnagrams.java) |\n| 50  | [Pow(x, n)](https://leetcode.com/problems/powx-n/)                                                                                                | Math                               | Medium     | :x:                | [Solution50.java](./Solution50.java) |\n| 51  | [N-Queens](https://leetcode.com/problems/n-queens/)                                                                                               | Backtracking                       | Hard       | :x:                | [Solution51.java](./Solution51.java) |\n| 52  | [N-Queens II](https://leetcode.com/problems/n-queens-ii/)                                                                                         | Backtracking                       | Hard       | :x:                | [Solution52.java](./Solution52.java) |\n| 53  | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)                                                                               | Array, Dynamic Programming         | Easy       | :x:                | [Solution53.java](./Solution53.java) |\n| 54  | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)                                                                                     | Array                              | Medium     | :x:                | [Spiral Matrix.java](./spiralMatrix.java) |\n| 55  | [Jump Game](https://leetcode.com/problems/jump-game/)                                                                                             | Array, Greedy                      | Medium     | :x:                | [Solution55.java](./Solution55.java) |\n| 56  | [Merge Intervals](https://leetcode.com/problems/merge-intervals/)                                                                                 | Array, Sorting                     | Medium     | :x:                | [Solution56.java](./Solution56.java) |\n| 57  | [Insert Interval](https://leetcode.com/problems/insert-interval/)                                                                                 | Array                              | Hard       | :x:                | [Solution57.java](./Solution57.java) |\n| 58  | [Length of Last Word](https://leetcode.com/problems/length-of-last-word/)                                                                         | String                             | Easy       | :heavy_check_mark:                | [Length Of Last Word.java](./lengthOfLastWord.java) |\n| 59  | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/)                                                                               | Array                              | Medium     | :x:                | [Spiral MatrixII.java](./spiralMatrixII.java) |\n| 60  | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence/)                                                                       | Math, Backtracking                 | Hard       | :x:                | [Solution60.java](./Solution60.java) |\n| 61  | [Rotate List](https://leetcode.com/problems/rotate-list/)                                                                                         | Linked List                        | Medium     | :heavy_check_mark:                | [Rotate List.java](./rotateList.java) |\n| 62  | [Unique Paths](https://leetcode.com/problems/unique-paths/)                                                                                       | Dynamic Programming                | Medium     | :x:                | [Solution62.java](./Solution62.java) |\n| 63  | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii/)                                                                                 | Dynamic Programming                | Medium     | :x:                | [Solution63.java](./Solution63.java) |\n| 64  | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/)                                                                               | Dynamic Programming                | Medium     | :x:                | [Solution64.java](./Solution64.java) |\n| 65  | [Valid Number](https://leetcode.com/problems/valid-number/)                                                                                       | String                             | Hard       | :x:                | [Solution65.java](./Solution65.java) |\n| 66  | [Plus One](https://leetcode.com/problems/plus-one/)                                                                                               | Array                              | Easy       | :heavy_check_mark:                | [Plus One.java](./plusOne.java) |\n| 67  | [Add Binary](https://leetcode.com/problems/add-binary/)                                                                                           | String, Math                       | Easy       | :heavy_check_mark:                | [Add Binary.java](./addBinary.java) |\n| 68  | [Text Justification](https://leetcode.com/problems/text-justification/)                                                                           | String                             | Hard       | :x:                | [Solution68.java](./Solution68.java) |\n| 69  | [Sqrt(x)](https://leetcode.com/problems/sqrtx/)                                                                                                   | Binary Search, Math                | Easy       | :heavy_check_mark:                | [Sqrt Of X.java](./sqrtOfX.java) |\n| 70  | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)                                                                                 | Dynamic Programming                | Easy       | :heavy_check_mark:                | [Climbing Stairs.java](./climbingStairs.java) |\n| 71  | [Simplify Path](https://leetcode.com/problems/simplify-path/)                                                                                     | Stack, String                      | Medium     | :x:                | [Solution71.java](./Solution71.java) |\n| 72  | [Edit Distance](https://leetcode.com/problems/edit-distance/)                                                                                     | String, Dynamic Programming        | Hard       | :heavy_check_mark:                | [Edit Distance.java](./editDistance.java) |\n| 73  | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)                                                                             | Array                              | Medium     | :x:                | [Solution73.java](./Solution73.java) |\n| 74  | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/)                                                                           | Array, Binary Search               | Medium     | :x:                | [Solution74.java](./Solution74.java) |\n| 75  | [Sort Colors](https://leetcode.com/problems/sort-colors/)                                                                                         | Array, Two Pointers                | Medium     | :heavy_check_mark:                | [Sort Colors.java](./sortColors.java) |\n| 76  | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/)                                                               | Hash Table, String, Sliding Window | Hard       | :x:                | [Solution76.java](./Solution76.java) |\n| 77  | [Combinations](https://leetcode.com/problems/combinations/)                                                                                       | Backtracking                       | Medium     | :x:                | [Solution77.java](./Solution77.java) |\n| 78  | [Subsets](https://leetcode.com/problems/subsets/)                                                                                                 | Backtracking                       | Medium     | :x:                | [Solution78.java](./Solution78.java) |\n| 79  | [Word Search](https://leetcode.com/problems/word-search/)                                                                                         | Backtracking                       | Medium     | :heavy_check_mark:                | [Word Search.java](./wordSearch.java) |\n| 80  | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)                                   | Array                              | Medium     | :x:                | [Solution80.java](./Solution80.java) |\n| 81  | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)                                             | Array                              | Medium     | :x:                | [Solution81.java](./Solution81.java) |\n| 82  | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/)                                     | Linked List                        | Medium     | :x:                | [Remove Duplicates From Sorted List.java](./removeDuplicatesFromSortedList.java) |\n| 83  | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)                                           | Linked List                        | Easy       | :heavy_check_mark:                | [Solution83.java](./Solution83.java) |\n| 84  | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/)                                                   | Array, Stack                       | Hard       | :x:                | [Solution84.java](./Solution84.java) |\n| 85  | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/)                                                                             | Array, Stack                       | Hard       | :x:                | [Solution85.java](./Solution85.java) |\n| 86  | [Partition List](https://leetcode.com/problems/partition-list/)                                                                                   | Linked List                        | Medium     | :x:                | [Solution86.java](./Solution86.java) |\n| 87  | [Scramble String](https://leetcode.com/problems/scramble-string/)                                                                                 | String, Dynamic Programming        | Hard       | :x:                | [Solution87.java](./Solution87.java) |\n| 88  | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)                                                                           | Array                              | Easy       | :heavy_check_mark:                | [Merge Sorted List.java](./mergeSortedList.java) |\n| 89  | [Gray Code](https://leetcode.com/problems/gray-code/)                                                                                             | Bit Manipulation                   | Medium     | :x:                | [Solution89.java](./Solution89.java) |\n| 90  | [Subsets II](https://leetcode.com/problems/subsets-ii/)                                                                                           | Backtracking                       | Medium     | :x:                | [Solution90.java](./Solution90.java) |\n| 91  | [Decode Ways](https://leetcode.com/problems/decode-ways/)                                                                                         | Dynamic Programming                | Medium     | :x:                | [Solution91.java](./Solution91.java) |\n| 92  | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/)                                                                   | Linked List                        | Medium     | :x:                | [Solution92.java](./Solution92.java) |\n| 93  | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/)                                                                       | Backtracking                       | Medium     | :x:                | [Solution93.java](./Solution93.java) |\n| 94  | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)                                                     | Tree, Stack                        | Easy       | :heavy_check_mark:                | [Binary Tree InOrder Traversal.java](./binaryTreeInOrderTraversal.java) |\n| 95  | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/)                                                     | Tree, Dynamic Programming          | Medium     | :x:                | [Solution95.java](./Solution95.java) |\n| 96  | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/)                                                           | Tree, Dynamic Programming          | Medium     | :x:                | [Solution96.java](./Solution96.java) |\n| 97  | [Interleaving String](https://leetcode.com/problems/interleaving-string/)                                                                         | String, Dynamic Programming        | Hard       | :x:                | [Solution97.java](./Solution97.java) |\n| 98  | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)                                                         | Tree, Depth First Search           | Medium     | :x:                | [Solution98.java](./Solution98.java) |\n| 99  | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/)                                                           | Tree, Depth First Search           | Hard       | :x:                | [Solution99.java](./Solution99.java) |\n| 100  | [Same Tree](https://leetcode.com/problems/same-tree/)                                                                                         | Tree, Depth First Search, Breadth First Search           | Hard       | :heavy_check_mark:                | [Solution100.java](./Solution100.java) |\n\n| ... | ...                                                     | ...                  | ...        | [ ]    |\n\n## Usage\n\n1. **Clone the repository:**\n    ```sh\n    git clone https://github.com/yourusername/leetcode-solutions.git\n    ```\n2. **Navigate to the directory:**\n    ```sh\n    cd leetcode-solutions\n    ```\n3. **Create a new branch:**\n    ```sh\n    git checkout -b new-branch\n    ```\n4. **Add your solutions:**\n5. **Commit your changes:**\n    ```sh\n    git commit -am \"Added solutions to problem 1 and problem 2\"\n    ```\n6. **Push to the branch:**\n    ```sh\n    git push origin new-branch\n    ```\n7. **Submit a pull request**\n8. **Star the repository**\n9. **Relax and wait for your PR to be merged**\n10. **Celebrate - you've done your part! 🎉**\n    \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpraisepaul%2Fleetcode_challenges","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpraisepaul%2Fleetcode_challenges","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpraisepaul%2Fleetcode_challenges/lists"}