Round 1:

1. Given an array containing positive integers, count all the subarrays with an equal number of odd and even numbers.
2. You are given an array representing the heights of neighboring buildings on a city street, from east to west. The city assessor would like you to write an algorithm that returns how many of these buildings have a view of the setting sun, in order to properly value the street.
   For example, given the array [3, 7, 8, 3, 6, 1], you should return 3, since the top floors of the buildings with heights 8, 6, and 1 all have an unobstructed view to the west.

Round 2:

1. Find maximum element in every window of size k
2. Sieve of eratosthenes

Round 3:
Database design for food delivery app

Round 4:
Engineering Manager (Work related + few behavioural)

Compensation Details : https://leetcode.com/discuss/compensation/1321992/rupeek-sde-2-bangalore-india/1002557