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 »
Category Archives: Searching
Implement a Dictionary using Trie
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 »
Find a partition point in array to maximize its xor sum
Given an array a of size N. The task is to find an index ‘i’ (1 <= i <= N) such that (a[1] ^ …… Read More »
Strings from an array which are not prefix of any other string
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 »
Partition an array of non-negative integers into two subsets such that average of both the subsets is equal
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 »
Find the color of given node in an infinite binary tree
Given an infinitely long binary tree having a pattern as below: 1 / \ 2 3 / \ / \ 4 5 6 7 /… Read More »
Maximum length palindromic substring such that it starts and ends with given char
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 »
Sort an array of strings based on the frequency of good words in them
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 »
Count of strings in the first array which are smaller than every string in the second array
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 »
Longest sub-array with equal number of alphabets and numeric characters
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 »
Find Leftmost and Rightmost node of BST from its given preorder traversal
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 »
Distinct adjacent elements in a binary array
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 »
Find the position of the given row in a 2-D array
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 »
Number of subarrays having absolute sum greater than K | Set-2
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 »
Number of intersections between two ranges
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 »
