{"id":19164028,"url":"https://github.com/souravcoder1/interview-preperation","last_synced_at":"2026-06-11T21:34:24.551Z","repository":{"id":162681544,"uuid":"286801741","full_name":"souravCoder1/Interview-Preperation","owner":"souravCoder1","description":null,"archived":false,"fork":false,"pushed_at":"2020-08-11T17:24:51.000Z","size":415,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-22T22:44:27.242Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"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/souravCoder1.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}},"created_at":"2020-08-11T17:03:48.000Z","updated_at":"2020-10-03T05:27:22.000Z","dependencies_parsed_at":null,"dependency_job_id":"c480c40d-d9be-426b-9904-265a490a483e","html_url":"https://github.com/souravCoder1/Interview-Preperation","commit_stats":null,"previous_names":["souravcoder1/interview-preperation"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/souravCoder1/Interview-Preperation","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/souravCoder1%2FInterview-Preperation","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/souravCoder1%2FInterview-Preperation/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/souravCoder1%2FInterview-Preperation/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/souravCoder1%2FInterview-Preperation/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/souravCoder1","download_url":"https://codeload.github.com/souravCoder1/Interview-Preperation/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/souravCoder1%2FInterview-Preperation/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34219510,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-11T02:00:06.485Z","response_time":57,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":[],"created_at":"2024-11-09T09:17:42.137Z","updated_at":"2026-06-11T21:34:24.535Z","avatar_url":"https://github.com/souravCoder1.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Leetcode solutions in Java\n\nMy accepted leetcode solutions to some of the common interview problems.\n\n#### [Array](problems/src/array)\n\n- [Pascals Traiangle II](problems/src/array/PascalsTriangle.java) (Easy)\n- [Product Of Array Except Self](problems/src/array/ProductOfArrayExceptSelf.java) (Medium)\n- [Rotate Matrix](problems/src/array/RotateMatrix.java) (Medium)\n- [Set Matrix Zeroes](problems/src/array/SetMatrixZeroes.java) (Medium)\n- [Third Maximum Number](problems/src/array/ThirdMaximumNumber.java) (Easy)\n- [Two Sum](problems/src/array/TwoSum.java) (Easy)\n- [TwoSum II](problems/src/array/TwoSumII.java) (Easy)\n- [Can Place Flowers](problems/src/array/CanPlaceFlowers.java) (Easy)\n- [Merge Intervals](problems/src/array/MergeIntervals.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [First Missing Positive](problems/src/array/FirstMissingPositive.java) (Hard)\n- [Fruit Into Baskets](problems/src/array/FruitIntoBaskets.java) (Medium)\n- [MaxProduct Of Three Numbers](problems/src/array/MaxProductOfThreeNumbers.java) (Easy)\n- [Missing Number](problems/src/array/MissingNumber.java) (Easy)\n- [Merge Sorted Array](problems/src/array/MergeSortedArray.java) (Easy)\n- [Rotate Array](problems/src/array/RotateArray.java) (Easy)\n- [Sort Colors](problems/src/array/SortColors.java) (Medium)\n- [Battleships in a Board](problems/src/array/BattleshipsInABoard.java) (Medium)\n- [Find the Celebrity](problems/src/array/FindTheCelebrity.java) (Medium)\n- [Meeting Rooms](problems/src/array/MeetingRooms.java) (Easy)\n- [Longest Continuous Increasing Subsequence](problems/src/array/LongestIncreasingSubsequence.java) (Easy)\n- [Sparse Matrix Multiplication](problems/src/array/SparseMatrixMultiplication.java) (Medium)\n- [Read N Characters Given Read4](problems/src/array/ReadNCharacters.java) (Easy)\n- [Maximum Swap](problems/src/array/MaximumSwap.java) (Medium)\n- [H-Index](problems/src/array/HIndex.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Insert Interval](problems/src/array/InsertInterval.java) (Hard)\n- [Increasing Triplet Subsequence](problems/src/array/IncreasingTripletSubsequence.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [K Empty Slots](problems/src/array/KEmptySlots.java) (Hard)\n- [Subarray Sum Equals K](problems/src/array/SubarraySumEqualsK.java) (Medium)\n- [Pour Water](problems/src/array/PourWater.java) (Medium)\n- [Relative Ranks](problems/src/array/RelativeRanks.java) (Easy)\n- [Next Greater Element I](problems/src/array/NextGreaterElementI.java) (Easy)\n- [Largest Number At Least Twice of Others](problems/src/array/LargestNumberAtLeastTwice.java) (Easy)\n- [Minimum Moves to Equal Array Elements II](problems/src/array/MinimumMovesToEqualArray.java) (Median)\n- [Image Smoother](problems/src/array/ImageSmoother.java) (Easy)\n- [Minimum Index Sum of Two Lists](problems/src/array/MinimumIndexSumOfTwoLists.java) (Easy)\n- [Card Flipping Game](problems/src/array/CardFilipGame.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Employee Free Time](problems/src/array/EmployeeFreeTime.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Best Meeting Point](problems/src/array/BestMeetingPoint.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [My Calendar III](problems/src/array/MyCalendarThree.java) (Hard)\n- [Champagne Tower](problems/src/array/ChampagneTower.java) (Medium)\n- [Valid Tic-Tac-Toe State](problems/src/array/ValidTicTacToeState.java) (Medium)\n- [Number of Subarrays with Bounded Maximum](problems/src/array/SubArraysWithBoundedMaximum.java) (Medium)\n- [Surface Area of 3D Shapes](problems/src/array/SurfaceAreaOfThreeDShapes.java) (Easy)\n- [Max Consecutive Ones](problems/src/array/MaxConsecutiveOnes.java) (Easy)\n- [Max Consecutive Ones II](problems/src/array/MaxConsecutiveOnesII.java) (Medium)\n- [Add to Array-Form of Integer](problems/src/array/AddToArrayFormOfInteger.java) (Easy)\n- [Find Pivot Index](problems/src/array/FindPivotIndex.java) (Easy)\n- [Largest Time for Given Digits](problems/src/array/LargestTimeForGivenDigits.java) (Easy)\n- [Minimum Time Difference](problems/src/array/MinimumTimeDifference.java) (Medium)\n- [Reveal Cards In Increasing Order](problems/src/array/RevealCardsInIncreasingOrder.java) (Medium)\n- [Sort Array By Parity II](problems/src/array/SortArrayByParityII.java) (Easy)\n- [Matrix Cells in Distance Order](problems/src/array/MatrixCellsinDistanceOrder.java) (Easy)\n- [Maximum Sum of Two Non-Overlapping Subarrays](problems/src/array/MaximumSumofTwoNonOverlappingSubarrays.java) (Medium)\n- [Longest Line of Consecutive One in Matrix](problems/src/array/LongestLineofConsecutiveOneinMatrix.java) (Medium)\n- [Array Partition I](problems/src/array/ArrayPartitionI.java) (Easy)\n- [Relative Sort Array](problems/src/array/RelativeSortArray.java) (Easy)\n- [Meeting Scheduler](problems/src/array/MeetingScheduler.java) (Medium)\n- [Minimum Swaps to Group All 1's Together](problems/src/array/MinimumSwapsToGroupAll1Together.java) (Medium)\n- [Array Nesting](problems/src/array/ArrayNesting.java) (Medium)\n\n#### [Backtracking](problems/src/backtracking)\n\n- [Combinations](problems/src/backtracking/Combinations.java) (Medium)\n- [Combinations Sum](problems/src/backtracking/CombinationSum.java) (Medium)\n- [Combinations Sum II](problems/src/backtracking/CombinationSumII.java) (Medium)\n- [Letter Phone Number](problems/src/backtracking/LetterPhoneNumber.java) (Medium)\n- [Paliandrome Partitioning](problems/src/backtracking/PalindromePartitioning.java) (Medium)\n- [Permutations](problems/src/backtracking/Permutations.java) (Medium)\n- [Permutations II](problems/src/backtracking/PermutationsII.java) (Medium)\n- [SubSets](problems/src/backtracking/Subsets.java) (Medium)\n- [SubSet II](problems/src/backtracking/SubsetsII.java) (Medium)\n- [Word Search](problems/src/backtracking/WordSearch.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Word Search II](problems/src/backtracking/WordSearchII.java) (Hard)\n- [Generate Parentheses](problems/src/backtracking/GenerateParentheses.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Remove Invalid Parentheses](problems/src/backtracking/RemoveInvalidParentheses.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Regular Expression Matching](problems/src/backtracking/RegularExpressionMatching.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Expression Add Operators](problems/src/backtracking/ExpressionAddOperators.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Wildcard Matching](problems/src/backtracking/WildcardMatching.java) (Hard)\n- [Letter Case Permutation](problems/src/backtracking/LetterCasePermutation.java) (Easy)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Zuma Game](problems/src/backtracking/ZumaGame.java) (Hard)\n- [Matchsticks to Square](problems/src/backtracking/MatchsticksToSquare.java) (Medium)\n\n#### [Binary Search](problems/src/binary_search)\n\n- [Minimum Sorted Rotated Array](problems/src/binary_search/MinSortedRotatedArray.java) (Medium)\n- [Search in a Rotated Sorted Array](problems/src/binary_search/SearchRotatedSortedArray.java) (Medium)\n- [Search for a Range](problems/src/binary_search/SearchForARange.java) (Medium)\n- [Sqrt(x)](problems/src/binary_search/SqrtX.java) (Easy)\n- [Search Insert Position](problems/src/binary_search/SearchInsertPosition.java) (Easy)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Median of Two Sorted Arrays](problems/src/binary_search/MedianOfTwoSortedArrays.java) (Hard)\n- [Pow(x, n)](problems/src/binary_search/PowXN.java) (Medium)\n- [Find Peak Element](problems/src/binary_search/FindPeakElement.java) (Medium)\n- [Target Sum](problems/src/binary_search/TargetSum.java) (Medium)\n- [H-Index II](problems/src/binary_search/HIndexII.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Swim in Rising Water](problems/src/binary_search/SwimInRisingWater.java) (Hard)\n- [Time Based Key-Value Store](problems/src/binary_search/TimeBasedKeyValuePair.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Minimum Window Subsequence](problems/src/binary_search/MinimumWindowSubsequence.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Koko Eating Bananas](problems/src/binary_search/KokoEatingBananas.java) (Hard)\n- [Single Element in a Sorted Array](problems/src/binary_search/SingleElementInASortedArray.java) (Medium)\n\n#### [Bit Manipulation](problems/src/bit_manipulation)\n\n- [Gray Code](problems/src/bit_manipulation/GrayCode.java) (Medium)\n- [Hamming Distance](problems/src/bit_manipulation/HammingDistance.java) (Easy)\n- [Total Hamming Distance](problems/src/bit_manipulation/TotalHammingDistance.java) (Medium)\n- [Divide Two Integers](problems/src/bit_manipulation/DivideTwoIntegers.java) (Medium)\n- [Binary Number with Alternating Bits](problems/src/bit_manipulation/BinaryNumberWithAlternatingBits.java) (Easy)\n- [Binary Watch](problems/src/bit_manipulation/BinaryWatch.java) (Easy)\n\n#### [Breadth First Search](problems/src/breadth_first_search)\n\n- [Binaray Tree Level Order Traversal](problems/src/breadth_first_search/BinarayTreeLevelOrderTraversal.java) (Medium)\n- [Word Ladder](problems/src/breadth_first_search/WordLadder.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Word Ladder II](problems/src/breadth_first_search/WordLadderII.java) (Hard)\n- [Walls and Gates](problems/src/breadth_first_search/WallsAndGates.java) (Medium)\n- [Open the lock](problems/src/breadth_first_search/OpenTheLock.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Cut Off Trees for Golf Event](problems/src/breadth_first_search/CutOffTreesForGolfEvent.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Race Car](problems/src/breadth_first_search/RaceCar.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Bus Routes](problems/src/breadth_first_search/BusRoutes.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Sliding Puzzle](problems/src/breadth_first_search/SlidingPuzzle.java) (Hard)\n- [Matrix](problems/src/breadth_first_search/Matrix.java) (Medium)\n- [Rotting Oranges](problems/src/breadth_first_search/RottingOranges.java) (Medium)\n\n#### [Depth First Search](problems/src/depth_first_search)\n\n- [Minesweeper](problems/src/depth_first_search/Minesweeper.java) (Medium)\n- [Movie Recommend](problems/src/depth_first_search/MovieRecommend.java) (Medium)\n- [Number Of Islands](problems/src/depth_first_search/NumberOfIslands.java) (Medium)\n- [Course Schedule](problems/src/depth_first_search/CourseSchedule.java) (Medium)\n- [Course Schedule II](problems/src/depth_first_search/CourseScheduleII.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Alien Dictionary](problems/src/depth_first_search/AlienDictionary.java) (Hard)\n- [Graph Valid Tree](problems/src/depth_first_search/GraphValidTree.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Longest Consecutive Sequence](problems/src/depth_first_search/LongestConsecutiveSequence.java) (Hard)\n- [Accounts Merge](problems/src/depth_first_search/AccountsMerge.java) (Medium)\n- [CloneGraph](problems/src/depth_first_search/CloneGraph.java) (Medium)\n- [Island Perimeter](problems/src/depth_first_search/IslandPerimeter.java) (Easy)\n- [Number of Distinct Islands](problems/src/depth_first_search/NumberOfDistinctIslands.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Number of Distinct Islands II](problems/src/depth_first_search/NumberOfDistinctIslandsII.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Smallest Rectangle Enclosing Black Pixels](problems/src/depth_first_search/SmallestRectangleEnclosingBlackPixels.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Bricks Falling When Hit](problems/src/depth_first_search/BricksFallingWhenHit.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Robot Room Cleaner](problems/src/depth_first_search/RobotRoomCleaner.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Cracking the Safe](problems/src/depth_first_search/CrackingTheSafe.java) (Hard)\n- [All Paths From Source to Target](problems/src/depth_first_search/AllPathsFromSourceToTarget.java) (Medium)\n- [Max Area of Island](problems/src/depth_first_search/MaxAreaOfIsland.java) (Medium)\n- [Satisfiability of Equality Equations](problems/src/depth_first_search/SatisfiabilityOfEquations.java) (Medium)\n- [Number of Enclaves](problems/src/depth_first_search/NumberOfEnclaves.java) (Medium)\n- [As Far from Land as Possible](problems/src/depth_first_search/AsFarfromLandAsPossible.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Minimize Malware Spread](problems/src/depth_first_search/MinimizeMalwareSpread.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Parallel Courses](problems/src/depth_first_search/ParallelCourses.java) (Hard)\n- [Connecting Cities With Minimum Cost](problems/src/depth_first_search/ConnectingCitiesWithMinimumCost.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Critical Connections in a Network](problems/src/depth_first_search/CriticalConnection.java) (Hard)\n\n#### [Design](problems/src/design)\n\n- [Copy List With Random Pointer](problems/src/design/CopyListWithRandomPointer.java) (Medium)\n- [Encode and Decode Tiny URL](problems/src/design/EncodeAndDecodeTinyURL.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [LFU Cache](problems/src/design/LFUCache.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [LRU Cache](problems/src/design/LRUCache.java) (Hard)\n- [Insert Delete Get Random](problems/src/design/RandomizedSet.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Serialize Deserialize Binary Tree](problems/src/design/SerializeDeserializeBinaryTree.java) (Hard)\n- [Design Twitter](problems/src/design/Twitter.java) (Medium)\n- [Tic-Tac-Toe](problems/src/design/TicTacToe.java) (Medium)\n- [Implement Trie (Prefix Tree)](problems/src/design/Trie.java) (Medium)\n- [Binary Search Tree Iterator](problems/src/design/BSTIterator.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Design Search Autocomplete System](problems/src/design/AutocompleteSystem.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Design Excel Sum Formula](problems/src/design/Excel.java) (Hard)\n- [Flatten Nested List Iterator](problems/src/design/NestedIterator.java) (Medium)\n- [Add and Search Word - Data structure design](problems/src/design/WordDictionary.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Prefix and Suffix Search](problems/src/design/WordFilter.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Insert Delete GetRandom O(1) - Duplicates allowed](problems/src/design/RandomizedCollection.java) (Hard)\n\n#### [Divide and Conquer](problems/src/divide_and_conquer)\n\n- [Kth Largest Element In a Array](problems/src/divide_and_conquer/KthLargestElementInAnArray.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Reverse Pairs](problems/src/divide_and_conquer/ReversePairs.java) (Hard)\n- [Search in a 2D Matrix](problems/src/divide_and_conquer/SearchA2DMatrix.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [24 Game](problems/src/divide_and_conquer/TwentyFourGame.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Reverse Pairs II](problems/src/divide_and_conquer/ReversePairsII.java) (Hard)\n- [My Calendar II](problems/src/divide_and_conquer/MyCalendarII.java) (Medium)\n\n#### [Dynamic Programming](problems/src/dynamic_programming)\n\n- [Best Time To Buy and Sell Stocks](problems/src/dynamic_programming/BestTimeToBuyAndSellStocks.java) (Easy)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Best Time to Buy and Sell Stock III](problems/src/dynamic_programming/BestTimeToBuyAndSellStockIII.java) (Hard)\n- [Best Time to Buy and Sell Stock with Transaction Fee](problems/src/dynamic_programming/BestTimeToBuyAndSellStocksWithFee.java) (Medium)\n- [Climbing Stairs](problems/src/dynamic_programming/ClimbingStairs.java) (Easy)\n- [Coin Change](problems/src/dynamic_programming/CoinChange.java) (Medium)\n- [Coin Change 2](problems/src/dynamic_programming/CoinChange2.java) (Medium)\n- [Decode Ways](problems/src/dynamic_programming/DecodeWays.java) (Medium)\n- [House Robber](problems/src/dynamic_programming/HouseRobber.java) (Easy)\n- [House Robber II](problems/src/dynamic_programming/HouseRobberII.java) (Medium)\n- [Longest Increasing Subsequence](problems/src/dynamic_programming/LongestIncreasingSubsequence.java) (Medium)\n- [Longest Paliandromic Substring](problems/src/dynamic_programming/LongestPaliandromicSubstring.java) (Medium)\n- [Longest Palindromic Subsequence](problems/src/dynamic_programming/LongestPalindromicSubsequence.java) (Medium)\n- [Maximum Product Subarray](problems/src/dynamic_programming/MaximumProductSubarray.java) (Medium)\n- [Min Cost Climbing Stairs](problems/src/dynamic_programming/MinCostClimbingStairs.java) (Easy)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Palindrome Partitioning II](problems/src/dynamic_programming/PalindromePartitioningII.java) (Hard)\n- [UniqueBinary Search Trees](problems/src/dynamic_programming/UniqueBinarySearchTrees.java) (Medium)\n- [Unique Binary Search Trees II](problems/src/dynamic_programming/UniqueBinarySearchTreesII.java) (Medium)\n- [WordBreak](problems/src/dynamic_programming/WordBreak.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [WordBreak II](problems/src/dynamic_programming/WordBreakII.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Concatenated Words](problems/src/dynamic_programming/ConcatenatedWords.java) (Hard)\n- [Can I Win](problems/src/dynamic_programming/CanIWin.java) (Medium)\n- [Maximum Subarray](problems/src/dynamic_programming/MaximumSubarray.java) (Easy)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Dungeon Game](problems/src/dynamic_programming/DungeonGame.java) (Hard)\n- [2 Keys Keyboard](problems/src/dynamic_programming/TwoKeysKeyboard.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Maximum Sum of 3 Non-Overlapping Subarrays](problems/src/dynamic_programming/MaxSum3SubArray.java) (Hard)\n- [Maximal Square](problems/src/dynamic_programming/MaximalSquare.java) (Medium)\n- [Continuous Subarray Sum](problems/src/dynamic_programming/ContinuousSubarraySum.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Decode Ways II](problems/src/dynamic_programming/DecodeWaysII.java) (Hard)\n- [Palindromic Substrings](problems/src/dynamic_programming/PalindromicSubstrings.java) (Medium)\n- [Number of Longest Increasing Subsequence](problems/src/dynamic_programming/NumberOfLIS.java) (Medium)\n- [Combination Sum IV](problems/src/dynamic_programming/CombinationSumIV.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Paint House II](problems/src/dynamic_programming/PaintHouseII.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Split Array Largest Sum](problems/src/dynamic_programming/SplitArrayLargestSum.java) (Hard)\n- [Number Of Corner Rectangles](problems/src/dynamic_programming/CornerRectangles.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Burst Balloons](problems/src/dynamic_programming/BurstBalloons.java) (Hard)\n- [Largest Plus Sign](problems/src/dynamic_programming/LargestPlusSign.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Palindrome Pairs](problems/src/dynamic_programming/PalindromePairs.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Cherry Pickup](problems/src/dynamic_programming/CherryPickup.java) (Hard)\n- [Knight Probability in Chessboard](problems/src/dynamic_programming/KnightProbabilityInChessboard.java) (Medium)\n- [Largest Sum of Averages](problems/src/dynamic_programming/LargestSumOfAverages.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Minimum Number of Refueling Stops](problems/src/dynamic_programming/MinimumNumberOfRefuelingStops.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Cat and Mouse](problems/src/dynamic_programming/CatAndMouse.java) (Hard)\n- [Stone Game](problems/src/dynamic_programming/StoneGame.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Odd Even Jump](problems/src/dynamic_programming/OddEvenJump.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Profitable Schemes](problems/src/dynamic_programming/ProfitableSchemes.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Maximum Vacation Days](problems/src/dynamic_programming/MaximumVacationDays.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Russian Doll Envelopes](problems/src/dynamic_programming/RussianDollEnvelopes.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Student Attendance Record II](problems/src/dynamic_programming/StudentAttendanceRecordII.java) (Hard)\n- [Out of Boundary Paths](problems/src/dynamic_programming/OutOfBoundaryPaths.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Remove Boxes](problems/src/dynamic_programming/RemoveBoxes.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Stickers to Spell Word](problems/src/dynamic_programming/StickersToSpellWord.java) (Hard)\n- [Ones and Zeroes](problems/src/dynamic_programming/OnesAndZeroes.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Encode String with Shortest Length](problems/src/dynamic_programming/EncodeStringWithShortestLength.java) (Hard)\n- [Length of Longest Fibonacci Subsequence](problems/src/dynamic_programming/LengthofLongestFibonacciSubsequence.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Make Array Strictly Increasing](problems/src/dynamic_programming/MakeArrayStrictlyIncreasing.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Minimum Number of Taps to Open to Water a Garden](problems/src/dynamic_programming/MinimumNumberOfTaps.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Delete Columns to Make Sorted III](problems/src/dynamic_programming/DeleteColumnsToMakeSortedIII.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Handshakes That Don't Cross](problems/src/dynamic_programming/HandshakesThatDontCross.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Minimum Difficulty of a Job Schedule](problems/src/dynamic_programming/MinimumDifficultyOfAJobSchedule.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Jump Game V](problems/src/dynamic_programming/JumpGameV.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Freedom Trail](problems/src/dynamic_programming/FreedomTrail.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Strange Printer](problems/src/dynamic_programming/StrangePrinter.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Minimum Cost to Merge Stones](problems/src/dynamic_programming/MinimumCostToMergeStones.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Interleaving String](problems/src/dynamic_programming/InterleavingString.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Count Vowels Permutation](problems/src/dynamic_programming/CountVowelsPermutation.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Non-negative Integers without Consecutive Ones](problems/src/dynamic_programming/NonNegativeIntegersWithoutConsecutiveOnes.java) (Hard)\n- [Bomb Enemy](problems/src/dynamic_programming/BombEnemy.java) (Medium)\n- [Number of Dice Rolls With Target Sum](problems/src/dynamic_programming/NumberOfDiceRollsWithTargetSum.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Distinct Subsequences](problems/src/dynamic_programming/DistinctSubsequences.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Distinct Subsequences II](problems/src/dynamic_programming/DistinctSubsequencesII.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Minimum Distance to Type a Word Using Two Fingers](problems/src/dynamic_programming/MinimumDistanceToTypeAWordUsingTwoFingers.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Valid Palindrome III](problems/src/dynamic_programming/ValidPalindromeIII.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Palindrome Partitioning III](problems/src/dynamic_programming/PalindromePartitioningIII.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Tiling a Rectangle with the Fewest Squares](problems/src/dynamic_programming/TilingARectangle.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Longest Chunked Palindrome Decomposition](problems/src/dynamic_programming/LongestChunkedPalindromeDecomposition.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Stone Game III](problems/src/dynamic_programming/StoneGameIII.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Number of Ways to Stay in the Same Place After Some Steps](problems/src/dynamic_programming/NumberOfWaysToStayInTheSamePlace.java) (Hard)\n- [Toss Strange Coins](problems/src/dynamic_programming/TossStrangeCoins.java) (Medium)\n- [Knight Dialer](problems/src/dynamic_programming/KnightDialer.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Palindrome Removal](problems/src/dynamic_programming/PalindromeRemoval.java) (Hard)\n\n\n#### [Greedy](problems/src/greedy)\n\n- [Jump Game](problems/src/greedy/JumpGame.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Jump Game II](problems/src/greedy/JumpGameII.java) (Hard)\n- [Course Schedule III](problems/src/greedy/CourseScheduleIII.java) (Medium)\n- [GasStation](problems/src/greedy/GasStation.java) (Medium)\n- [Non-Overlapping Intervals](problems/src/greedy/NonOverlappingIntervals.java) (Medium)\n- [Minimum Number of Arrows to Burst Balloons](problems/src/greedy/BurstBalloons.java) (Medium)\n- [Queue Reconstruction By Height](problems/src/greedy/QueueReconstructionByHeight.java) (Medium)\n- [Task Scheduler](problems/src/greedy/TaskScheduler.java) (Medium)\n- [Maximum Length of Pair Chain](problems/src/greedy/MaximumLengthOfPairChain.java) (Medium)\n- [Lemonade Change](problems/src/greedy/LemonadeChange.java) (Easy)\n- [Score After Flipping Matrix](problems/src/greedy/ScoreAfterFlippingMatrix.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [IPO](problems/src/greedy/IPO.java) (Hard)\n- [String Without AAA or BBB](problems/src/greedy/StringWithout3A3B.java) (Medium)\n- [Boats to Save People](problems/src/greedy/BoatsToSavePeople.java) (Medium)\n- [Broken Calculator](problems/src/greedy/BrokenCalculator.java) (Medium)\n- [Two City Scheduling](problems/src/greedy/TwoCityScheduling.java) (Easy)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Minimum Time to Build Blocks](problems/src/greedy/MinimumTimeToBuildBlocks.java) (Hard)\n\n#### [Hashing](problems/src/hashing)\n\n- [Anagrams](problems/src/hashing/Anagrams.java) (Medium)\n- [Group Anagrams](problems/src/hashing/GroupAnagrams.java) (Medium)\n- [Kdiff Pairs In a Array](problems/src/hashing/KdiffPairsInanArray.java) (Easy)\n- [Sort Character by Frequency](problems/src/hashing/SortCharByFrequency.java) (Medium)\n- [Two Sum](problems/src/hashing/TwoSum.java) (Easy)\n- [Valid Anagram](problems/src/hashing/ValidAnagram.java) (Easy)\n- [Maximum Size Subarray Sum Equals k](problems/src/hashing/MaximumSizeSubarraySumEqualsk.java) (Medium)\n- [Contiguous Array](problems/src/hashing/ContiguousArray.java) (Medium)\n- [Brick Wall](problems/src/hashing/BrickWall.java) (Medium)\n- [Partition Labels](problems/src/hashing/PartitionLabels.java) (Medium)\n- [Custom Sort String](problems/src/hashing/CustomSortString.java) (Medium)\n- [Short Encoding of Words](problems/src/hashing/ShortEncodingOfWords.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Substring with Concatenation of All Words](problems/src/hashing/SubstringConcatenationOfWords.java) (Hard)\n- [Distribute Candies](problems/src/hashing/DistributeCandies.java) (Easy)\n- [Groups of Special-Equivalent Strings](problems/src/hashing/GroupsOfSpecialEquivalentStrings.java) (Easy)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Number of Atoms](problems/src/hashing/NumberOfAtoms.java) (Hard)\n- [Analyze User Website Visit Pattern](problems/src/hashing/AnalyzeUserWebsiteVisitPattern.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [String Transforms Into Another String](problems/src/hashing/StringTransformsIntoAnotherString.java) (Hard)\n\n#### [Heap](problems/src/heap)\n\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Sliding Window Maximum](problems/src/heap/SlidingWindowMaximum.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [The Skyline Problem](problems/src/heap/TheSkylineProblem.java) (Hard)\n- [Meeting Rooms II](problems/src/heap/MeetingRoomsII.java) (Medium)\n- [Top K Frequent Words](problems/src/heap/TopKFrequentWords.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Candy](problems/src/heap/Candy.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Smallest Rotation with Highest Score](problems/src/heap/SmallestRotationWithHighestScore.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Maximum Frequency Stack](problems/src/heap/FreqStack.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Reachable Nodes In Subdivided Graph](problems/src/heap/ReachableNodesInSubdividedGraph.java) (Hard)\n- [K Closest Points to Origin](problems/src/heap/KClosestPointsToOrigin.java) (Medium)\n- [Distant Barcodes](problems/src/heap/DistantBarcodes.java) (Medium)\n\n#### [Linked List](problems/src/linked_list)\n\n- [Intersection of two Linked-Lists](problems/src/linked_list/IntersectionOfTwoLists.java) (Easy)\n- [Linked List Cycle](problems/src/linked_list/LinkedListCycle.java) (Easy)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Merge K Sorted Lists](problems/src/linked_list/MergeKSortedLists.java) (Hard)\n- [Merge Two Sorted List](problems/src/linked_list/MergeTwoSortedList.java) (Easy)\n- [Paliandrome List](problems/src/linked_list/PaliandromeList.java) (Easy)\n- [Reverse Linked List](problems/src/linked_list/ReverseLinkedList.java) (Easy)\n- [Delete Node in a Linked List](problems/src/linked_list/DeleteNode.java) (Easy)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Reverse Nodes in k-Group](problems/src/linked_list/ReverseNodesKGroup.java) (Hard)\n- [Swap Nodes in Pairs](problems/src/linked_list/SwapNodesInPairs.java) (Medium)\n- [Middle of Linked List](problems/src/linked_list/MiddleOfLinkedList.java) (Easy)\n- [Split Linked List in Parts](problems/src/linked_list/SplitLinkedListInParts.java) (Medium)\n- [Next Greater Node In Linked List](problems/src/linked_list/NextGreaterNodeInLinkedList.java) (Medium)\n\n#### [Math](problems/src/math)\n\n- [Add Two Numbers](problems/src/math/AddTwoNumbers.java) (Medium)\n- [Count Primes](problems/src/math/CountPrimes.java) (Easy)\n- [Rotate Function](problems/src/math/RotateFunction.java) (Medium)\n- [Water and Jug Problem](problems/src/math/WaterAndJugProblem.java) (Medium)\n- [Add Digits](problems/src/math/AddDigits.java) (Easy)\n- [Excel Sheet Column Title](problems/src/math/ExcelSheetColumnTitle.java) (Easy)\n- [Roman to Integer](problems/src/math/RomanToInteger.java) (Easy)\n- [Bulb Switcher II](problems/src/math/BulbSwitcherII.java) (Medium)\n- [Global and Local Inversions](problems/src/math/GlobalAndLocalInversions.java) (Medium)\n- [Solve the Equation](problems/src/math/SolveTheEquation.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Couples Holding Hands](problems/src/math/CouplesHoldingHands.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Reaching Points](problems/src/math/ReachingPoints.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Nth Magical Number](problems/src/math/NthMagicalNumber.java) (Hard)\n- [Squirrel Simulation](problems/src/math/SquirrelSimulation.java) (Medium)\n- [Projection Area of 3D Shapes](problems/src/math/ProjectionAreaOf3DShapes.java) (Easy)\n- [Decoded String at Index](problems/src/math/DecodedStringAtIndex.java) (Medium)\n- [Base 7](problems/src/math/Base7.java) (Easy)\n- [Smallest Range I](problems/src/math/SmallestRangeI.java) (Easy)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Largest Component Size by Common Factor](problems/src/math/LargestComponentSizebyCommonFactor.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Super Washing Machines](problems/src/math/SuperWashingMachines.java) (Hard)\n- [Rectangle Overlap](problems/src/math/RectangleOverlap.java) (Easy)\n- [Nth Digit](problems/src/math/NthDigit.java) (Easy)\n\n#### [Reservoir Sampling](problems/src/reservoir_sampling)\n\n- [Random Pick Index](problems/src/reservoir_sampling/RandomPickIndex.java) (Medium)\n\n#### [Stack](problems/src/stack)\n\n- [Min Stack](problems/src/stack/MinStack.java) (Easy)\n- [Valid Parentheses](problems/src/stack/ValidParentheses.java) (Easy)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Largest Rectangle In Histogram](problems/src/stack/LargestRectangleInHistogram.java) (Hard)\n- [Implement Queue using Stacks](problems/src/stack/MyQueue.java) (Easy)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Maximal Rectangle](problems/src/stack/MaximalRectangle.java) (Hard)\n- [Exclusive Time of Functions](problems/src/stack/ExclusiveTimeOfFunctions.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Basic Calculator](problems/src/stack/BasicCalculator.java) (Hard)\n- [Decode String](problems/src/stack/DecodeString.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Longest Valid Parentheses](problems/src/stack/LongestValidParentheses.java) (Hard)\n\n\n#### [String](problems/src/string)\n\n- [First Unique Character In a String](problems/src/string/FirstUniqueCharacterInAString.java) (Easy)\n- [Repeated Substring Pattern](problems/src/string/RepeatedSubstringPattern.java) (Easy)\n- [Reverse Words In a String](problems/src/string/ReverseWordsInAString.java) (Medium)\n- [ReverseWords II](problems/src/string/ReverseWordsII.java) (Medium)\n- [String to Integer](problems/src/string/StringToInteger.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Text Justification](problems/src/string/TextJustification.java) (Hard)\n- [ZigZag Conversion](problems/src/string/ZigZagConversion.java) (Medium)\n- [Implement StrStr](problems/src/string/ImplementStrStr.java) (Easy)\n- [Excel Sheet Column Number](problems/src/string/ExcelSheetColumnNumber.java) (Easy)\n- [Compare Version Numbers](problems/src/string/CompareVersionNumbers.java) (Easy)\n- [Valid Palindrome](problems/src/string/ValidPalindrome.java) (Easy)\n- [Simplify Path](problems/src/string/SimplifyPath.java) (Medium)\n- [Permutation in String](problems/src/string/PermutationInString.java) (Medium)\n- [Add Binary](problems/src/string/AddBinary.java) (Easy)\n- [Valid Palindrome II](problems/src/string/ValidPalindromeII.java) (Easy)\n- [One Edit Distance](problems/src/string/OneEditDistance.java) (Medium)\n- [Count and Say](problems/src/string/CountAndSay.java) (Easy)\n- [Multiply Strings](problems/src/string/MultiplyStrings.java) (Medium)\n- [Longest Word in Dictionary through Deleting](problems/src/string/LongestWordInDictonary.java) (Medium)\n- [Isomorphic Strings](problems/src/string/IsomorphicStrings.java) (Easy)\n- [String Compression](problems/src/string/StringCompression.java) (Easy)\n- [Longest Common Prefix](problems/src/string/LongestCommonPrefix.java) (Easy)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Find the Closest Palindrome](problems/src/string/FindTheClosestPalindrome.java) (Hard)\n- [Monotone Increasing Digits](problems/src/string/MonotoneIncreasingDigits.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Shortest Palindrome](problems/src/string/ShortestPalindrome.java) (Hard)\n- [Valid Word Abbreviation](problems/src/string/ValidWordAbbreviation.java) (Easy)\n- [Longest Palindrome](problems/src/string/LongestPalindrome.java) (Easy)\n- [Replace Words](problems/src/string/ReplaceWords.java) (Medium)\n- [Rotate String](problems/src/string/RotateString.java) (Easy)\n- [Keyboard Row](problems/src/string/KeyboardRow.java) (Easy)\n- [Student Attendance Record I](problems/src/string/StudentAttendanceRecordI.java) (Easy)\n- [Split Concatenated Strings](problems/src/string/SplitConcatenatedStrings.java) (Medium)\n- [Valid Word Square](problems/src/string/ValidWordSquare.java) (Easy)\n- [Reconstruct Original Digits from English](problems/src/string/ReconstructOriginalDigitsFromEnglish.java) (Medium)\n- [Push Dominoes](problems/src/string/PushDominoes.java) (Medium)\n- [Validate IP Address](problems/src/string/ValidateIPAddress.java) (Medium)\n- [Reverse String II](problems/src/string/ReverseStringII.java) (Easy)\n- [Find Words That Can Be Formed by Characters](problems/src/string/FindWordsThatCanBeFormedbyCharacters.java) (Easy)\n- [Minimum Add to Make Parentheses Valid](problems/src/string/MinimumAddtoMakeParenthesesValid.java) (Medium)\n\n#### [Tree](problems/src/tree)\n\n- [Binaray Tree Right Side View](problems/src/tree/BinarayTreeRightSideView.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Binary Tree Maximum Path Sum](problems/src/tree/BinaryTreeMaximumPathSum.java) (Hard)\n- [Boundary of Binary Tree](problems/src/tree/BoundaryOfBinaryTree.java) (Medium)\n- [Convert sorted array to BST](problems/src/tree/ConvertSortedArrayToBST.java) (Medium)\n- [Lowest Common Ancestor of a Binary Tree](problems/src/tree/LCA.java) (Medium)\n- [Lowest Common Ancestor of a BST](problems/src/tree/LowestCommonAncestorBST.java) (Easy)\n- [Most Frequent Subtree Sum](problems/src/tree/MostFrequentSubtreeSum.java) (Medium)\n- [Path Sum III](problems/src/tree/PathSumIII.java) (Easy)\n- [Convert Postorder and Inorder traversal to Binary Tree](problems/src/tree/PostorderToBT.java) (Medium)\n- [Convert Preorder and Inorder traversal to Binary Tree](problems/src/tree/PreorderToBT.java) (Medium)\n- [Sorted Array to BST](problems/src/tree/SortedArrayToBST.java) (Medium)\n- [Valid Binary Search Tree](problems/src/tree/ValidBinarySearchTree.java) (Medium)\n- [Largest BST Subtree](problems/src/tree/LargestBSTSubtree.java) (Medium)\n- [Closest Binary Search Tree Value](problems/src/tree/ClosestBinarySearchTreeValue.java) (Easy)\n- [Inorder Successor in BST](problems/src/tree/InorderSuccessorInBST.java) (Medium)\n- [Construct String From Binary Tree](problems/src/tree/ConstructStringFromBinaryTree.java) (Easy)\n- [Flatten Binary Tree to Linked List](problems/src/tree/FlattenBinaryTree.java) (Medium)\n- [Populating Next Right Pointers in Each Node](problems/src/tree/NextRightPointer.java) (Medium)\n- [Populating Next Right Pointers in Each Node II](problems/src/tree/NextRightPointerII.java) (Medium)\n- [Subtree of Another Tree](problems/src/tree/SubtreeOfAnotherTree.java) (Easy)\n- [Binary Tree Zigzag Level Order Traversal](problems/src/tree/ZigZagTraversal.java) (Medium)\n- [Binary Tree Inorder Traversal](problems/src/tree/BinaryTreeInorderTraversal.java) (Medium)\n- [Symmetric Tree](problems/src/tree/SymmetricTree.java) (Easy)\n- [Maximum Binary Tree](problems/src/tree/MaximumBinaryTree.java) (Medium)\n- [Find Bottom Left Tree Value](problems/src/tree/FindBottomLeftTreeValue.java) (Medium)\n- [Diameter of Binary Tree](problems/src/tree/DiameterOfBinaryTree.java) (Easy)\n- [Binary Tree Paths](problems/src/tree/BinaryTreePaths.java) (Easy)\n- [Sum of Left Leaves](problems/src/tree/SumofLeftLeaves.java) (Easy)\n- [Two Sum IV - Input is a BST](problems/src/tree/TwoSumIV.java) (Easy)\n- [Average of Levels in Binary Tree](problems/src/tree/AverageOfLevelsInBinaryTree.java) (Easy)\n- [Convert Binary Search Tree to Sorted Doubly Linked List](problems/src/tree/BSTtoDoublyLinkedList.java) (Easy)\n- [Same Tree](problems/src/tree/SameTree.java) (Easy)\n- [Binary Tree Longest Consecutive SequencefindMinDifference II](problems/src/tree/BinaryTreeLongestConsecutiveSequenceII.java) (Medium)\n- [Minimum Absolute Difference in BST](problems/src/tree/MinimumAbsoluteDifferenceInBST.java) (Medium)\n- [Equal Tree Partition](problems/src/tree/EqualTreePartition.java) (Medium)\n- [Split BST](problems/src/tree/SplitBST.java) (Medium)\n- [Closest Leaf in a Binary Tree](problems/src/tree/ClosestLeafInABinaryTree.java) (Medium)\n- [Maximum Width of Binary Tree](problems/src/tree/MaximumWidthOfBinaryTree.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Recover Binary Search Tree](problems/src/tree/RecoverBinarySearchTree.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Binary Tree Postorder Traversal](problems/src/tree/BinaryTreePostorderTraversal.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Serialize and Deserialize N-ary Tree](problems/src/tree/SerializeAndDeserializeNAryTree.java) (Hard)\n- [Convert BST to Greater Tree](problems/src/tree/ConvertBSTToGreaterTree.java) (Easy)\n- [All Nodes Distance K in Binary Tree](problems/src/tree/AllNodesDistanceKInBinaryTree.java) (Medium)\n- [All Possible Full Binary Trees](problems/src/tree/AllPossibleFullBinaryTrees.java) (Medium)\n- [Flip Equivalent Binary Trees](problems/src/tree/FlipEquivalentBinaryTrees.java) (Medium)\n- [Construct Binary Tree from String](problems/src/tree/ConstructBinaryTreefromString.java) (Medium)\n- [Find Largest Value in Each Tree Row](problems/src/tree/FindLargestValueInEachTreeRow.java) (Medium)\n- [Find Bottom Left Tree Value](problems/src/tree/FindBottomLeftTreeValue.java) (Medium)\n- [Maximum Level Sum of a Binary Tree](problems/src/tree/MaximumLevelSumofABinaryTree.java) (Medium)\n- [Leaf-Similar Trees](problems/src/tree/LeafSimilarTrees.java) (Easy)\n- [Binary Tree Tilt](problems/src/tree/BinaryTreeTilt.java) (Easy)\n\n#### [Two Pointers](problems/src/two_pointers)\n\n- [Four Sum](problems/src/two_pointers/FourSum.java) (Medium)\n- [Longest Substring Witout Repeats](problems/src/two_pointers/LongestSubstringWitoutRepeats.java) (Medium)\n- [Three Sum](problems/src/two_pointers/ThreeSum.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Trapping Rain Water](problems/src/two_pointers/TrappingRainWater.java) (Hard)\n- [3Sum Closest](problems/src/two_pointers/ThreeSumClosest.java) (Medium)\n- [Move Zeroes](problems/src/two_pointers/MoveZeroes.java) (Easy)\n- [Remove Duplicates](problems/src/two_pointers/RemoveDuplicates.java) (Easy)\n- [Remove Duplicates II](problems/src/two_pointers/RemoveDuplicatesII.java) (Medium)\n- [Minimum Size Subarray Sum](problems/src/two_pointers/MinimumSizeSubarraySum.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Minimum Window Substring](problems/src/two_pointers/MinimumWindowSubstring.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Smallest Range](problems/src/two_pointers/SmallestRange.java) (Hard)\n- [Subarray Product Less Than K](problems/src/two_pointers/SubarrayProductLessThanK.java) (Medium)\n- [Number of Matching Subsequences](problems/src/two_pointers/NumberOfMatchingSubsequences.java) (Medium)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Subarrays with K Different Integers](problems/src/two_pointers/SubarraysWithKDifferentIntegers.java) (Hard)\n- ![#f03c15](https://placehold.it/15/f03c15/000000?text=+) [Last Substring in Lexicographical Order](problems/src/two_pointers/LastSubstringInLexicographicalOrder.java) (Hard)\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsouravcoder1%2Finterview-preperation","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsouravcoder1%2Finterview-preperation","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsouravcoder1%2Finterview-preperation/lists"}