You are given N identical eggs and access to a building with k floors. Your task is to find the lowest floor that will cause an egg to break, if dropped from that floor. Once an egg breaks, it cannot be dropped again. If an egg breaks when dropped from the xth floor, you can… Read More »
Given a list of numbers, create an algorithm that arranges them in order to form the largest possible integer. For example, given [10, 7, 76, 415], you should return 77641510. Javascript function largestNumber(nums) { nums.sort((a, b) => { const order1 = String(a) + String(b); const order2 = String(b) + String(a); return order2.localeCompare(order1); … Read More »
There are N prisoners standing in a circle, waiting to be executed. The executions are carried out starting with the kth person, and removing every successive kth person going clockwise until there is no one left. Given N and k, write an algorithm to determine where a prisoner should stand in order to be the… Read More »
Java public class SmallestPositiveInteger { public static int findSmallestPositiveInteger(int[] nums) { int smallest = 1; for (int num : nums) { if (num <= smallest) { smallest += num; } else… Read More »