-
LeetCode Solution for “Non-decreasing Subsequences” | by Kapoordeepjyotsingh | Medium
Given an integer array nums, return all the different possible non-decreasing subsequences of the given array with at least two elements. You may return the answer in any order.
-
688. Knight Probability in Chessboard | by Kapoordeepjyotsingh | Medium
On an n x n chessboard, a knight starts at the cell (row, column) and attempts to make exactly k moves. The rows and columns are 0-indexed, so the top-left cell is (0, 0), and the bottom-right cell…
-
377. Combination Sum IV [LeetCode] | by Kapoordeepjyotsingh | Medium
Given an array of distinct integers nums and a target integer target, return the number of possible combinations that add up to target. Insight: We can see that numbers in nums array can be repeated…