## 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 »

- Design a Chess Game
- Kth smallest element in a subarray
- Implement a Dictionary using Trie
- Rearrange numbers in an array such that no two adjacent numbers are same
- Trie Data Structure using smart pointer and OOP in C++
- Count smaller elements on right side and greater elements on left side using Binary Index Tree
- Persistent Trie | Set 1 (Introduction)
- Sort an array of strings based on the frequency of good words in them
- Longest string in an array which matches with prefix of the given string
- Count of strings whose prefix match with the given string to a given length k
- Queries for number of distinct elements in a subarray | Set 2
- Queries to update a given index and find gcd in range
- Flipping Sign Problem | Lazy Propagation Segment Tree
- Search in a trie Recursively
- Extendible Hashing (Dynamic approach to DBMS)
- Bottom-up traversal of a Trie
- Find the number of different numbers in the array after applying the given operation q times
- Gap Buffer Data Structure
- Count inversions in an array | Set 4 ( Using Trie )
- String Range Queries to find the number of subsets equal to a given String
- B*-Trees implementation in C++
- Insertion in a Trie recursively
- B-Tree Insert without aggressive splitting
- Van Emde Boas Tree | Set 1 | Basics and Construction
- Shortest cycle in an undirected unweighted graph
- Strings from an array which are not prefix of any other string
- Maximise the number of toys that can be purchased with amount K using min Heap
- Arrange array elements such that last digit of an element is equal to first digit of the next element
- Index of kth set bit in a binary array with update queries
- Number of triplets in array having subarray xor equal

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 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 a Trie, the task is to check if it contains words starting from every alphabet from [a – z]. Examples: Input: keys[] = {“element”,… Read More »

Problem Statement: The problem is to design a Chess Game using Object Oriented Principles. Asked In: Adobe, Amazon, Microsoft, etc. Solution: These type of questions… Read More »

Given an array of size N.There can be multiple queries of the following types. update(l, r) : On update, flip( multiply a[i] by -1) the… Read More »

Gap Buffer is a data structure used for editing and storing text in an efficient manner that is being currently edited. It is also similar… Read More »

Given an array of integers. The task is to rearrange elements of the array such that no two adjacent elements in the array are same.… Read More »

Given an array of strings arr[] and Q queries where each each query consists of a string str, the task is to find the longest… Read More »

Given an array of size N, initially consists of zeroes only. The task is to apply given operation q times and find the number of… Read More »

Prerequisite: Trie Persistency in Data Structure Trie is one handy data structure that often comes into play when performing multiple string lookups. In this post,… Read More »

B-Tree Insert without aggressive splitting This algorithm for insertion takes an entry, finds the leaf node where it belongs, and inserts it there. We recursively… Read More »

Given a binary array arr[] and q queries of following types: k: find the index of the kth set bit i.e. kth 1 in the… Read More »

Given an array arr[] of integers, the task is to arrange the array elements such that the last digit of an element is equal to… Read More »

Given an array of strings arr[] and given some queries where each query consists of a string str and an integer k. The task is… Read More »

Given an array arr[] of N integers and queries Q. Queries are of two types: Update a given index ind by X. Find the gcd… Read More »