Author: Ionut Paun

Cerinta completa James found a love letter that his friend Harry has written to his girlfriend. James is a prankster, so he decides to meddle with the letter. He changes all the words in the letter into palindromes. To do

Cerinta completa It is the Indian version of the famous heist “The Italian Job”. N robbers have already broken into the National Museum and are just about to get inside the main vault which is full of jewels. They were

Cerinta completa Given an array of distinct elements. Let and be the smallest and the next smallest element in the interval where . . where , are the bitwise operators , and respectively. Your task is to find the maximum

Cerinta completa A war has broken down between Vim and Emacs. Gedit, being Vim’s ally, is captured by Emacs as a prisoner of war and it is up to Vim to rescue him by defeating Emacs. For this task, Vim

Cerinta completa A video player plays a game in which the character competes in a hurdle race. Hurdles are of varying heights, and the characters have a maximum height they can jump. There is a magic potion they can take

Cerinta completa Divide-and-Conquer on a tree is a powerful approach to solving tree problems. Imagine a tree, , with vertices. Let’s remove some vertex from tree , splitting into zero or more connected components, , with vertices . We can

Cerinta completa Use the counting sort to order a list of strings associated with integers. If two strings are associated with the same integer, they must be printed in their original order, i.e. your sorting algorithm should be stable. There

Cerinta completa In this challenge, the task is to debug the existing code to successfully execute all provided test files. Given an array of distinct integers, transform the array into a zig zag sequence by permuting the array elements. A

Cerinta completa For an upcoming programming contest, Roy is forming some teams from the students of his university. A team can have any number of contestants. Roy knows the skill level of each contestant. To make the teams work as

Cerinta completa Given an amount and the denominations of coins available, determine how many ways change can be made for amount. There is a limitless supply of each coin type. Example There are ways to make change for : ,