Easy Problems

• Given list of integers and int k return how many integers in list are a power of k
• Given two arrays, a2b and b2a that simulate the times you can depart from the point, and a number of missions to take (1 mission consists of taking a trip from a2b and b2a) return the final time at which you arrive back to a (+ each trip costs 100)

Hard Problems

• Given an n x m matrix of 0’s and a list of figures, return a grid filled with each shape from the list → fill shapes in order, find first empty space to store
• Given a list of integers, return the least costly way to transform the list to be ascending or descending