## Eat Bananas in K Hours

You are given a list of integers piles and an integer k. piles[i] represents the number of bananas on pile i. On each hour, you can choose any pile and eat r...

You are given a list of integers piles and an integer k. piles[i] represents the number of bananas on pile i. On each hour, you can choose any pile and eat r...

You are given a list of unique integers nums that is sorted in ascending order and is rotated at some pivot point. Find the maximum number in the rotated list.

Given a list of non-negative integers nums and an integer k, you can split the list into k non-empty sublists.

You are given a list of integers nums where each value represents a group of people looking to skydive together. You are also given k representing the number...

You are given a list of integers nums and an integer target. Return the lowest sum of pair of numbers that is greater than target. You can assume that a solu...

Given a list of integers nums, sorted in ascending order, and a number target, return the index where target should be inserted to keep nums sorted. If targe...

Given a non-negative integer n, find a number r such that r * r = n and round down to the nearest integer.

Given a list of unique integers nums sorted in ascending order, return the minimum i such that nums[i] == i. If there’s no solution, return -1.

Given an integer n, return whether n = k * k for some integer k.