i
KhataBook
Filter interviews by
I was interviewed in Oct 2021.
Round duration - 60 Minutes
Round difficulty - Medium
Normal intro followed by 1 DSA question
Ninja is mastering an unusual language called the Alien Language. Although it uses the same alphabets as English, the sequence of these alphabets is different. This sequ...
The task is to check whether the given words are sorted lexicographically in an alien language.
Read the number of test cases
For each test case, read the number of words, the words themselves, and the order string
Check if the words are sorted lexicographically based on the given order string
Print 'YES' if the words are sorted, else print 'NO'
Round duration - 60 Minutes
Round difficulty - Easy
This round was based on checking the knowledge on component breaking of any web page and data flow
The play store home page consists of various components that provide a user-friendly interface for browsing and discovering apps.
Header section displaying the app logo, search bar, and navigation options
Featured apps section showcasing popular or recommended apps
Categories section for browsing apps based on different genres
Top charts section displaying the most downloaded or highest-rated apps
New releases section highl...
Round duration - 60 minutes
Round difficulty - Easy
This round was focused on how the developer is going to contribute to designing the better user experience
Design a wireframe for a ledger management user interface.
Include a navigation bar for easy access to different sections of the ledger
Design a table layout to display the ledger entries with columns for date, description, debit, credit, and balance
Add filters and search functionality to easily find specific entries
Include options to add, edit, and delete ledger entries
Consider adding visual indicators for different typ...
Tip 1 : Practice at least 2 DSA Mid-level questions Daily.
Tip 2 : Be confident on the projects mentioned in the resume.
Tip 1 : Stability in Resume
Tip 2 : Challenging Projects in resume
Top trending discussions
I applied via Hirist and was interviewed in Feb 2023. There were 6 interview rounds.
Create separate modules and communicate between them
I was interviewed in May 2022.
Round duration - 60 Minutes
Round difficulty - Medium
Anytime
Given an array/list ARR
consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.
The input sta...
The task is to sort an array of 0s, 1s, and 2s in increasing order.
Use a three-pointer approach to partition the array into three sections: 0s, 1s, and 2s.
Initialize three pointers: low, mid, and high. low points to the start of the array, mid points to the current element being processed, and high points to the end of the array.
While mid <= high, if ARR[mid] is 0, swap ARR[low] and ARR[mid], increment low and mid. If
Given 'N' ropes, each having different lengths, your task is to connect these ropes into one single rope. The cost to connect two particular ropes is equal to the sum of th...
The task is to connect N ropes into one rope with minimum cost.
Sort the array of rope lengths in ascending order.
Initialize a variable to keep track of the total cost.
While there are more than one rope, take the two shortest ropes and connect them.
Add the cost of connecting the two ropes to the total cost.
Replace the two shortest ropes with the connected rope.
Repeat the above steps until only one rope remains.
Return th
Round duration - 60 Minutes
Round difficulty - Medium
Given an array ARR
consisting of N
integers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.
The task is to find the maximum possible sum of a non-empty subarray of an array.
Iterate through the array and keep track of the maximum sum encountered so far
If the current element is greater than the sum so far, start a new subarray
If the current element plus the sum so far is greater than the maximum sum, update the maximum sum
Return the maximum sum
Given a binary tree, return the length of its diameter. The diameter of a binary tree is defined as the length of the longest path between any two nodes in the ...
The diameter of a binary tree is the length of the longest path between any two end nodes in the tree.
The diameter of a binary tree can be calculated by finding the maximum of the following three values: 1) the diameter of the left subtree, 2) the diameter of the right subtree, and 3) the longest path that passes through the root node.
To find the diameter of a binary tree, we can use a recursive approach where we calcu...
Round duration - 60 Minutes
Round difficulty - Medium
This round was more aroung sytem design and my past work experience.
Design a bookmyshow system
Design a system to book and manage movie tickets
Consider features like seat selection, payment, and ticket cancellation
Include user authentication and authorization
Implement a database to store movie and theater information
Consider scalability and performance of the system
Round duration - 30 Minutes
Round difficulty - Easy
This is non-tech round.They just want to check your nature ,attitude and team work skills.
I want to leave my current job for better growth opportunities and a more challenging role.
Seeking new challenges and opportunities for professional growth
Looking for a role that aligns better with my skills and interests
Desire to work in a more dynamic and innovative environment
Seeking better compensation and benefits
Wanting to expand my knowledge and skills in a different domain
Tip 1 : Pratice DSA and focus on the core subject like Database and OS
Tip 2 : Practice atlest 2 question everday to maintain consistency.
Tip 1 : Crisp Resume : Every body knows about this step, you must create a crisp resume mentioning about your key skills, always add impact numbers if possible (for example : increased efficiency by 50%, reduced cost by 2X, etc.) Add keywords around your skills, highlight them using BOLD in resume.
Tip 2 : Use Linkedin : Send connections requests directly to the recruiters rather than asking for referrals.
I applied via Naukri.com and was interviewed in Jan 2021. There were 3 interview rounds.
I applied via Referral and was interviewed in Jun 2024. There were 3 interview rounds.
Puzzles are a large component for entry-level.
RCA as well as business case studies are asked
I applied via LinkedIn and was interviewed in Oct 2023. There were 3 interview rounds.
I applied via Approached by Company and was interviewed before Oct 2023. There was 1 interview round.
Quant and Cat based questions
Key Accounts Executive
34
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
33
salaries
| ₹0 L/yr - ₹0 L/yr |
Key Account Manager
21
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Business Analyst
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Dukaan
OkCredit
Vyapar
Paytm