438. Find All Anagrams in a String | TC - O(N) | SC - O(1) | Sliding Window Technique
10:29
438. Find All Anagrams in a String | TC - O(N) | SC - O(1) | Sliding Window Technique
352. Data Stream as Disjoint Intervals | TC - O(logN) (addNum( )) | TC - O(N) (getIntervals( ))
11:49
352. Data Stream as Disjoint Intervals | TC - O(logN) (addNum( )) | TC - O(N) (getIntervals( ))
787. Cheapest Flights Within K Stops | Priority Queue | Dijkstra
21:30
787. Cheapest Flights Within K Stops | Priority Queue | Dijkstra
2359. Find Closest Node to Given Two Nodes | TC - O(V + E) | SC - O(V + E) | BFS | Queue
11:07
2359. Find Closest Node to Given Two Nodes | TC - O(V + E) | SC - O(V + E) | BFS | Queue
997. Find the Town Judge | TC - O(N) | SC - O(N) | Set
9:22
997. Find the Town Judge | TC - O(N) | SC - O(N) | Set
2546. Apply Bitwise Operations to Make Strings Equal | Weekly Contest 329
7:06
2546. Apply Bitwise Operations to Make Strings Equal | Weekly Contest 329
2545. Sort the Students by Their Kth Score | Weekly Contest 329
4:29
2545. Sort the Students by Their Kth Score | Weekly Contest 329
2544. Alternating Digit Sum | Weekly Contest 329
2:19
2544. Alternating Digit Sum | Weekly Contest 329
131. Palindrome Partitioning | Backtracking | TC - O(N . 2^N) | SC - O(N)
8:18
131. Palindrome Partitioning | Backtracking | TC - O(N . 2^N) | SC - O(N)
93. Restore IP Addresses | Backtracking | Clean Code | Recursion | C++
20:29
93. Restore IP Addresses | Backtracking | Clean Code | Recursion | C++
57. Insert Interval | Sorting | TC - O(NlogN) | SC - O(N) |
12:45
57. Insert Interval | Sorting | TC - O(NlogN) | SC - O(N) |
2536. Increment Submatrices by One | Weekly Contest 328 | Upsolved | Sweepline Algorithm | Optimized
13:29
2536. Increment Submatrices by One | Weekly Contest 328 | Upsolved | Sweepline Algorithm | Optimized
1061. Lexicographically Smallest Equivalent String | DFS | Union Find | Optimized | Clean Code
29:14
1061. Lexicographically Smallest Equivalent String | DFS | Union Find | Optimized | Clean Code
1519. Number of Nodes in the Sub-Tree With the Same Label | TC - O(N) | SC - O(N) | Medium | Graph
16:13
1519. Number of Nodes in the Sub-Tree With the Same Label | TC - O(N) | SC - O(N) | Medium | Graph
1443. Minimum Time to Collect All Apples in a Tree | DFS | Bottom to Top | TC - O(N) | SC - O(N)
12:31
1443. Minimum Time to Collect All Apples in a Tree | DFS | Bottom to Top | TC - O(N) | SC - O(N)
100. Same Tree | Easy | TC - O(N) | SC - O(N)
3:14
100. Same Tree | Easy | TC - O(N) | SC - O(N)
144. Binary Tree Preorder Traversal | Easy | Preorder | TC - O(N) | SC - O(N)
4:03
144. Binary Tree Preorder Traversal | Easy | Preorder | TC - O(N) | SC - O(N)
149. Max Points on a Line | Hard | Collinearity | Slope | TC - O(N ^ 2) | SC - O(N)
14:18
149. Max Points on a Line | Hard | Collinearity | Slope | TC - O(N ^ 2) | SC - O(N)
6284. Make Number of Distinct Characters Equal | Medium | Maps | Weekly Contest 327
8:16
6284. Make Number of Distinct Characters Equal | Medium | Maps | Weekly Contest 327
6285. Maximal Score After Applying K Operations | Medium | Priority Queue | Weekly Contest 327
4:11
6285. Maximal Score After Applying K Operations | Medium | Priority Queue | Weekly Contest 327
6283. Maximum Count of Positive Integer and Negative Integer | Easy | Weekly Contest 327
1:46
6283. Maximum Count of Positive Integer and Negative Integer | Easy | Weekly Contest 327
2527. Find Xor-Beauty of Array | Medium | Xor | Biweekly Contest 95
3:38
2527. Find Xor-Beauty of Array | Medium | Xor | Biweekly Contest 95
6288. Find Consecutive Integers from a Data Stream | Medium | O(N) | Breaking the consecutiveness
2:45
6288. Find Consecutive Integers from a Data Stream | Medium | O(N) | Breaking the consecutiveness
6287. Categorize Box According to Criteria | Easy | Implementation | Biweekly Contest 95
2:55
6287. Categorize Box According to Criteria | Easy | Implementation | Biweekly Contest 95
1833. Maximum Ice Cream Bars | Medium | Sorting | TC - O(NlogN) | SC - O(1)
7:01
1833. Maximum Ice Cream Bars | Medium | Sorting | TC - O(NlogN) | SC - O(1)
452. Minimum Number of Arrows to Burst Balloons | Medium | TC - O(NlogN) | SC - O(1) | Greedy
18:31
452. Minimum Number of Arrows to Burst Balloons | Medium | TC - O(NlogN) | SC - O(1) | Greedy
2244. Minimum Rounds to Complete All Tasks | Maps | TC - O(N) | SC - O(N) | Medium
13:23
2244. Minimum Rounds to Complete All Tasks | Maps | TC - O(N) | SC - O(N) | Medium
944. Delete Columns to Make Sorted | Easy | TC - O(M * N) | SC - O(1)
5:36
944. Delete Columns to Make Sorted | Easy | TC - O(M * N) | SC - O(1)
520. Detect Capital | Easy | TC - O(N) | SC - O(1)
3:42
520. Detect Capital | Easy | TC - O(N) | SC - O(1)
290. Word Pattern | TC - O(N + M) | SC - O(N + M) | Easy | Maps
9:54
290. Word Pattern | TC - O(N + M) | SC - O(N + M) | Easy | Maps