## Smallest multiple of N formed using the given set of digits

Given a set of digits S and an integer N, the task is to find the smallest positive integer if exists which contains only the… Read More »

- Amazon Internship Interview Experience
- k-th missing element in an unsorted array
- Sort an array without changing position of negative numbers
- Find the longest string that can be made up of other strings from the array
- Comparison among Bubble Sort, Selection Sort and Insertion Sort
- Count the triplets such that A[i] < B[j] < C[k]
- Two nodes of a BST are swapped, correct the BST | Set-2
- Nagarro Interview Experience Off-campus
- Bubble Sort for Linked List by Swapping nodes
- Greatest contiguous sub-array of size K
- Maximum water that can be stored between two buildings
- Merge two BSTs with constant extra space
- Keep track of previous indexes after sorting a vector in C++ STL
- Find a triplet in an array whose sum is closest to a given number
- Range Queries to Find number of sub-arrays with a given xor
- Find maximum meetings in one room
- Split the array elements into strictly increasing and decreasing sequence
- Pair with largest sum which is less than K in the array
- Iterative selection sort for linked list
- Count pairs with given sum | Set 2
- Find the number of elements greater than k in a sorted array
- Program to print an array in Pendulum Arrangement with constant space
- Maximum Length Chain of Pairs | Set-2
- IntroSort or Introspective sort
- Sort an array of strings based on the frequency of good words in them
- Remove elements to make array sorted
- Divide array into two parts with equal sum according to the given constraints
- Find minimum changes required in an array for it to contain k distinct elements
- Check whether an array can be made strictly decreasing by modifying at most one element
- Unbounded Fractional Knapsack

Given a set of digits S and an integer N, the task is to find the smallest positive integer if exists which contains only the… Read More »

Given two arrays u and v, representing a graph such that there is an undirected edge from u[i] to v[i] (0 ≤ v[i], u[i] <… Read More »

Given an array arr[] of size N, the task is to count the number of ways we can select a subset from the given array… Read More »

Given an integer N in the form of string, the task is to find the largest even number from the given number when you are… Read More »

Given a Binary Search Tree and an integer sum, the task is to find all the pairs from the tree whose sum is equal to… Read More »

Given an array arr[] of strings, the task is to reorder the strings lexicographically and print their positions in the original list. Examples: Input: arr[]… Read More »

Given two arrays box[] and truck[] where box[i] represents the weight of the ith box and truck[i] represents the maximum load that the ith truck… Read More »

Given an array of pairs arr[], the task is to find the maximum cost choosing at most K pairs. The cost of an array of… Read More »

Given an array arr[] of integers, the task is to find the minimum number greater than the maximum element from the array which cannot be… Read More »

Given width and height of N rectangles. The task is to find the minimum number of rectangles left after inserting one into another. Note :… Read More »

Given a number N, the task is to find the largest number less than or equal to the given number N such that on rearranging… Read More »

Given an array A[] containing N elements and an integer K. The task is to calculate the product of all elements of subsequences of size… Read More »

Given two unsorted arrays arr1[] and arr2[], the task is to find the sum of elements of arr1[] such that number of elements less than… Read More »

Given two arrays x[] and y[] where x[i] represents the x coordinate and y[i] represents the corresponding y coordinate of a 2-D point, the task… Read More »

Given an array arr[] of N elements. At any step, we can delete a number of a different parity from the just previous step, i.e.,… Read More »