## Search in a trie Recursively

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 »

- Count common characters in two strings
- Repeated Character Whose First Appearance is Leftmost
- Maximum element in a sorted and rotated array
- Nagarro Interview Experience Off-campus
- Search element in a Spirally sorted Matrix
- Count the triplets such that A[i] < B[j] < C[k]
- Coin Change | BFS Approach
- Partition an array of non-negative integers into two subsets such that average of both the subsets is equal
- Minimum steps required to reach the end of a matrix | Set 2
- Find a distinct pair (x, y) in given range such that x divides y
- 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
- Longest string in an array which matches with prefix of the given string
- Persistent Trie | Set 1 (Introduction)
- Find missing element in a sorted array of consecutive numbers
- Count duplicates in a given linked list
- Split the given array into K sub-arrays such that maximum sum of all sub arrays is minimum
- Find the number of elements greater than k in a sorted array
- Remove all occurrences of any element for maximum array sum
- Maximum length palindromic substring such that it starts and ends with given char
- Find the Nth term divisible by a or b or c
- Find the minimum number of rectangles left after inserting one into another
- Divide array into two parts with equal sum according to the given constraints
- Queries to find the first non-repeating character in the sub-string of a string
- Two equal sum segment range queries
- Complexity Analysis of Binary Search
- Create a Sorted Array Using Binary Search
- Find maximum sum taking every Kth element in the array
- Count the number of operations required to reduce the given number
- Maximum possible middle element of the array after deleting exactly k elements

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 »

Given two arrays A[] and B[] which consists of N and M strings respectively. A string S1 is said to be smaller than string S2… Read More »

Given an array of alphanumeric characters. The task is to find the longest contiguous sub-array which has equal numbers of letters (alphabets) and numbers (numeric… Read More »

Given a preorder sequence of the binary search tree of N nodes. The task is to find its leftmost and rightmost node. Examples: Input :… Read More »

Given a binary array arr[] of 1’s and 0’s of length N. The task is to find the number of elements which are different with… Read More »

Given a matrix mat[][] of size m * n which is sorted in row-wise fashion and an array row[], the task is to check if… Read More »

Given an integer array arr[] of length N consisting of both positive and negative integers, the task is to find the number of sub-arrays with… Read More »

Given N ranges of type1 ranges and M ranges of type2.The task is to find the total number of intersections between all possible type1 and… Read More »