Problem After spending many hours studying for programming competitions, you decided to take a rest and play video games. You are currently playing an adventure game called Quick Start. This game has N levels, and you are currently on the K-th level. Unfortunately, you just realized that to beat the boss…

Problem Avery has an array of N positive integers. The i-th integer of the array is Ai. A contiguous subarray is an m-countdown if it is of length m and contains the integers m, m-1, m-2, …, 2, 1 in that order. For example, [3, 2, 1] is a 3-countdown. Can…

Problem Li has planned a bike tour through the mountains of Switzerland. His tour consists of N checkpoints, numbered from 1 to N in the order he will visit them. The i-th checkpoint has a height of Hi. A checkpoint is a peak if: It is not the 1st checkpoint or…

Problem There are N houses for sale. The i-th house costs Ai dollars to buy. You have a budget of B dollars to spend. What is the maximum number of houses you can buy? Input The first line of the input gives the number of test cases, T. T test cases follow…

problem statement: In Olympics, the countries are ranked by the total number of medals won. You are given six integers G1, S1, B1, and G2, S2, B2 , the number of gold, silver and bronze medals won by two different counties respectively. Determine which country is ranked better on the…

Problem Statement: Given an unsorted array arr[] of size N, rotate it by D elements (clockwise). Input: The first line of the input contains T denoting the number of testcases. First line of each test case contains two space separated elements, N denoting the size of the array and an…

Problem Statement: Jarvis is weak in computing palindromes for Alphanumeric characters. While Ironman is busy fighting Thanos, he needs to activate sonic punch but Jarvis is stuck in computing palindromes. You are given a string S containing alphanumeric characters. Find out whether the string is a palindrome or not. If…

Problem Statement: For a given 3 digit number, find whether it is armstrong number or not. An Armstrong number of three digits is an integer such that the sum of the cubes of its digits is equal to the number itself. Return “Yes” if it is a armstrong number else…

Problem Statement: You are given a sequence A1,A2,…,AN. An ordered pair of indices (i,j) in this sequence is called a beautiful pair if i≠j and Ai−AjAi<Ai−AjAj. (Here, division represents real division, e.g. 52 is equal to 2.50.) Help Chef find the number of beautiful pairs present in the given sequence. …