Expected unix commands as answer
Top k largest elements : You are given a root directory and value k, the root directory has files and sub directories. Each file has one number on each line. Find the k largest elements from all the files in the root directory. (Not most frequent elements)
Gave a solution of parsing through sub directories in BFS style and adding elements to heap maintaing its size k