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
Category: Competitive Programming
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).
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.
Valid Anagram – LeetCode Solution in O(n) [Easy]
Given two strings s and t, return true if t is an anagram of s, and false otherwise. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase
Line Problem Solution | CodeChef [Easy]
Consider the 2D grid formed by integer points on the XY Plane. The position of the Sniper and the Target are lattice points in this grid. The bullet shot by the Sniper will follow a straight line trajectory from (x1, y1) to (x2, y2). The bullet goes no further than (x2, y2).