Ho presentato la mia candidatura online. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso ZET (Bengaluru) nel mese di dic 2022
Colloquio
Got call for interview schedule. 1st round was technical round. Interviewer had 2 DSA and both was of High level. He wanted me to write the code for both in 1 hr which is kind of very hard in given time. Interviewer was polite that was only plus.
Domande di colloquio [2]
Domanda 1
Koko loves to eat bananas. There are N piles of bananas, the i-th pile has piles[i] bananas. The guards have gone and will come back in H hours. Koko can decide her bananas-per-hour eating speed of K. Each hour, she chooses some pile of bananas, and eats K bananas from that pile. If the pile has less than K bananas, she eats all of them instead, and won't eat any more bananas during this hour. Koko likes to eat slowly but still wants to finish eating all the bananas before the guards come back. Return the minimum integer K such that she can eat all the bananas within H hours. piles = [3,6,7,11+1000], H = 8 speed - 4 (1 + 2 + 2 + 3) = 8 129. 1 + 1 + 1 + 1+ 7 Ouput - 4
A cab service offers three types of passes. 1D, 7D, 30D. A T days pass can be used for a continuous duration only. Consider the days of the year being labeled sequentially from 1 to 365. Travelling is required only on some selected days of the year(input). Given the cost of different passes and the days on which travel is required, Calculate the minimum amount using which we can travel on all these days. days = [1,4,6,7,8,20], costs = [2,7,15] 2 + 7 + 2 = 11 Output - 11
Ho presentato la mia candidatura online. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso ZET nel mese di feb 2025
Colloquio
Got a call from zet hr directly and the whole process was completed in a week
Two rounds -
1. Pure DSA round with 2 questions easy + medium
2. LLD round
Domande di colloquio [1]
Domanda 1
Round 1.
- Multiply two very big string numbers a*b
- one random easy(not common) problem to code on leetcode
Round 2: LLD for different subscription plans and for a specific plan - avail benefits
(I got it wrong here - question was expected to be solved with Decorator Design pattern while my solution was strategy/factory based)