QUESTION: Reverse a given stack of 'N' integers using recursion. Note: You are not allowed to use any extra space other than the internal stack space

QUESTION: Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.

QUESTION: Given an undirected graph and an integer M. The task is to determine if the graph can be colored with at most M colors such that no two adja

QUESTION: Given a non-negative number N, set the rightmost unset bit in its binary representation. If there are no unset bits, leave the number as it

QUESTION: Consider a rat placed at (0, 0) in a square matrix of order N * N. It has to reach the destination at (N - 1, N - 1). Find all possible path

Function to calculate the largest rectangle area in a histogram represented by heights

Helper function to calculate the next smaller element index for each element in an array

CODE:- function to find the next non-zero element

QUESTION: Given a stack, the task is to sort it such that the top of the stack has the greatest element. Example 1: Input: Stack: 3 2 1 Output: 3 2 1

NOTE:- The code could be more concise if done in double traversal but I find this more intuitive

Helper function to calculate the previous smaller element index for each element in an array

QUESTION: Given an array of integers arr, find the sum of min(b), where b ranges over every (contiguous) subarray of arr. Since the answer may be larg

QUESTION: Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the cand

QUESTION: Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the ans

QUESTION: Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the

QUESTION: Given an integer array nums of unique elements, return all possible subsets (the power set). Example 1: Input: nums = [1,2,3] Output: [[],[

QUESTION: Given a list arr of N integers, print the sums of all subsets in it. Example: Input: N = 2 arr[] = {2, 3} Output: 0 2 3 5 Explanation: When

QUESTION: Find all valid combinations of k numbers that sum up to n such that the following conditions are true: - Only numbers 1 through 9 are used.

QUESTION: Given an array arr[] of non-negative integers and an integer sum, the task is to count all subsets of the given array with a sum equal to th