Zeta | SDE 1 | Java Developer
Summary
I interviewed for an SDE 1 Java Developer role at Zeta, which involved two rounds focusing on data structures & algorithms, OOPs, system fundamentals, and behavioral questions. Despite solving specific problems, I was ultimately rejected.
Full Experience
Current Experience: 1.10 Years
College: Tier-2
Previous Organization: One of the MNCs
HR contact with me through naukri protal.
1st round:
1st question -
You are given an integer array. You have to find the length of the valley for each element.
Vally is defined as, Let i be the current index and l is the leftmost index, r is the rightmost index satisflying property a[l]>a[l+1]>…>a[i]..<a[r-1]<a[r], then length is (r-l+1) is the length of the valley.
Example,
A : [7,2,1,5,7,9]
Answer : [1,2,6,3,2,1]
2nd question -
Given two strings s1 and s2 such that S1<S2. Both strings length are equals. Find the total number of lexicographic strings between S1 and S2.
S1 = ACX
S2 = ADB
2nd round:
Past project discussion (all api's, database table, sql query etc)
car - maruti, toyota, bmw
engine - 1, 2,4
How to implement it using OOP's
Solid principles
Tcp, udp
Http, https
CAP theorem
Behavioral questions
Verdict: rejected.
Interview Questions (3)
Length of Valley for Each Element in Array
You are given an integer array. You have to find the length of the valley for each element. Vally is defined as, Let i be the current index and l is the leftmost index, r is the rightmost index satisflying property a[l]>a[l+1]>...>a[i]..<a[r-1]<a[r], then length is (r-l+1) is the length of the valley. Example, A : [7,2,1,5,7,9] Answer : [1,2,6,3,2,1]
Count Lexicographic Strings Between Two Given Strings
Given two strings s1 and s2 such that S1<S2. Both strings length are equals. Find the total number of lexicographic strings between S1 and S2. S1 = ACX S2 = ADB
OOP Design for Car and Engine System
Given car types (maruti, toyota, bmw) and engine types (1, 2, 4), how would you implement this using Object-Oriented Programming principles?