You have huge vector of unsorted char values. Find the value which is bigger than 90% of values in vector. Can you do it in O(n)?

Total 2 rounds. First round array ds questions like remove duplicates from array, find peak element in rotated sorted array, binary search , second highest max no and then muthithreading questions like lock and how to remove deadlock. They focus a lot on multhithreading concepts. Second round - struct class diff (silly question) Deadlock theory and then write code to show deadlock , then two big codes where you have to guess the output and it's also on multhithreading. What is lock. List and linked list diff How Dictionary is implemented internally. In second round I was not selected.but surely this one will help someone so be prepare for multhithreading questions and very easy ds questions.