Faster and better experience!
i
Zeta
Filter interviews by
Medium range 2 questions
I applied via Approached by Company and was interviewed in Dec 2022. There was 1 interview round.
I was interviewed before Apr 2023.
Ios round
questions asked involved questions from storages used in iOS
app life cycle
multiple app login with same creds autocomplete feature
Basic problem solving round
2 medium
1 b/w medium and hard
question were asked :
tree BFS and Stair question
dynamic programming
Top trending discussions
I applied via Approached by Company and was interviewed in Sep 2024. There was 1 interview round.
posted on 13 Sep 2024
I applied via Referral and was interviewed in Mar 2024. There were 2 interview rounds.
Check if two strings are anagrams by comparing the frequency of characters.
Create two arrays to store the frequency of characters for each string.
Compare the frequency arrays to check if they are anagrams.
Example: 'listen' and 'silent' are anagrams.
Previous project architecture involved microservices with Docker containers and Kubernetes for orchestration.
Utilized microservices architecture for scalability and flexibility
Deployed services in Docker containers for easy portability and consistency
Managed containerized applications with Kubernetes for automated scaling and orchestration
posted on 17 Sep 2024
I was asked to implement lru cache which i did but still didn’t made to next round as apparently i didn’t complete the working code though in my opinion i did
posted on 23 Jul 2023
I applied via Recruitment Consulltant and was interviewed in Jun 2023. There were 4 interview rounds.
posted on 16 Mar 2024
I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.
Linked list is a data structure where each node points to the next node.
Create a Node class with data and next pointer
Create a LinkedList class with head pointer
Implement methods to add, remove, search, and traverse the list
Implement Hash Map with array and linked list.
Create an array of linked lists
Hash function maps keys to array indices
Insert key-value pairs into linked lists
Handle collisions by chaining
Search for a key by hashing and traversing linked list
To create an immutable class in Java, follow these steps:
Make the class final
Make all fields private and final
Do not provide any setter methods
Initialize all fields via constructor
If any field is mutable, return a clone of it instead of the original object
I applied via Approached by Company and was interviewed in May 2024. There was 1 interview round.
HackerRank Test - 2 Medium Questions
1. Given an Array Weights of Chocolates, Find Maximum amount of Chocolate that can be saved after "d" days, if you eat half the weight of one of the chocolates every day.
2. Find Closest String with equal number of vowels and consonants.
Interview experience
based on 9 reviews
Rating in categories
Software Development Engineer II
81
salaries
| ₹16.4 L/yr - ₹53 L/yr |
Product Manager
52
salaries
| ₹21.5 L/yr - ₹45 L/yr |
Senior Software Engineer
49
salaries
| ₹30 L/yr - ₹64 L/yr |
Program Manager
42
salaries
| ₹16.5 L/yr - ₹53.8 L/yr |
Project Manager
38
salaries
| ₹9 L/yr - ₹28.5 L/yr |
Paytm
PhonePe
Mobikwik
Payed