Treap (Tree + Heap)
Treap is an efficient and simple data structure that combines the best of both binary search trees and heaps. It provides the benefits of efficient search, insert, and delete operations.
Category: Competitive Programming
Max of All Subarrays of Size k Using Max Heap in C++
This problem, also referred to as the “sliding window maximum” problem, can be efficiently solved using heaps. We’ve already discussed an O(n) solution.
Finding All Subsequences of a String Using Python | Iterative vs Recursive
Subsequences derived from strings by deleting some or no characters without changing order, are crucial in fields like bioinformatics, data mining, and cryptography.
Understanding Linearity of Expectation
Linearity of expectation is a powerful concept in probability theory that simplifies the calculation of expected values in probabilistic experiments.
Finding the Next Lexicographically Greater Permutation
Given an input sequence in the form of an array, find the lexicographically next greater permutation if it exists.
Finding Permutations that Form the Sum | Coin Change Permutation
Find the number of permutations to form the target sum using the elements of the given array, with repetition allowed.
Search a sorted 2D Matrix
This method has the limitation that it will work for only those matrix where the first integer of each row is greater than the last integer of the previous row.
Nim’s Game | Code Implementation
Nim’s game is played with a set of heaps, each containing a certain number of objects or stones. Two players take turns removing objects from the heaps
Non-decreasing Subsequences Solution – LeetCode Solution [Medium]
Given an integer array nums, return all the different possible non-decreasing subsequences of the given array with at least two elements.
Is Subsequence – LeetCode Solution [Easy]
Given two strings s and t, return true if s is a subsequence of t, or false otherwise.