Given a compressed binary integer, find the next largest binary integer having the same number of 1s and compress that number.
Morgan and a String!Expert
Find the lexicographically minimal string that can be formed by the combination of two strings.
Save the Prisoner!Easy
Given M sweets and a circular queue of N prisoners, find the ID of the last prisoner to receive a sweet.
Find the minimum units of energy with which bot should start to successfully complete the game.
Given a string containing three types of brackets, determine if it is balanced.