| | |

A similar example could be a recursive iteration through folders/files or a tree.

Onsite 1:

A question is similar to "canConstruct". Write a function that takes a string and an array of strings as input and returns a boolean if you can construct the string using substrings from the array. Alternatively, you might need to return an array of substrings.

Write a function that takes an array of floats (or doubles) as a parameter and returns the longest subsequence of floats where all elements have differences not more than 1 between each other.

For example, input: [4.2, 5.3, 4.6, 9.8, 1.5, 5.2, 4.7] Output: [4.2, 4.6, 5.2, 4.7]

Explanation: If you find the difference between any pair of elements in the output, it would be less than or equal to one.

A challenge to merge pairs. For example, find free time between two calendars.

Recursive folder traversal in a file system. This is very similar to the first screening phone interview question. You get a folder-like data structure as input and return a string describing its tree structure. As an alternative, each subfolder might contain files, and you need to return a count of files contained in the folder and its subfolders.