## Check if a string can be split into two strings with same number of K-frequent characters

Given a string S and an integer K, the task is to check if it is possible to distribute these characters into two strings such… 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 a string S and an integer K, the task is to check if it is possible to distribute these characters into two strings such… Read More »

Given a bitonic array arr[] the task is to sort the given bitonic array. A Bitonic Sequence is a sequence of numbers that is first… Read More »

QuickSort is a popular sorting technique based on divide and conquer algorithm. In this technique, an element is chosen as a pivot and the array… Read More »

Given an array, arr[] of N integers, the task is to rearrange the array elements such that the smallest element is at the 0th position,… Read More »

Given an integer K and an array A[ ] whose length is multiple of K, the task is to split the elements of the given… Read More »

Given two integers N and M, the task is to find the numbers of ways to form a matrix of size N * M consisting… Read More »

Given a string str consisting of lowercase alphabets, the task is to find the number of possible substrings (not necessarily distinct) that consists of distinct… Read More »

Given an array arr[] and a target value K. The task is to find the minimum number of steps required to take all elements from… Read More »

Given a binary array arr[], the task is to find the longest subarray of non-empty cells after the removal of at most 1 empty cell.… Read More »

Given two numbers N and K, the task is to find the minimum value X such that N < X*K. Examples: Input: N = 8,… Read More »

Given two positive integers S and X which represents the sum and Bitwise XOR of all the elements of an array arr[]. The task is… Read More »

Given two integers N and K, the task is to find the count of N-digit numbers such that the absolute difference of adjacent digits in… Read More »

Given a valid parenthesis string S, the task is to find the weight of parenthesis based on the following conditions: Weight of “( )” is… Read More »

Given an array arr[] having N integers and an integer K, the task is to select K elements from the given array such that sum… Read More »

Given a matrix mat[][] of size M*N, the task is to sort only the border elements of the matrix in the clockwise direction and print… Read More »