## Longest Increasing Subsequence having sum value atmost K

Given an integer array arr[] of size N and an integer K. The task is to find length of longest subsequence whose sum is less… Read More »

- Must do Math for Competitive Programming
- Array of Vectors in C++ STL
- Breadth First Search without using Queue
- Minimize the maximum difference between adjacent elements in an array
- How is the time complexity of Sieve of Eratosthenes is n*log(log(n))?
- Shortest Path Faster Algorithm
- Maximum sum path in a Matrix
- Basic Algorithm Techniques Not Taught in Academics
- Role of SemiColon in various Programming Languages
- Maximum number of unique values in the array after performing given operations
- Sum of GCD of all possible sequences
- Traveling Salesman Problem using Genetic Algorithm
- Minimum Cost Graph
- Median of an unsorted array using Quick Select Algorithm
- Maximum LCM among all pairs (i, j) from the given Array
- Count of subarrays which start and end with the same element
- Word Break Problem | DP-32 | Set - 2
- Huffman Coding using Priority Queue
- Find lexicographically smallest string in at most one swaps
- Kth most frequent Character in a given String
- Operator Overloading '<<' and '>>' operator in a linked list class
- Longest Mountain Subarray
- Check if sum of any subarray is Palindrome or not
- What is a Webcrawler and where is it used?
- 0/1 Knapsack Problem to print all possible solutions
- Sort an Array which contain 1 to N values in O(N) using Cycle Sort
- Minimum increment or decrement required to sort the array | Top-down Approach
- Find maximum subset sum formed by partitioning any subset of array into 2 partitions with equal sum
- Find last remaining element after reducing the Array
- Longest common subarray in the given two arrays

Given an integer array arr[] of size N and an integer K. The task is to find length of longest subsequence whose sum is less… Read More »

Given an array integer arr[] of size N and Q queries. Each query is of the form (L, R), where L and R are indices… Read More »

Given an array interval of pairs of integers representing the starting and ending points of the interval of size N. The task is to find… Read More »

Given a string S of length N, and Q queries of the following type: Type 1: 1 i X Update the i-th character of the… Read More »

Given an integer array arr of size N which contains distinct elements from 1 to N. The task is to check if a position in… Read More »

Given an integer array arr of size N. The task is to find the maximum number of splits such that each split has sum divisible… Read More »

Given an integer array arr[] of size N and two integer L and R. The task is to find the maximum sum subarray of size… Read More »

Given an array arr[] consisting of N integers, the task is to find the start and end indices of the first subarray with a Negative… Read More »

Given an integer N which is the number of sides of a regular polygon. The task is to find the smallest angle of rotation such… Read More »

Given a rod of length N meters, and the rod can be cut in only 3 sizes A, B and C. The task is to… Read More »

Two players are playing a game starting with a number n. In each turn, a player can make any one of the subsequent moves: Divide… Read More »

Given a string str of size N containing two types of character only that are “I” or “D”. The task is to generate an array… Read More »

Given a URL as a character string str of size N.The task is to check if the given URL is valid or not. Examples :… Read More »

Given a Binary Tree, the task is to print the nodes that have grandchildren. Examples: Input: Output: 20 8 Explanation: 20 and 8 are the… Read More »

Given a Binary Tree and a positive integer K. The task is to check whether the Balanced BST of size K exist in a given… Read More »