LeetCode Solutions [Updating]


#TitleDifficultyTopicsSolution
45Jump Game IIMedium<DP>[Solution]
55Jump GameMedium<DP>[Solution]
62Unique PathsMedium<DP>[Solution]
64Minimum Path SumMedium<DP>[Solution]
70Climbing StairsEasy<DP>[Solution]
238Product of Array Except SelfMedium<Prefix / Suffix>[Solution]
343Integer BreakMedium<DP>[Solution]
413Arithmetic SlicesMedium<DP>[Solution]
463Island PerimeterEasy<DFS> <BFS>[Solution]
562Longest Line of Consecutive One in MatrixMedium<DP>[Solution]
1182Shortest Distance to Target ColorMedium<DP>[Solution]
1249Minimum Remove to Make Valid ParenthesesMedium<Stack> <String>[Solution]
2022Convert 1D Array Into 2D ArrayEasy[Solution]
2023Number of Pairs of Strings With Concatenation Equal to TargetMedium<Hash Table> <String>[Solution]
2024Maximize the Confusion of an ExamMedium<Sliding Window>[Solution]
2027Minimum Moves to Convert StringEasy<String>[Solution]
2028Find Missing ObservationsMedium<Math>[Solution]
2032Two Out of ThreeEasy<Hash Table>[Solution]
2033Minimum Operations to Make a Uni-Value GridMedium<Sort> <Math>[Solution]
2034Stock Price FluctuationMedium<Hash Table> <Set>[Solution]
2036Maximum Alternating Subarray SumMedium<DP>[Solution]
2037Minimum Number of Moves to Seat EveryoneEasy<Sort>[Solution]
2038Remove Colored Pieces if Both Neighbors are the Same ColorMedium<Greedy> <Math> <Game>[Solution]
2039The Time When the Network Becomes IdleMedium<BFS> <Graph> <Shortest Path>[Solution]
2042Check if Numbers Are Ascending in a SentenceEasy<Greedy> <String>[Solution]
2043Simple Bank SystemMedium<Hash Table>[Solution]
2044Count Number of Maximum Bitwise-OR SubsetsMedium<Hash Table> <Bit>[Solution]
2047Number of Valid Words in a SentenceEasy<Greedy> <String>[Solution]
2048Next Greater Numerically Balanced NumberMedium<Brute Force>[Solution]
2049Count Nodes With the Highest ScoreMedium<BFS> <Tree>[Solution]
2050Parallel Courses IIIHard<Graph> <Topo-Sort>[Solution]
2053Kth Distinct String in an ArrayEasy<Hash Table>[Solution]
2054Two Best Non-Overlapping EventsMedium<Sort> <Heap>[Solution]
2055Plates Between CandlesMedium<Prefix / Suffix>[Solution]
2057Smallest Index With Equal ValueEasy<Greedy>[Solution]
2058Find the Minimum and Maximum Number of Nodes Between Critical PointsMedium<Greedy> <List>[Solution]
2059Minimum Operations to Convert NumberMedium<BFS>[Solution]
2062Count Vowel Substrings of a StringEasy<Brute Force> <Sliding Window> <String>[Solution]
2063Vowels of All SubstringsMedium<Count> <String>[Solution]
2064Minimized Maximum of Products Distributed to Any StoreMedium<Binary Search>[Solution]
2065Maximum Path Quality of a GraphHard<Graph> <DFS>[Solution]
2068Check Whether Two Strings are Almost EquivalentEasy<Hash Table>[Solution]
2069Walking Robot Simulation IIMedium<Simulation>[Solution]
2070Most Beautiful Item for Each QueryMedium<Sort> <Hash Table>[Solution]
2073Time Needed to Buy TicketsEasy<Math> <Simulation>[Solution]
2074Reverse Nodes in Even Length GroupsMedium<List> <Stack>[Solution]
2075Decode the Slanted CiphertextMedium<String>[Solution]
2076Process Restricted Friend RequestsHard<Union Find>[Solution]