Nutanix Interview Question

* Build a circular queue * Longest wiggle subsequence * Superimpose two binary trees to construct a new one * Build a simulation for a barber shop and a FCFS queue of waiting customers. Use synchronization and no unnecessary blocking of threads for the simulation.