Round 1: A two pointer based question: Find the max length of consecutive numbers in a array, such that the next element is exactly 1 greater than it's previous element. Example: nums = [1,2,3,5,7,9,2,3,4,5,6] Soln: 5 (2,3,4,5,6) Subsequent questions will be based on the tech mentioned in your resume. For me it was: - How to choose between SQL & NoSQL - Dockerfile vs docker compose - event loop - async programming - messaging queues - promises - REST API best practices - How to boost REST APIs performance