Problem: Practice your stack data structure. You will be given a series of tasks of push, pop, peek operations to perform on a stack. You need to print the sum of the final stack. Input: First line contains

Problem: Ethan has a possible list of password to hack a secure account. To select the correct password, he researched the owner and discovered that the account's owner is very fond of acronyms. After

Problem: You will be given two numbers, a and b, in their binary form. You need to print their sum and their product in binary. Input: Two strings separated by space representing the binary values of a

Problem: A Power Number is a positive number that can be expressed as x^x, i.e. x raise to the power of x, where x is any positive number. You will be given an integer array A and you need to print if

Problem: Cody was once understanding numbers, their squares and perfect squares from his teacher. A perfect square is a number that can be expressed as square of an integer. To check how much Cody understood

Problem: Cody is preparing for a programming competition. He needs k more members for his team to be eligible for the competition. So he organizes a coding test for all his juniors to select the best group.

Problem: In mathematics, an arithmetic progression (AP) or arithmetic sequence is a sequence of numbers such that the difference between the consecutive terms is constant. John was writing an Arithmetic

Problem: Dcoder has N members each numbered from 1 to N. A member admires other member if its number divides the other member's number. Given a number N you need to find the number of people with odd number

Problem: You will be given a group of words. You need to print all unique words in that group in descending order of their frequency, i.e the word repeated most number of times will come first. In case

Problem: You are given 2 numbers N and M. You have to find the smallest number which when multiplied to N makes it a multiple of M. Input: First line contains T, number of test cases. Each of the next

Problem: Given a matrix of dimensions N x N. Print "YES"(without quotes) if it is a symmetric matrix, else print "NO"(without quotes). Input: First line contains N. Each of following

Problem: Hulk is participating in a wrestling championship. The contest consists of N fighters including Hulk. The contest is of several stages. At each stage, if number of fighters are X, then there are

DESCRIPTION: This time no story, no theory. The examples below show you how to write function accum: Examples: accum("abcd") -> "A-Bb-Ccc-Dddd" accum("RqaEzty") ->

Problem: Alice recently discovered programming.Help Alice to code her first Program. Input: Output: Hello World Constraints: Sample Input: Sample Output: Hello World print ("Hello World")

Problem: Ariel & Eric have a child, help them teaching him Counting from 1 to 10. Input: Output: Output should be 1 to 10 separated with a new line character "\n" Constraints: Sample Input:

Problem: The numbers 1,2,3.. are known as Natural numbers. Calculate the sum of all the natural numbers from 1 to N, where N will be the input. Input: A positive integer N Output: Output will be sum of

Problem: If n is an integer greater than 0, n factorial (n!) is the product: n* (n-1) * (n-2) * ( n-3)… * By convention, 0! = 1. Write a Program to compute n Factorial(n!), where n is input. Input: n is

Problem: A town in Death Valley has a water tank that contains 10,000 gallons of water. If there is no rain, calculate the number of weeks the water will last for an input weekly water usage. Input: Input

Problem: The Jones Trucking Company tracks the location of each of its trucks on a grid similar to an (x, y) plane. The home office is at location (0, 0). Read the coordinates of truck A and the coordinates

Problem: Write a program to play a variety of BlackJack. In general, given two numbers, a and b, return their sum. If the sum is greater than 21, return 0, unless one of the numbers is 11. In such a case,