## Product of minimum edge weight between all pairs of a Tree

Given a tree with N vertices and N-1 Edges. Let’s define a function F(a, b) which is equal to the minimum edge weight in 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 tree with N vertices and N-1 Edges. Let’s define a function F(a, b) which is equal to the minimum edge weight in the… Read More »

Given an array arr of size N and a number K. The task is to find the minimum elements to be replaced in the array… Read More »

Given K sorted doubly linked list. The task is to merge all sorted doubly linked list in single sorted doubly linked list means final list… Read More »

Given an array of strings, we need to sort the array in increasing order of string lengths, using Map Data Structure. Examples: Input: str[] =… Read More »

Given an array of pairs arr of size N which represents a game situation where the first player wins against the second player. Given multiple… Read More »

There is one meeting room in a firm. There are N meetings in the form of (S[i], F[i]) where S[i] is the start time of… Read More »

Given two arrays X and L of same size N. Xi represents the position in an infinite line. Li represents the range up to which… Read More »

Given string str of size N consists of lower-case English alphabets. The task is to find the arrangement of the characters of the string such… Read More »

Given an array arr of size N and an integer K. The task is to find the pair of intergers such that their sum is… Read More »

Given an array arr[] of size N and an integer X. The task is to find the smallest element greater than X which is not… Read More »

Given an array arr[] of size N and an integer K. The task is to find all the unique combinations from the given array such… Read More »

Given an array of size N. The task is to remove minimum elements from the array such that twice of minimum number is greater than… Read More »

Given an array arr[] and two integers X and K. The task is to perform the following operation on array K times: Sort the array.… Read More »

Given an array arr[] and two integers K and D, the task is to find exactly K pairs (arr[i], arr[j]) from the array such that… Read More »

Given a queue and the task is to sort it using recursion without using any loop. We can only use the following functions of queue:… Read More »