# Status Problem video Level Completes Likes 478 Efficient Robot Problem - Find Minimum Trips Hard % 0 476 Find subarray with a sum to given number-2 | Handle negative numbers Medium % 0 475 Sort the two dimensional (2D) array - In-place Medium % 0 473 Given an array, count the number of pairs with a given sum. Beginner % 0 471 Two Sum Problem Beginner % 0 470 Find if any two intervals overlap in given intervals Medium % 0 469 Given an array, find the number of all pairs with odd sum. Medium % 0 468 Unique subsets with a given sum with allowed repeated digits. Medium % 0 466 Lexicographically next permutation With One swap Medium % 1 464 Sum of distinct elements among two given sets Beginner % 0 462 Stable Marriage Problem - Gale–Shapley Algorithm Hard % 0 459 Given an array, find three-element sum closest to Zero Medium % 1 458 Print sorted unique elements of a given array Beginner % 0 457 Given an array, print all unique subsets with a given sum. Medium % 0 456 Subsets Elements less than K. Medium % 0 455 Replace array elements with maximum element on the right. Medium % 0 446 Print all middle elements of the given matrix/2D array. Beginner % 1 445 Depth-First Search (DFS) in 2D Matrix/2D-Array - Recursive Solution Beginner % 1 442 Find the number of distinct Islands OR connected components. Hard % 0 440 Given an array, Print sum of all subsets Beginner % 1 Efficient Robot Problem - Find Minimum Trips Find subarray with a sum to given number-2 | Handle negative numbers Sort the two dimensional (2D) array - In-place Given an array, count the number of pairs with a given sum. Two Sum Problem Find if any two intervals overlap in given intervals Given an array, find the number of all pairs with odd sum. Unique subsets with a given sum with allowed repeated digits. Lexicographically next permutation With One swap Sum of distinct elements among two given sets Stable Marriage Problem - Gale–Shapley Algorithm Given an array, find three-element sum closest to Zero Print sorted unique elements of a given array Given an array, print all unique subsets with a given sum. Subsets Elements less than K. Replace array elements with maximum element on the right. Print all middle elements of the given matrix/2D array. Depth-First Search (DFS) in 2D Matrix/2D-Array - Recursive Solution Find the number of distinct Islands OR connected components. Given an array, Print sum of all subsets 1 2 3 4 5 6 7 8 9 10 11
