Name	Name	Last commit message	Last commit date
Latest commit History 184 Commits
.github/workflows	.github/workflows
1048. Longest String Chain	1048. Longest String Chain
1125. Smallest Sufficient Team.java	1125. Smallest Sufficient Team.java
118. Pascal's Triangle	118. Pascal's Triangle
1203. Sort Items by Groups Respecting Dependencies	1203. Sort Items by Groups Respecting Dependencies
1218. Longest Arithmetic Subsequence of Given Difference.java	1218. Longest Arithmetic Subsequence of Given Difference.java
1282. Group the People Given the Group Size They Belong To	1282. Group the People Given the Group Size They Belong To
1326. Minimum Number of Taps to Open to Water a Garden	1326. Minimum Number of Taps to Open to Water a Garden
1337. The K Weakest Rows in a Matrix	1337. The K Weakest Rows in a Matrix
135. Candy	135. Candy
1359. Count All Valid Pickup and Delivery Options	1359. Count All Valid Pickup and Delivery Options
138. Copy List with Random Pointer	138. Copy List with Random Pointer
139. Word Break	139. Word Break
141. Linked List Cycle	141. Linked List Cycle
1420. Build Array Where You Can Find The Maximum Exactly K Comparisons	1420. Build Array Where You Can Find The Maximum Exactly K Comparisons
1458. Max Dot Product of Two Subsequences	1458. Max Dot Product of Two Subsequences
146. LRU Cache.java	146. LRU Cache.java
1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree	1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree
1584. Min Cost to Connect All Points	1584. Min Cost to Connect All Points
1615. Maximal Network Rank	1615. Maximal Network Rank
1631. Path With Minimum Effort	1631. Path With Minimum Effort
1647. Minimum Deletions to Make Character Frequencies Unique	1647. Minimum Deletions to Make Character Frequencies Unique
1658. Minimum Operations to Reduce X to Zero	1658. Minimum Operations to Reduce X to Zero
168. Excel Sheet Column Title	168. Excel Sheet Column Title
17. Letter Combinations of a Phone Number	17. Letter Combinations of a Phone Number
1751. Maximum Number of Events That Can Be Attended II.JAVA	1751. Maximum Number of Events That Can Be Attended II.JAVA
1870. Minimum Speed to Arrive on Time	1870. Minimum Speed to Arrive on Time
2009. Minimum Number of Operations to Make Array Continuous	2009. Minimum Number of Operations to Make Array Continuous
2038. Remove Colored Pieces if Both Neighbors are the Same Color	2038. Remove Colored Pieces if Both Neighbors are the Same Color
207. Course Schedule.java	207. Course Schedule.java
2141. Maximum Running Time of N Computers	2141. Maximum Running Time of N Computers
215. Kth Largest Element in an Array	215. Kth Largest Element in an Array
225. Implement Stack using Queues	225. Implement Stack using Queues
2251. Number of Flowers in Full Bloom	2251. Number of Flowers in Full Bloom
229. Majority Element II	229. Majority Element II
2366. Minimum Replacements to Sort the Array	2366. Minimum Replacements to Sort the Array
2369. Check if There is a Valid Partition For The Array	2369. Check if There is a Valid Partition For The Array
239. Sliding Window Maximum	239. Sliding Window Maximum
2483. Minimum Penalty for a Shop	2483. Minimum Penalty for a Shop
2616. Minimize the Maximum Difference of Pairs	2616. Minimize the Maximum Difference of Pairs
2707. Extra Characters in a String	2707. Extra Characters in a String
287. Find the Duplicate Number	287. Find the Duplicate Number
316. Remove Duplicate Letters	316. Remove Duplicate Letters
33. Search in Rotated Sorted Array	33. Search in Rotated Sorted Array
332. Reconstruct Itinerary	332. Reconstruct Itinerary
338. Counting Bits	338. Counting Bits
34. Find First and Last Position of Element in Sorted Array	34. Find First and Last Position of Element in Sorted Array
343. Integer Break	343. Integer Break
377. Combination Sum IV	377. Combination Sum IV
389. Find the Difference	389. Find the Difference
392. Is Subsequence	392. Is Subsequence
4. Median of Two Sorted Arrays	4. Median of Two Sorted Arrays
403. Frog Jump	403. Frog Jump
445. Add Two Numbers II.java	445. Add Two Numbers II.java
456. 132 Pattern	456. 132 Pattern
459. Repeated Substring Pattern	459. Repeated Substring Pattern
46. Permutations	46. Permutations
486. Predict the Winner	486. Predict the Winner
50. Pow(x, n)	50. Pow(x, n)
518. Coin Change II	518. Coin Change II
542. 01 Matrix	542. 01 Matrix
557. Reverse Words in a String III	557. Reverse Words in a String III
62. Unique Paths	62. Unique Paths
63. Unique Paths II	63. Unique Paths II
646. Maximum Length of Pair Chain	646. Maximum Length of Pair Chain
664. Strange Printer	664. Strange Printer
673. Number of Longest Increasing Subsequence	673. Number of Longest Increasing Subsequence
68. Text Justification	68. Text Justification
688. Knight Probability in Chessboard	688. Knight Probability in Chessboard
706. Design HashMap	706. Design HashMap
712. Minimum ASCII Delete Sum for Two Strings	712. Minimum ASCII Delete Sum for Two Strings
725. Split Linked List in Parts	725. Split Linked List in Parts
735. Asteroid Collision.java	735. Asteroid Collision.java
74. Search a 2D Matrix	74. Search a 2D Matrix
767. Reorganize String	767. Reorganize String
77. Combinations	77. Combinations
802. Find Eventual Safe States.java	802. Find Eventual Safe States.java
808. Soup Servings	808. Soup Servings
81. Search in Rotated Sorted Array II	81. Search in Rotated Sorted Array II
847. Shortest Path Visiting All Nodes	847. Shortest Path Visiting All Nodes
852. Peak Index in a Mountain Array	852. Peak Index in a Mountain Array
86. Partition List	86. Partition List
863. All Nodes Distance K in Binary Tree.java	863. All Nodes Distance K in Binary Tree.java
880. Decoded String at Index	880. Decoded String at Index
894. All Possible Full Binary Trees	894. All Possible Full Binary Trees
896. Monotonic Array	896. Monotonic Array
905. Sort Array By Parity	905. Sort Array By Parity
92. Reverse Linked List II	92. Reverse Linked List II
920. Number of Music Playlists	920. Number of Music Playlists
95. Unique Binary Search Trees II	95. Unique Binary Search Trees II
97. Interleaving String	97. Interleaving String
Arithmetic Slices II - Subsequence	Arithmetic Slices II - Subsequence
Arithmetic Subarrays	Arithmetic Subarrays
Backspace String Compare	Backspace String Compare
Binary Trees With Factors	Binary Trees With Factors
Bitwise AND of Numbers Range	Bitwise AND of Numbers Range
Build an Array With Stack Operations	Build an Array With Stack Operations
Bus Routes	Bus Routes
Cheapest Flights Within K Stops	Cheapest Flights Within K Stops
Check If Two String Arrays are Equivalent	Check If Two String Arrays are Equivalent

Name

Last commit message

Last commit date

184 Commits

.github/workflows

1048. Longest String Chain

1125. Smallest Sufficient Team.java

118. Pascal's Triangle

1203. Sort Items by Groups Respecting Dependencies

1218. Longest Arithmetic Subsequence of Given Difference.java

1282. Group the People Given the Group Size They Belong To

1326. Minimum Number of Taps to Open to Water a Garden