There are N coins kept on the table, numbered from 0 to N – 1. Initially, each coin is kept tails up. You have to perform two types of operations

This type of problem can be solved easily using Dynamic Programming. In this problem, you are generally given two sequences and you need to find the length of the common subsequence present in them

Problem Statement A positive integer is called a palindrome if its representation in the decimal system is the same when read from left to right and from right to left. For a…

Use Cases Printing with variables Beautifying the printed statements Both of them Floating Point Numbers Floating point numbers can use format %m.nf where m represents total minimum number of digits a string should…

Description Escape sequences are the sequence of characters that is translated into other characters or a sequence of characters that are difficult to represent directly. All the escape sequences contain…

Strings are used in python for recording text information such as address. Python Strings are basically a sequence, i.e. python keeps track of each and every element of the string…

Problem Statement Rohit dreams he is in a shop with an infinite amount of marbles. He is allowed to select n marbles. There are marbles of k different colors. From…

Problem Statement Little kids, Jack and Evan like playing their favorite game Glass-and-Stone. Today they want to play something new and came across Twitter on their father’s laptop. They saw…

Problem Statement In Byteland they have a very strange monetary system. Each Bytelandian gold coin has an integer number written on it. A coin n can be exchanged in a…