Add office photos
Filter interviews by
EatClub Software Developer Interview Questions and Answers
EatClub Software Developer Interview Experiences
1 interview found
MANISH KUMAR SINGH SVNIT
3 question for 3 hrs , 2 medium and 1 hard level typr
(2 Questions)
- Q1. Minimum cost of rope cutting
- Ans.
The minimum cost of rope cutting involves dynamic programming to find the optimal solution.
Use dynamic programming to find the optimal solution
Consider the cost of cutting at each possible point
Keep track of the minimum cost as you iterate through the rope
- Q2. OS related questions
Top trending discussions
Interview questions from similar companies
Anonymous
The exam duration is one and a half hours.
The total exam time is one and a half hours.
It encompasses all topics related to full stack development.
(2 Questions)
- Q1. Asks questions on SQL
- Q2. Asks question in typical topics
(1 Question)
- Q1. Where do you see yourself in two years?
- Ans.
In two years, I see myself as a senior software developer leading a team on innovative projects.
Advancing to a senior software developer role
Leading a team on new and innovative projects
Continuing to enhance my technical skills through ongoing learning and training
Chirag Varshney
(4 Questions)
- Q1. Explain Deadlock?
- Q2. Explain Red Black Tree?
- Q3. Find local minima in a 1-D array?
- Q4. Find local minima in 2-D array?
(2 Questions)
- Q1. LRU Cache - how to tackle
- Ans.
LRU Cache is a data structure that maintains a list of items in order of most recently used to least recently used.
Implement using a doubly linked list and a hashmap for efficient operations
When an item is accessed, move it to the front of the list
When the cache is full, remove the least recently used item from the end of the list
- Q2. LRU Cache implementation based on a real time system. How would the main work which will be called etc etc
Sachin Tiwari
(2 Questions)
- Q1. What is ambitionbox
- Q2. How many questions are there in that
(2 Questions)
- Q1. Same as above questions
- Q2. Same as above questions second one
I applied via campus placement at Netaji Subhas Institute of Technology (NSIT) and was interviewed in Jul 2024. There were 4 interview rounds.
It was a coding round where i need to solve 3 DSA Questions in 1.5 hour
(2 Questions)
- Q1. This is Technical round where i was asked to implement the Two Question of Dsa one is bases on greedy and another is dp , another one is leetcode hard (finding maxaimal area of rectangle in matrix of 1 and...
- Q2. Greedy Q was direct i don't remember clearly. I was selected for the 2nd round
(1 Question)
- Q1. It was also a technical round but bases on LLD problem statement. I was given a problem statement to design a society security system and the they need psudo code for complete implementation using correct ...
(1 Question)
- Q1. I was not selected for 4th round but heard that there were Q on cs fundamentals.
(2 Questions)
- Q1. The question was about Nodejs
- Q2. The question was to build a linked list in Nodejs
(2 Questions)
- Q1. The first question was related to DSA
- Q2. The question was related to SQL
BFS Implementation of a jug question.
(2 Questions)
- Q1. Few hashmap questions
- Q2. Object Oriented Programming questions
I applied via campus placement at RV College Of Engineering (RVCE) and was interviewed in Aug 2024. There were 2 interview rounds.
3 Medium level dsa questions
(2 Questions)
- Q1. Lld of cab booking system
- Ans.
The Low Level Design (LLD) of a cab booking system involves detailing the system architecture and components at a lower level of abstraction.
Identify the main components of the system such as user interface, booking engine, payment gateway, and driver allocation algorithm.
Define the interactions between these components and how data flows between them.
Specify the data structures and algorithms used for efficient bookin...
- Q2. Discussion about online assesment
Interview Preparation Tips
Skills evaluated in this interview
(2 Questions)
- Q1. Given an array of n numbers , find the kth largest find the sum from a th largest to bth largest n can be huge
- Ans.
Find the sum of kth to bth largest numbers in a huge array efficiently.
Sort the array in descending order to easily find the kth and bth largest numbers.
Use a priority queue or min heap to efficiently find the kth and bth largest numbers without sorting the entire array.
Once you have the kth and bth largest numbers, iterate through the array and sum the numbers between them.
- Q2. Mostly elasticsearch related and company work related questions
Skills evaluated in this interview
EatClub Interview FAQs
Tell us how to improve this page.
EatClub Interviews By Designations
Interview Questions for Popular Designations
- Senior Software Developer Interview Questions
- Lead Software Engineer Interview Questions
- Associate Software Developer Interview Questions
- Software Development Engineer II Interview Questions
- Software Engineer Interview Questions
- Software Development Engineer 1 Interview Questions
- Software Engineer Level 1 Interview Questions
- Senior Software Engineer Interview Questions
- Show more
Software Developer Interview Questions from Similar Companies
Fast track your campus placements
|
Senior Operations Manager
6
salaries
|  ₹5 L/yr - ₹7 L/yr |
|
Business Analyst
4
salaries
| ₹10 L/yr - ₹20 L/yr |
|
Software Development Engineer
4
salaries
| ₹14 L/yr - ₹22 L/yr |
|
Chef
4
salaries
| ₹1.7 L/yr - ₹3.4 L/yr |
|
Delivery Boy
4
salaries
| ₹1 L/yr - ₹3.5 L/yr |
Zomato
Swiggy
Uber eats
FoodPanda
Calculate your in-hand salary
- Home >
- Interviews >
- EatClub Interview Questions >
- EatClub Software Developer Interview Questions
