i
Filter interviews by
I applied via Approached by Company and was interviewed before Feb 2023. There was 1 interview round.
Top trending discussions
posted on 22 Jan 2025
Keeping up with rapidly evolving technologies and frameworks.
Constantly learning new technologies and frameworks to stay relevant
Adapting to changing industry trends and best practices
Balancing the need to innovate with the need for stability and reliability
I applied via Approached by Company and was interviewed before Sep 2023. There were 4 interview rounds.
Hackerearth platform was provided , Question was based on Tree dsa. Need to run and pass few test cases.
Design patterns , chess LLD
Design blocking queue which can handle the multithreading scenario
Developed a web application for tracking inventory and sales data
Used React for front-end development
Implemented RESTful APIs using Node.js and Express
Utilized MongoDB for database management
posted on 12 Apr 2024
I appeared for an interview before Apr 2023.
Aptitude test was esay.i passed that
We have upload a vedio based on given topic
I applied via Referral and was interviewed before Feb 2022. There were 3 interview rounds.
General and basic data structure question
Java programs for strings, palindrome, etc.
Use the StringBuilder class to manipulate strings efficiently.
To check if a string is a palindrome, compare it with its reverse.
To count the occurrences of a substring in a string, use the indexOf method in a loop.
To split a string into an array of substrings, use the split method.
I appeared for an interview in Oct 2021.
Round duration - 50 minutes
Round difficulty - Medium
First round was a basic javascript problem-solving round. The interviewer judged my grasp on fundamental javascript concepts like objects, closures, polyfills, etc. It was during the afternoon and was conducted on google meet and leetcode playground.
The interviewer was very calm. I was first asked some general questions like why I'm applying for this role and what are the projects I've done.
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...
This question asks to find the position of a target integer in a row-wise and column-wise sorted matrix.
Iterate through each row and column of the matrix
Compare the target integer with the current element
If the target integer is found, return the position as {i, j}
If the target integer is not found, return {-1, -1}
Round duration - 40 minutes
Round difficulty - Easy
One DSA Question along with some javascript questions were asked like hoisting, difference between JSX and Javascript etc.
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
The question asks to find the total amount of rainwater that can be trapped in the given elevation map.
Iterate through the array and find the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water for all bars and return the total amount.
Tip 1 : Focus on core Javascript fundamentals before becoming a framework ninja
Tip 2 : Have at least one (or more) good project(s) which shows your experience in frontend development
Tip 3 : Practice fundamental javascript questions and machine coding
Tip 1 : Clearly highlight the skills you have which match with the role you are applying for.
Tip 2 : Mention the work you have done in your internships related to your role (frontend in my case), work experience matters
Tip 3 : Mention some really good projects in your resume.
Tip 4 : Having some special achievements like SIH, Gsoc, etc. certainly helps but isn't compulsory.
I appeared for an interview in Apr 2021.
Round duration - 45 Minutes
Round difficulty - Easy
It was a DSA round where I was asked 2 coding questions and optimised approaches for both.
Ninja has started a new startup with a single conference room available for meetings. Given an array/list MEETINGS
of consecutive appointment requests, Ninja must ...
Find the maximum total booked minutes possible in a conference room for all meetings with a 15-minute break between meetings.
Iterate through the list of meeting durations and calculate the maximum total booked minutes considering the 15-minute break constraint.
Keep track of the total booked minutes and skip consecutive meetings that violate the break constraint.
Return the maximum total booked minutes for each test case
Given an M * N matrix where each cell's value represents its height in a 2-D elevation map, calculate the total volume of water that can be trapped after rainfall.
...Calculate the total volume of water that can be trapped in a 2-D elevation map after rainfall.
Iterate through each cell in the matrix and calculate the trapped water based on the surrounding heights.
Use a stack or queue to keep track of the cells to be processed.
Consider edge cases such as when the matrix is empty or has only one row or column.
Round duration - 45 Minutes
Round difficulty - Medium
It was more of discussion around my projects and resume. Also asked some questions related to me. What are your hobbies? Willing to relocate?
Given an array A
consisting of N
integers, your task is to find the smallest subarray of A
that contains exactly K
distinct integers.
If multiple such subarrays...
Find the smallest subarray with exactly K distinct elements in an array.
Use a sliding window approach to keep track of the subarray with K distinct elements.
Maintain a hashmap to count the frequency of each element in the window.
Update the window size based on the number of distinct elements.
Return the smallest subarray with K distinct elements.
Tip 1 : Be consistent, you might not get success in the starting but if you are consistent with your prep, then in the end you will get offers from most companies
Tip 2 : Do participate in contests on leetcode
Tip 3 : Have a good resume
Tip 1 : Good projects
Tip 2 : Includes achievements in coding contests like ACM ICPC or Google kickstart, Hashcode.
I applied via Instahyre and was interviewed in Oct 2024. There was 1 interview round.
Design LLD for Parking Lot
Create classes for ParkingLot, ParkingSpot, Vehicle, etc.
Implement methods for parking, unparking, checking availability, etc.
Consider different types of vehicles and parking spots (e.g. regular, handicapped, electric)
Include features like ticketing system, payment processing, and security measures
I applied via Referral and was interviewed before Oct 2022. There were 5 interview rounds.
5 DSA Questions 2 Easy, 2Medium, 1 Hard, hackerrank
Find the largest vertical rectangle in an array of strings
Iterate through each column in the array
For each column, find the consecutive vertical rectangles of '1's
Calculate the area of each rectangle and keep track of the largest one
based on 2 interviews
Interview experience
based on 14 reviews
Rating in categories
Software Engineer
70
salaries
| ₹2.8 L/yr - ₹9 L/yr |
Senior Software Engineer
58
salaries
| ₹4.9 L/yr - ₹11.7 L/yr |
Lead Engineer
32
salaries
| ₹8.9 L/yr - ₹17.2 L/yr |
Softwaretest Engineer
14
salaries
| ₹3.1 L/yr - ₹7.8 L/yr |
Technical Lead
13
salaries
| ₹11.5 L/yr - ₹18.2 L/yr |
JoulestoWatts Business Solutions
DotPe
Thoughtsol Infotech
Innoplexus