How will you store values such that the top n max element can be retrieved in O(1) time. (heaps) Given a large number of files and their generations at periodic intervals based on months, how will you store the information of their generation such that for any given month, you can retrieve the files generated in that month or months, also assuming that the order in which they are generated are always constant. (by mapping them to boolean values and performing AND and OR and NOT)
System design question. Algorithmic question. Deep dive into a technical problem.
Basic Spark related questions and deep dive into projects
Projects in detail were asked
1- Spark Questions 2 - Big Data tech stack case studies 3 - Design pipelines
Core Java indepth question in details
How did company X approached risk assessment of new projects? What questions did you ask engineers? How did you calculate the score? How did you make decisions?
Describe how micro front end share data with each other
Generic questions : How would you lead the team.
Can you tell us about your previous work experience and the key projects you've handled?
Viewing 6351 - 6360 interview questions