## Check if the given string of words can be formed from words present in the dictionary

Given a string array of M words and a dictionary of N words. The task is to check if the given string of words can… Read More »

- Remove minimum elements from either side such that 2*min becomes more than max | Set 2
- Count of words that are present in all the given sentences
- Design a Chess Game
- Given an array and two integers l and r, find the kth largest element in the range [l, r]
- Count of strings whose prefix match with the given string to a given length k
- Lazy Propagation in Segment Tree | Set 2
- Longest string in an array which matches with prefix of the given string
- Persistent Trie | Set 1 (Introduction)
- Rearrange numbers in an array such that no two adjacent numbers are same
- Range Queries to Find number of sub-arrays with a given xor
- Program to implement Run Length Encoding using Linked Lists
- Sort an array of strings based on the frequency of good words in them
- Introduction to R-tree
- Queries to update a given index and find gcd in range
- Find triplet such that number of nodes connecting these triplets is maximum
- Find the number of different numbers in the array after applying the given operation q times
- Flipping Sign Problem | Lazy Propagation Segment Tree
- Find a pair from the given array with maximum nCr value
- B-Tree Insert without aggressive splitting
- 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
- Strings from an array which are not prefix of any other string
- Implement a Dictionary using Trie
- Insertion in a Trie recursively
- Gap Buffer Data Structure
- Check if the given Trie contains words starting from every alphabet
- Bottom-up traversal of a Trie
- Search in a trie Recursively

Given a string array of M words and a dictionary of N words. The task is to check if the given string of words can… Read More »

sklearn.preprocessing.Binarizer() is a method which belongs to preprocessing module. It plays a key role in the discretization of continuous feature values. Example #1: A continuous… Read More »

Given an array of n elements and q range queries (range sum in this article) with no updates, task is to answer these queries with… Read More »

Prerequisite – Hashing Introduction, Hashtable using Singly Linked List & Implementing our Own Hash Table with Separate Chaining in Java Implementing hash table using Chaining… Read More »

Coalesced hashing is a collision avoidance technique when there is a fixed sized data. It is a combination of both Separate chaining and Open addressing.… Read More »

Given an array of N numbers and Q queries, each query consists of L and R. We need to write a program that prints the… Read More »

Self-Balancing Binary Search Trees are height-balanced binary search trees that automatically keeps height as small as possible when insertion and deletion operations are performed on… Read More »

Given a binary tree, the task is to find the distance between two keys in a binary tree, no parent pointers are given. Distance between… Read More »

Inverted Index It is a data structure that stores mapping from words to documents or set of documents i.e. directs you from word to document.… Read More »

Euler tour of tree has been already discussed which flattens the hierarchical structure of tree into array which contains exactly 2*N-1 values. In this post,… Read More »

Given a binary tree, the task is to find the distance between two keys in a binary tree, no parent pointers are given. The distance… Read More »

A Levelwise GCD/LCM alternating segment tree is a segment tree, such that at every level the operations GCD and LCM alternate. In other words at… Read More »

Given a binary tree where each node can have at most two child nodes, the task is to find the Euler tour of the binary… Read More »

Given an array arr[0 . . . n-1]. Find the maximum of elements from index l to r where 0 <= l <= r <=… Read More »

Prerequisite :Basic knowledge of STL and Sets Data structure. About ordered set Ordered set is a policy based data structure in g++ that keeps the… Read More »