# Status Problem video Level Completes Likes 508 Get specific row K in a Pascal Triangle Medium % 0 507 Design data structure for players and ranks Medium % 0 499 Compare two version numbers of a software Medium % 1 495 Print all nested directories and files in a given directory - Recursion Medium % 0 493 Maximum meetings in one room Medium % 0 488 Check if given sudoku is valid or not Medium % 0 486 Sort the indexes of the array as per the elements of the array Medium % 0 484 Print all subarrays using recursion Medium % 1 481 Calculate (x^y)%z without using pow() function Medium % 0 477 Job Sequencing algorithm Medium % 1 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 474 Implement/Design the version control map system Medium % 0 472 Sort Map as per values - Java Program Medium % 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 467 Print all steps to convert one string to another string Medium % 0 466 Lexicographically next permutation With One swap Medium % 1 465 Find all subsets of size K from a given number N (1 to N) Medium % 0 Get specific row K in a Pascal Triangle Design data structure for players and ranks Compare two version numbers of a software Print all nested directories and files in a given directory - Recursion Maximum meetings in one room Check if given sudoku is valid or not Sort the indexes of the array as per the elements of the array Print all subarrays using recursion Calculate (x^y)%z without using pow() function Job Sequencing algorithm Find subarray with a sum to given number-2 | Handle negative numbers Sort the two dimensional (2D) array - In-place Implement/Design the version control map system Sort Map as per values - Java Program 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. Print all steps to convert one string to another string Lexicographically next permutation With One swap Find all subsets of size K from a given number N (1 to N) 1 2 3 4 5 6 7 8 9 10 11 12
