Aman String
Concepts Used Strings Difficulty Level Easy Problem Statement (Simplified): Find the total number of pairs of indexes (i , j) such as subString(i , j) contains aman atleast once. See...
Anagram or Not
Concepts Used Strings, Hashing Difficulty Level Easy Problem Statement (Simplified): Check if string B can be achieved by A by rearranging letters of A. If yes print Yes else No;...
Square Moves
Concepts Used Strings, Hash Table Difficulty Level Hard Problem Statement (Simplified): Find the total number of children standing on each square after 10100 rotations by every individual child. Each child...
Fraction to Float
Concepts Used Strings Difficulty Level Hard Problem Statement (Simplified): Print the decimal output of the fraction of two given numbers and enclose the repeating part in decimal places in brackets....