Problem Statement (Simplified): For a given string S and number of rows R, we have to arrange each character on rows in a vertical zigzag format, and then print values...
CONCEPTS USED: Sorting DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given an array A containing N bulbs placed on the road of length L, these bulbs can be placed at any point...
Concepts Used Strings Difficulty Level Easy Problem Statement (Simplified): For given two strings A and B, print out if B is a substring of A or not. If yes print...
Concepts Used Strings, Sliding Window Algorithm using two pointers Difficulty Level Medium Problem Statement (Simplified): Print the number of substrings containing all three characters i.e. a,b,c at least once in...
Concepts Used Strings, Mathematics Difficulty Level Hard Problem Statement (Simplified): Find if the number given as a string is the power of two or not. Return 1 if yes, else...
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given two characters C1, C2 and an integer K, print all the possible K length combinations of both the characters. Print the...
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given N pairs of Binary Numbers 0 and 1, your task is to generate all possible combinations such that for each 0...
Arrays are the data structures that enables us to store data of similar type under the same variable name. It can be used to store the details of the student...
CONCEPTS USED: Arrays DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array A of N positive integers. The task is to find the maximum of j - i such that A[j]...
CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given an array A with N-1 elements, with elements from 1 to N present into it. Find a single missing element....
CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given a magical container such that whenever :- A Red Stone is added to the ith bag, the quality factor of...
CONCEPTS USED: Post Min array DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array A with N elements, your task is to divide the array in maximum possible segments such that...
CONCEPTS USED: Hashing DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given an array A with N elements containing all elements from 0 to N-1, your task is to find the maximum length...
CONCEPTS USED: Hashing DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given an array A with N integers, find the count of unique integers in the array. See original problem statement here For...
CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Print all those elements that have no element greater than them in the right side of the array. Print elements from...
Finding the number of subarrays with a sum greater than or equal to a given value K is a common problem in array manipulation. The task involves determining the count...
Concepts used: Two Pointers Technique Difficulty level: Medium Problem statement(SIMPLIFIED): Given an array A with N elements arranged in an ascending order, also given a number K. Check if their...
In this article, we will be looking at how we can solve the problem Greater than neighbor, in which you are given an Array and you need to print all...
CONCEPTS USED: Searching DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given a number N, find the smallest number that has same set-of-digits as N and is greater than N. If N is...
CONCEPTS USED: Suffix Sum Arrays DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array of N integers and an integer K, the task is to find the maximum sum taking every...
CONCEPTS USED: Hashing, Basic Mathematics DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array of N integers, print the value of all those elements, whose indexes form an increasing Arithmetic Progression...
CONCEPTS USED: Hashing DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given N ages of students of a college and some conditions which determine whether A can Friend Request B or not. Determine...
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: 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: Basic Mathematics, Co-ordinate Geometry DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given 4 coordinate points, check if the given quadrilateral formed from given coordinates forms a Square or not, print...
CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array A which contains the sorted time points at which a hero named Saitama punches and paralyzes his enemy...
The concept of finding the minimum number of notes refers to a problem often encountered in programming, where the goal is to determine the smallest number of currency notes required...
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....