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.
Category: Competitive Programming
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).
Minimum Moves to Equal Array Elements – LeetCode Solution [Medium]
When we increment n – 1 elements, the relative difference between the highest number and all other numbers effectively decreases by 1.
Bitmasking
You’ve N elements and you need to find the subsets of these N elements where zero or more of the N elements are included or excluded.
Advanced Competitive Programming Concepts
These are the articles, dedicated specifically to advanced competitive programming concepts. Modular Multiplicative Inverse, Nth Catalan Number.