CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): With a given array of size N, find the largest (maximum) and smallest (minimum) element from the elements. See original problem...
CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): With a given array of size N and steps K, we have to print the array after K rotations to the...
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given a sorted array A containing N distinct elements, your task is to find the Mth permutation of the given array. For...
CONCEPTS USED: Hashing DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given M pairs of integers, where each integer is between 1 and N inclusive. Check if there exists two integers x and...
CONCEPTS USED: Efficient Array Search DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given marks of N students sitting on a bench and a value of K, print the index of the student...
Welcome to the world of array manipulation! If you've ever found yourself pondering over the task of converting a straightforward array into a zigzag array, you're in the right place....
CONCEPTS USED: Sliding Window Technique DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given an array A, we need to find two sub-arrays with specific lengths L and R such that sum of...