ADD ONE TO THE NUMBER
Concepts Used Linked list reversal Difficulty Level Medium. Problem Statement : You are given a linked list representing a number such that each individual node acts as a digit of...
Find the Window
Concepts Used Sorting Difficulty Level Medium Problem Statement (Simplified): Find the minimum length of the subarray when sorted completely sorts the given array. See original problem statement here Test Case...
Search Triplets
Concepts Used Sorting Difficulty Level Medium Problem Statement (Simplified): We have to find a triplet (n_{1}, n_{2}, n_{3}) in array such that sum of two number i.e. n_{1}+n_{2} equals to...
Salvation of Soul
Concepts Used Sorting Difficulty Level Medium Problem Statement (Simplified): For a given array, shift elements to the back of array until you get the minimum value of the whole array,...
Hometown Newspaper
Concepts Used Sorting Difficulty Level Medium Problem Statement (Simplified): Print the Strings according to their priority and category. If string belongs to hometown, it will have a priority higher than...
Form the Largest Number
Concepts Used Strings, Sorting Difficulty Level Hard Problem Statement (Simplified): Given an array of numbers, arrange them in such a way that they form the largest number on joining. See...
Longest Palindromic Substring
Concepts Used Strings Difficulty Level Medium Problem Statement (Simplified): Find the longest palindromic substring in a given string and print the substring. See original problem statement here Test Cases: Input:...
Maximum Sum Rupees
Concepts Used Sorting Difficulty Level Hard Problem Statement (Simplified): We have to find the maximum sum of elements from two arrays, such that you can select elements to add only...
Maximum Divisors in a Range
Concepts Used Sorting Difficulty Level Hard, Mathematics Problem Statement (Simplified): For a given range p and q, find the highest common factor of two given numbers, i.e. a and b....
Find the Inversion Count
Concepts Used Sorting Difficulty Level Hard Problem Statement (Simplified): Find number of pairs such that a[i] > a[j] and i < j. Test Case Input: 1 5 10 50 20...