#dcoder

Problem: Natural numbers are the set of positive integers, which ranges from 1 to infinity excluding fractional part. Natural numbers are whole numbers excluding zero. Zero is the only whole number which

Problem: José is from South America and hence, Spanish is his mother tongue. He wants to travel around the world and, therefore, decides to learn various languages, starting with English. He tries to learn

Problem: A word or a sentence is called a pangram if all the characters of this language appear in it at least once, either in lowercase or in uppercase. You are given a string S consisting of lowercase

Problem: Ron is schizophrenic and sees random digits hidden in words. He thinks it means something and someone is trying to secretly communicate with him. He wants to extract those digits from the words

Problem: Nemo is a little kid in Word-World who always gets mixed in a group of other words and gets lost. Marlin and Coral (Nemo's parents) are quite desperate and called you for help every time Nemo

Problem: You will be given a single string and two positive integers denoting indices. You need to change the case of the characters at those indices,i.e change uppercase to lowercase and lowercase to

Problem: You are given an integer array and you have to find the sum of the elements of the array and find the remainder when the sum is divided by the largest number of the array. Input: First line contains

Problem: This problem requires you to create a output string from input string such that for every character in input string, there are three same characters in output string. Input: First line contains

Problem: Tom is a scientist. He uses huge machines for complex calculations. There is a problem, the machines takes input as Fahrenheit and Tom has the temperatures in Degree Celsius. As he is busy with

Problem: A happy string is a string in which each character is lexicographically greater than its next character. You are given a positive integer N as an input. You need to print the smallest lexicographical

Problem: All numbers in NumberLand are standing in a circle for a dancing ceremony. Every number needs a dancing partner. Dancing partner of any number is the number which is standing radially opposite

Problem: There are N students in a class and Teacher want to divide these students into some groups . Teacher told that groups consisting of two or less students not allowed , so Teacher want to have as

Problem: Steve is playing a quiz game with his brother John. As Steve just learned the concept of leap year, John wanted to test his knowledge. For that, John started to ask Steve whether a year is a leap

Problem: Cody has a sequence of characters N. He likes a sequence if it contains his favourite sequence as a substring. Given the sequence and his favourite sequence F, check whether the favourite sequence

Problem: The SwapMaster is known to be the greatest and fastest swapper of all time. You intend to bring him down and become the new SwapMaster of the city. Through some secret sources, you found out that

Problem: Bob has a floating point number N. He wants to set the precision for 2 digits after the decimal point for the number. He is not good at coding, hence looking for your help. Input: The first line

Problem: You are given an array of N length. You have to rotate the array rightwards by K rotations, that is, shift each element to the right by K positions. Print the rotated array. Input: First line

Problem: You are given an array of N length. You have to rotate the array rightwards by K rotations, that is, shift each element to the right by K positions. Print the rotated array. Input: First line

Problem: Given an array A of size N and K. count all the number of elements such that A[i] * 2 = K. Input: The first line of the input contains a single integer T denoting the number of test cases. The

Problem: This is to provide you with an introductory experience of bit-wise operations. There are basically six bit-wise operations in any programming language : - AND(&), OR(|), XOR(^), NOT(~), left-shift