Skip to content

Tag Archives: partition

Given a linked list consisting of N nodes and an integer K, the task is to split the given Linked List into K continuous groups… Read More
Given an array arr[] consisting of N integers, the task is to print the smaller of the two subsets obtained by splitting the array into… Read More
Given an array arr[] consisting of N integers and an integer K, the task is to find the maximum number of disjoint subsets that the… Read More
Given two arrays arr[] and S[] consisting of N and K integers, the task is to find the maximum sum of minimum and maximum of… Read More
Given an array arr[] consisting of N integers, the task is to split the array into subarrays such that the sum of the difference between… Read More
Given a string S consisting of N lowercase alphabets, the task is to check if it is possible to split the string S into three… Read More
Given a string S consisting of N lowercase alphabets, the task is to check if all the strings of at least length 2 formed by… Read More
Given an array arr[] consisting of N integers, the task is to partition the array into two non-empty subarrays such that every element present in… Read More
Given a positive even number N, the task is to split the first N powers of 2 into two equal sequences such that the absolute… Read More
Given a string S, the task is to check if the string can be split into two substrings such that the number of vowels in… Read More
Given an array arr[] of size N, the task is to split the array into the minimum number of subsets such that every element belongs… Read More
Given an array arr[] consisting of N integers and an integer K, the task is to find the number of ways to split the array… Read More
Given string str, the task is to split the string into the maximum number of unique substrings possible and print their count. Examples:  Input: str… Read More
Given an array arr[] of size N and a positive integer X, the task is to partition the array into the maximum number of subsets… Read More

Start Your Coding Journey Now!