## m-WAY Search Trees | Set-1 ( Searching )

The m-way search trees are multi-way trees which are generalised versions of binary trees where each node contains multiple elements. In an m-Way tree of… Read More »

- Count common characters in two strings
- Repeated Character Whose First Appearance is Leftmost
- Coin Change | BFS Approach
- Maximum element in a sorted and rotated array
- Count the triplets such that A[i] < B[j] < C[k]
- Partition an array of non-negative integers into two subsets such that average of both the subsets is equal
- Complexity Analysis of Binary Search
- Minimum number of times A has to be repeated such that B is a substring of it
- Split the given array into K sub-arrays such that maximum sum of all sub arrays is minimum
- Pair with largest sum which is less than K in the array
- Minimum steps required to reach the end of a matrix | Set 2
- Implement a Dictionary using Trie
- Count duplicates in a given linked list
- Given an array and two integers l and r, find the kth largest element in the range [l, r]
- Partition the array into three equal sum segments
- Persistent Trie | Set 1 (Introduction)
- Find the number of elements greater than k in a sorted array
- Longest string in an array which matches with prefix of the given string
- Sort an array of strings based on the frequency of good words in them
- Maximum length palindromic substring such that it starts and ends with given char
- Find missing element in a sorted array of consecutive numbers
- Find the Nth term divisible by a or b or c
- Divide array into two parts with equal sum according to the given constraints
- Remove all occurrences of any element for maximum array sum
- Queries to find the first non-repeating character in the sub-string of a string
- Create a Sorted Array Using Binary Search
- Find the minimum number of rectangles left after inserting one into another
- Find the winner of the match | Multiple Queries
- Square root of a number without using sqrt() function
- Minimize the number of steps required to reach the end of the array | Set 2

The m-way search trees are multi-way trees which are generalised versions of binary trees where each node contains multiple elements. In an m-Way tree of… Read More »

Given an array arr[] of length N. The task is to find the length of the longest subarray in which elements greater than a given… Read More »

Given an array A[] of size N with entries as integers, some of the entries are -1. The task is to replace -1’s with numbers… 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 »

Given a number N, the task is to find the square root of N without using sqrt() function. Examples: Input: N = 25 Output: 5… 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 two strings A and B. The task is to find the minimum number of times A has to be repeated such that B is… Read More »

Trie is an efficient information retrieval data structure. Using Trie, search complexities can be brought to an optimal limit (key length). The task is to… Read More »

Implement a dictionary using Trie such that if the input is a string representing a word, the program prints its meaning from the prebuilt dictionary.… Read More »

Given an array a of size N. The task is to find an index ‘i’ (1 <= i <= N) such that (a[1] ^ …… Read More »

Given an array arr[] of strings, the task is to print the strings from the array which are not prefix of any other string from… Read More »

Given an array of size N. The task is to partition the given array into two subsets such that the average of all the elements… Read More »

Given an infinitely long binary tree having a pattern as below: 1 / \ 2 3 / \ / \ 4 5 6 7 /… Read More »

Given a string str and a character ch, the task is to find the longest palindromic sub-string of str such that it starts and ends… Read More »

Given a set of product reviews (R) by different customers and a string S containing good words separated by a _, the task is to… Read More »