Filter interviews by
Python , mysql, joins,html,css
Pipe, speed distance
Design a post api with SpringBoot
Create a new Spring Boot project
Define a model class for the post entity
Create a PostController class with a method to handle POST requests
Use @PostMapping annotation to map the method to a POST request
Implement the logic to save the post data to a database
Top trending discussions
I appeared for an interview before May 2021.
Round duration - 45 Minutes
Round difficulty - Medium
A class booking application for students to schedule and manage their classes.
Create a class booking system where students can view available classes, book classes, and manage their schedule.
Include features like class search, class details, booking confirmation, and calendar view.
Implement user authentication to ensure only registered students can book classes.
Allow students to cancel or reschedule classes with proper...
Round duration - 60 Minutes
Round difficulty - Medium
The interviewer understand the current problem statement I was working on.
Asked the clarifying questions and alternative approaches to solve the same and their tradeoffs.
Also, asked about the technologies I was using in depth and reason for choosing the same.
You have a car with a gas tank of infinite capacity. There are 'N' gas stations located along a circular route, numbered from 0 to N-1. You begin your journey with an empty tank...
Find the starting gas station index to complete a circular route with gas and cost arrays.
Iterate through gas stations, keeping track of gas remaining after each station
If gas remaining is negative, reset starting station to current station + 1
If total gas remaining at the end is greater than or equal to total cost, return starting station index
Round duration - 45 Minutes
Round difficulty - Medium
This round was their with the CTO and was mostly the culture fitment round.
Round duration - 30 Minutes
Round difficulty - Easy
This round was with the cofounder and was mostly culture fitment.
Tip 1 : Practice questions on leetcode
Tip 2 : Understand the best solutions in depth and algorithm used
Tip 3 : Ask clarifying questions to the interviewer and break the problem to smaller sub parts
Tip 1 : Highlight your most impactful work on the resume
Tip 2 : Keep it easy to understand
I appeared for an interview in Jan 2021.
Round duration - 95 minutes
Round difficulty - Medium
The 1st round was online coding + MCQ round. It had 3 sections in total to be solved in 95 mins.
Next comes the technical interview.
The technical interview lasted for about 45 minutes. It started with a basic introduction. Then, she framed some questions from my resume and projects which I have mentioned. Questions were mainly from Data structure, OS, DBMS, SQL. She told me to rate my data structure skill on a scale of 1 to 5.
My interview was at 10:30 am and the interviewer was really nice. She was helping me wherever I was getting stuck.
Given an array consisting of integers, your task is to determine the fourth largest element in the array. If the array does not contain at least four distinct elements,...
Find the fourth largest element in an array, return -2147483648 if not enough distinct elements.
Sort the array in descending order
Return the fourth element if it exists, else return -2147483648
Round duration - 45 minutes
Round difficulty - Medium
The technical interview lasted for about 45 minutes. It started with a basic introduction. Then, she framed some questions from my resume and projects which I have mentioned. Questions were mainly from Data structure, OS, DBMS, SQL. She told me to rate my data structure skill on a scale of 1 to 5.
You are provided with an integer array/list ARR
of size 'N' which consists solely of 0s, 1s, and 2s. Your task is to write a solution to sort this array/list.
Sort an array of 0s, 1s, and 2s in linear time with a single scan approach.
Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.
Iterate through the array once and swap elements based on their values and the pointers.
After the single scan, the array will be sorted in place with 0s, 1s, and 2s in order.
You are given an array of integers. The task is to remove all duplicate elements and return the array while maintaining the order in which the elements were provided.
Remove duplicates from an array while maintaining order.
Use a set to keep track of unique elements.
Iterate through the array and add elements to the set if not already present.
Convert the set back to an array to maintain order.
SQL joins are used to combine rows from two or more tables based on a related column between them.
Inner Join: Returns rows when there is at least one match in both tables.
Left Join: Returns all rows from the left table and the matched rows from the right table.
Right Join: Returns all rows from the right table and the matched rows from the left table.
Full Outer Join: Returns rows when there is a match in one of the tabl...
Determine if a node with a given integer value X exists in a specified binary tree.
The first line of each test case contains the binary tree nodes in level orde...
Check if a node with a given value exists in a binary tree.
Traverse the binary tree using depth-first search (DFS) or breadth-first search (BFS) to search for the node with the given value.
Use a recursive or iterative approach to implement the search algorithm.
Return 'true' if the node with the given value is found, otherwise return 'false'.
The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...
Find the shortest path in an unweighted graph from house 'S' to house 'T'.
Use Breadth First Search (BFS) algorithm to find the shortest path in an unweighted graph.
Create a queue to store the current house and its neighbors, and a visited set to keep track of visited houses.
Start BFS from house 'S' and stop when reaching house 'T'.
Return the path from 'S' to 'T' once 'T' is reached.
If multiple shortest paths exist, ret...
Tip 1 : Read interview experience before interview
Tip 2 : Think loud about each coding question.
Tip 1 : No spelling mistake in resume.
Tip 2 : Resume should be in proper format
posted on 19 Nov 2024
I applied via Referral and was interviewed before Nov 2023. There were 2 interview rounds.
The basic questions asked in an interview .
DP, graph, and array questions asked in 2nd round also asked my company project
posted on 13 Mar 2024
I appeared for an interview before Mar 2023.
Use a greedy algorithm to send the office bus to all locations in the city efficiently.
Start from the office location and pick the nearest location to visit next.
Continue picking the nearest unvisited location until all locations are covered.
Repeat the process until all locations are visited.
Consider using Dijkstra's algorithm or a similar approach for finding the nearest location.
Optimize the route by considering traf...
I applied via Company Website and was interviewed before May 2022. There were 4 interview rounds.
It was a aptitude and logical reasoning test
I applied via Approached by Company and was interviewed in Apr 2022. There were 4 interview rounds.
The current project follows a microservices architecture.
The project is divided into multiple small services that communicate with each other through APIs.
Each service is responsible for a specific functionality.
The services are deployed independently and can be scaled as per the demand.
The project uses Docker containers for easy deployment and management.
The communication between services is secured using HTTPS protoc...
based on 3 interview experiences
based on 13 reviews
Rating in categories
Data Analyst
141
salaries
| ₹11 L/yr - ₹18.6 L/yr |
Operations Executive
123
salaries
| ₹1.7 L/yr - ₹4.1 L/yr |
Customer Care Executive
98
salaries
| ₹1.9 L/yr - ₹3.8 L/yr |
Full Stack Developer
89
salaries
| ₹10.1 L/yr - ₹18.1 L/yr |
Market Analyst
88
salaries
| ₹11.5 L/yr - ₹20 L/yr |
Mahindra Logistics
Maersk
DTDC Express
ElasticRun