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).
String encryption Solution | CodeChef [Easy]
This problem is related to string handling and manipulation. So the original string which is sent to Cybertron is encrypted in the new string which comprises the letters followed by each time it has occurred in the original string.
Jump it up Solution | CodeChef [Easy]
Three dinos decide to play a game. In one move, one of the outer dinos can hop into a spot between the other two. Help them maximise their duration of play.
RectangleArea Solution | CodeChef [Easy]
There are several sticks each 1 inch long. Your job is to form a rectangle with the biggest possible area, using these sticks as the perimeter.
C++ Standard Template Library (STL) – [Pair and Tuple]
Pair in C++ STL is used to combine two values having different or same data types. It stores two different values as a single element. Tuple unlike pair can be used to combine two or more than two values having different or same data types.
How to build Chrome Extensions?
Every Chrome extension has a JSON-formatted manifest file, named manifest.json, that provides important information for the Chrome extension.
Minimum adjacent swaps required to sort Binary Array in O(n) | Amazon Interview Question
Given an array consisting of only 1s and 0s, sort this binary array such that all 0s are on the left and all 1s are on the right.
Tower of Hanoi | Recursion
The Tower of Hanoi is a mathematical puzzle (game) consisting of three rods and a number of disks.
The objective of the puzzle is to move all the disks from the first rod (A) to the next rod (B) using the auxiliary rod (C).
Lucy and Flowers | HackerRank Solution [Medium]
The number of possible Binary Search Trees with n keys is Catalan Number (Cn). You could learn about Catalan Number & Binomial Coefficient.