Filter interviews by
I applied via Referral and was interviewed in Jul 2023. There were 2 interview rounds.
I applied via Job Portal and was interviewed in Jul 2024. There was 1 interview round.
There is a question based on Rest API and another question on Java
Machine coding round
Developed a web application for managing inventory and sales for a retail store
Used React.js for front-end development
Implemented Node.js for back-end functionality
Utilized MongoDB for database management
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development technologies
Strong problem-solving skills
Team player with excellent communication skills
I applied via Company Website and was interviewed in Jun 2024. There were 2 interview rounds.
Emails to the host and guests.
I have the necessary skills, experience, and passion for the role.
I have relevant experience in the industry
I possess the required skills and qualifications
I am passionate about the work and eager to contribute
I have a track record of success in similar roles
Seeking new challenges and growth opportunities in a different environment.
Desire for new challenges and learning experiences
Opportunity for career advancement
Seeking a better work-life balance
Interest in exploring different industries or sectors
I applied via Approached by Company and was interviewed before Apr 2022. There were 8 interview rounds.
This is literally a live coding test. For analytics expect SQL, python, R.
Ararat can be sorted alphabetically or numerically.
Sort alphabetically: Arrange in ascending order based on the letters in the word.
Sort numerically: Arrange in ascending order based on the numerical value of each character.
I applied via Company Website and was interviewed in Sep 2023. There were 2 interview rounds.
Implement an iterator to flatten 2D vector
Use Dijkstra's algorithm to find the shortest path to get all keys
Implement Dijkstra's algorithm to find the shortest path in a graph
Consider the keys as nodes in the graph and the paths between keys as edges
Keep track of the keys collected and update the shortest path accordingly
I applied via Campus Placement and was interviewed in Aug 2021. There were 3 interview rounds.
I was interviewed in Aug 2021.
Round duration - 60 minutes
Round difficulty - Medium
Timing was fine - It was in the afternoon
Interviewer was friendly and helpful
Given an array ARR
of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...
Find duplicates in an array of integers within a specified range.
Iterate through the array and keep track of the count of each element using a hashmap.
Return elements with count greater than 1 as duplicates.
Handle edge cases like empty array or no duplicates found.
Example: For input [0, 3, 1, 2, 3], output should be [3].
Round duration - 60 minutes
Round difficulty - Medium
- Timing was fine - Afternoon
- Interviewer was friendly
Designing a caching library involves considering data storage, retrieval, expiration policies, and cache invalidation strategies.
Define the caching requirements such as data size, access patterns, and expiration policies.
Choose a suitable data structure for caching like LRU, LFU, or a simple key-value store.
Implement cache eviction policies to handle memory constraints and optimize performance.
Consider thread safety an...
Round duration - 60 minutes
Round difficulty - Medium
- Timing was fine - Afternoon
- Interviewer was friendly
A 10x10 cube has 600 edges.
A cube has 12 edges, so a 10x10 cube would have 12 edges on each of its 6 faces.
12 edges x 6 faces = 72 edges for the entire cube.
However, each edge is shared by two faces, so we need to divide by 2 to get the total number of unique edges.
72 edges / 2 = 36 unique edges on the outer surface of the cube.
Since the cube has 10x10x10 = 1000 unit cubes, each with 12 edges, we need to subtract the e...
Tip 1 : Be confident
Tip 2 : Be always ready for white board coding
Tip 3 : Brush up your basics
Tip 1 : Resume should not be more than 1 page long
Tip 2 : Write down your technical skills, Frameworks
I applied via LinkedIn and was interviewed before Mar 2023. There were 3 interview rounds.
To find the kth minimum element from a Binary Search Tree (BST)
Perform an in-order traversal of the BST to get elements in sorted order
Return the kth element from the sorted list
Time complexity: O(n) where n is the number of nodes in the BST
To find swapped numbers in a BST, perform inorder traversal and keep track of previous node.
Perform inorder traversal of the BST
Keep track of the previous node while traversing
If at any point, the current node's value is less than the previous node's value, those are the swapped numbers
based on 1 interview
Interview experience
Executive Accountant
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior PHP Developer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Area Sales Manager
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Sr.QA
4
salaries
| ₹0 L/yr - ₹0 L/yr |
MakeMyTrip
Yatra
Cleartrip
Goibibo