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.
Category: Competitive Programming
Search a sorted 2D Matrix
This method has the limitation that it will work for only those matrix where the first integer of each row is greater than the last integer of the previous row.
Nim’s Game | Code Implementation
Nim’s game is played with a set of heaps, each containing a certain number of objects or stones. Two players take turns removing objects from the heaps
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.
Is Subsequence – LeetCode Solution [Easy]
Given two strings s and t, return true if s is a subsequence of t, or false otherwise.
Coin Change II – LeetCode Solution [Medium]
You are given an integer array coins representing coins and an integer amount. Return the number of combinations that make up that amount.
Coin Change – LeetCode Solution [Medium]
You are given an integer vector coins[n] representing coins of different denominations and an integer amount representing a total amount of money.
Binary Search Explained | LeetCode Solution
Binary Search is a divide and conquer algorithm that finds a particular element within a sorted array or a given integer range.
Restaurant Rating Solution (Heap) | CodeChef [Medium]
Chef has opened up a new restaurant. He picks out the positive reviews and posts it on the website of the restaurant. A review is considered to be positive if it is among the top one-third of the total reviews when they are sorted by their rating.
Custom Comparators in C++
Custom Comparators are used to compare the members or objects of user-defined containers (class/data structure).