## Maximum Sum Increasing Subsequence using Binary Indexed Tree

Given an array of size n. Find the maximum sum an increasing subsequence. Examples: Input : arr[] = { 1, 20, 4, 2, 5 }… Read More »

- Design a Chess Game
- Remove minimum elements from either side such that 2*min becomes more than max | Set 2
- Kth smallest element in a subarray
- Rearrange numbers in an array such that no two adjacent numbers are same
- Lazy Propagation in Segment Tree | Set 2
- Range Queries to Find number of sub-arrays with a given xor
- Trie Data Structure using smart pointer and OOP in C++
- Given an array and two integers l and r, find the kth largest element in the range [l, r]
- Longest string in an array which matches with prefix of the given string
- Persistent Trie | Set 1 (Introduction)
- Implement a Dictionary using Trie
- Count of strings whose prefix match with the given string to a given length k
- 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
- Flipping Sign Problem | Lazy Propagation Segment Tree
- 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
- Gap Buffer Data Structure
- Find a pair from the given array with maximum nCr value
- Count smaller elements on right side and greater elements on left side using Binary Index Tree
- Bottom-up traversal of a Trie
- 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
- Search in a trie Recursively
- Insertion in a Trie recursively
- B*-Trees implementation in C++
- Proto Van Emde Boas Tree | Set 2 | Construction

Given an array of size n. Find the maximum sum an increasing subsequence. Examples: Input : arr[] = { 1, 20, 4, 2, 5 }… Read More »

The current article would deal with the concepts surrounding the complex networks using the python library Networkx. It is a Python language software package for… Read More »

Pre-requisite: Suffix Array. What are k-mers? The term k-mer typically refers to all the possible substrings of length k that are contained in a string.… Read More »

Tango Tree is an online algorithm. It is a type of binary search tree. It is better than the offline weight balanced binary search tree… Read More »

Self Organizing list is a list that re-organizes or re-arranges itself for better performance. In a simple list, an item to be searched is looked… Read More »

We have an array arr[]. We need to find the sum of all the elements in the range L and R where 0 <= L… Read More »

Given an array of strings, print them in alphabetical (dictionary) order. If there are duplicates in input array, we need to print all the occurrences.… Read More »

Check whether a given graph contains a cycle or not. Example: Input: Output: Graph contains Cycle. Input: Output: Graph does not contain Cycle. Prerequisites: Disjoint… Read More »

Decision tree algorithm falls under the category of supervised learning. They can be used to solve both regression and classification problems. Decision tree uses the… Read More »

Let us consider the following problem to understand Segment Trees. We have an array arr[0 . . . n-1]. We should be able to 1… Read More »

We have briefly discussed sparse table in Range Minimum Query (Square Root Decomposition and Sparse Table) Sparse table concept is used for fast queries on… Read More »

Given a string s, break s such that every substring of the partition can be found in the dictionary. Return the minimum break needed. Examples:… Read More »

In this article we will see that how to calculate number of elements which are greater than given value in AVL tree. Examples: Input :… Read More »

What is the Burrows-Wheeler Transform? The BWT is a data transformation algorithm that restructures data in such a way that the transformed message is more… Read More »