Round 1 - 1. Print even and odd numbers on two different threads. Even numbers should be printed on Thread 1 and odd numbers should be printed on thread 2. 2. Given a linked list of integer numbers. The linked List is sorted by absolute value. Sort the linked list by the actual value. // Example -> // Given : 1 -> -2 → 3 → -4 → 5 → -6 // Expected: -6 → -4 → -2 → 1 → 3 → 5 Round 2 - Given an array arr[] of n integers, construct a Product Array prod[] (of the same size) such that prod[i] is equal to the product of all the elements of arr[] except arr[i] Inputs: City name Search criteria (checkin, checkout, number of adults, rooms) -> Search service -> Hotels Ranking service (microservice) Ranking modulation for different users user footprint same place -> higher budget on iphone small city -> lower price IP Round 3 - Design a workflow service in which we need to run tasks in parallel and some in sequential. e.g. workflow1: T1 , T2 // parallel T3 // run only if T1, T2 is successful T4 T5 T6 T7 W2: T1 T2 T3 T4 T5
