## Split numbers from 1 to N into two equal sum subsets

Given an integer N, the task is to divide the numbers from 1 to N into two nonempty subsets such that the sum of elements… Read More »

- Minimize the maximum difference between adjacent elements in an array
- Maximum sum path in a Matrix
- Stack of Pair in C++ STL with Examples
- Set of Vectors in C++ STL with Examples
- Queue of Pairs in C++ STL with Examples
- Find the K closest points to origin using Priority Queue
- Convert Adjacency Matrix to Adjacency List representation of Graph
- Count of subarrays which start and end with the same element
- Real-time application of Data Structures
- Program to reverse words in a given string in C++
- Find the string formed by joining k consecutive nodes of linked list
- Kth most frequent Character in a given String
- Implementing upper_bound() and lower_bound() for Ordered Set in C++
- Longest Mountain Subarray
- What is a Webcrawler and where is it used?
- Count the number of ways to construct the target string
- Reverse an array in groups of given size | Set 3 (Single traversal)
- Count triplets such that sum of any two number is equal to third | Set 2
- Why Prim’s and Kruskal's MST algorithm fails for Directed Graph?
- CamelCase Pattern Matching
- Program to find frequency of each element in a vector using map in C++
- Find if there is a path between two vertices in an undirected graph
- Count ways to partition a string such that both parts have equal distinct characters
- Design a Queue data structure to get minimum or maximum in O(1) time
- Paranthesis Theorem
- Shortest path in a directed graph by Dijkstra’s algorithm
- Duplicates Removal in Array using BST
- Dynamic Segment Trees : Online Queries for Range Sum with Point Updates
- Longest subarray whose elements can be made equal by maximum K increments
- XOR of elements in a given range with updates using Fenwick Tree

Given an integer N, the task is to divide the numbers from 1 to N into two nonempty subsets such that the sum of elements… Read More »

Given a binary string str containing only 0 and 1, the task is to find the number of sub-strings containing only 1s and 0s respectively,… Read More »

Given a matrix mat[][] with N rows and M columns. The task is to find the minimum number of changes required in the matrix such… Read More »

Given an array arr[] and an integer K, that task is to choose at most K elements of the array and replace it by any… Read More »

Given an array arr[] consisting of N elements, the task is to find the length of longest subarray with odd product. Examples: Input: arr[] =… Read More »

Given an array arr[] of size N, the task is to count the number of array elements such that all the elements to its left… Read More »

Give two strings S1 and S2, the task is to check whether string S1 can be made equal to string S2 by reversing substring from… Read More »

Given an array arr[] of N strings. The task is to find the count of all possible pairs of strings such that their concatenations has… Read More »

Given an array arr[] of integers of size N, the task is to find the closest pair in the given array such that one element… Read More »

Given a string str, the task is to count all the bitonic substrings of the given string. A bitonic substring is a substring of the… Read More »

Given an array arr[] of N positive integers. The task is to find the minimum LCM of all subarrays of size greater than 1. Examples: … Read More »

Given a binary string str, the task is to count the number of substrings of the given string str such that each character of the… Read More »

Given an array arr[] of N positive integers, the task is to find the largest strictly increasing subsequence of arr[] such that the indices of… Read More »

Given a string str which stores the time in the 24 hours fomat as “HH:MM”. The task is to find the minimum minutes needs to… Read More »

Array: An Array is a collection of items stored at contiguous memory locations. The idea is to store multiple items of the same type together.… Read More »