Finding Permutations that Form the Sum | Coin Change Permutation Find the number of permutations to form the target sum using the elements of the given array, with repetition allowed. Competitive Programming, Dynamic Programming
Non-decreasing Subsequences Solution – LeetCode Solution [Medium] Given an integer array nums, return all the different possible non-decreasing subsequences of the given array with at least two elements. Algorithms, Backtracking & Recursion, Competitive Programming
Find maximum of all subarrays of size k Given an array of size n and an integer k, we need to find the maximum for each contiguous subarray of size k. Arrays, Competitive Programming, Interview Questions