Zeta Interview Questions and Answers for Freshers

Q1. Sql questions were answered by the interviewer
Add your answer
Q2. Sql questions were questioned
Add your answer

Q1. Reverse a Linked List
Ans. 
Reverse a linked list by changing the direction of pointers
• Start with three pointers: prev, current, next

• Iterate through the list, updating pointers to reverse the direction

• Update the head of the list to be the last node
Answered by AI
Add your answer
Q2. LRU Cache implementation
Ans. 
Implementing an LRU Cache using a combination of a hashmap and a doubly linked list.
• Use a hashmap for O(1) access to cache items.

• Use a doubly linked list to maintain the order of usage.

• When accessing an item, move it to the front of the list.

• If the cache exceeds its capacity, remove the least recently used item from both the hashmap and the list.

• Example: For a cache of capacity 2, accessing keys 1, 2, then 1 again shou...read more
Answered by AI
Add your answer

An assignment to make an image listing app from API using Volley/Retrofit and second screen to display the image. Used recyclerview, glide , volley etc. It was done to be in 2 hour.

Q1. The second was Android technical discussion round. The assignment was discussed. Why i used recyclerview, questions related to recyclerview, some questions on networking, what happens when we hit google.co...read more
Add your answer
Q2. Why recyclerview is performant dns etc.
Add your answer
Q3. What happens when we hit google.com in browser , behind the scenes
Add your answer

In 1 hour i was asked to solve two easy DS question
1. Merge the two sorted arrays
2. rotated binary search

Q1. Hiring manager round with manager, system design questions,
Add your answer
Q2. 1. Design whatsapp 2. Design chess game (intellij java) 3. React native vs native android , 4. Basic hr question
Add your answer

Q1. Longest Valid Parentheses
Ans. 
Find the length of the longest valid parentheses substring in a given string.
• Use a stack to keep track of the indices of opening parentheses.

• Iterate through the string and update the maximum length of valid parentheses.

• Handle cases where closing parentheses are encountered without a matching opening parentheses.
Answered by AI
Add your answer
Q2. Find the maximum number in the subarrays of length k.
Ans. 
Find the maximum number in the subarrays of length k.
• Iterate through the array and keep track of the maximum number in each subarray of length k.

• Use a sliding window approach to efficiently find the maximum number in each subarray.

• Time complexity can be optimized to O(n) using a deque data structure.
Answered by AI
Add your answer

Q1. Spiral Matrix Question
Add your answer