Filter interviews by
Top trending discussions
I was interviewed in Dec 2020.
Round duration - 120 minutes
Round difficulty - Hard
There was 2 parts. First part problems were based on Quantitative Aptitude. Problems were of 3 types- Easy, Medium and Hard with different scores. Difficulty keeps on increasing if you answer correctly and keeps on decreasing if you answer incorrectly.
First part was of 45 mins.
Second part consisted of 2 coding problems- Medium, Hard. One was based on Greedy and other was a difficult DP + Bitmask problem.
Coding part had more weightage than Aptitude.
In Ninja Land, there are cities numbered from 0 to N-1. The distances between each pair of cities are represented by an N * N matrix 'DIST', where 'DIST[i][j]' is the distance ...
The problem involves selecting K cities to install servers in Ninja Land to minimize the maximum distance from any city to a nearest server.
Iterate through all possible combinations of K cities to select for server installation.
Calculate the maximum distance from any city to the nearest server for each combination.
Choose the combination that minimizes the maximum distance.
Given a non-empty string inputString
, determine if it can be converted into a 'Beautiful String' using the defined operation.
You can perform any number of operations to con...
Determine if a given string can be converted into a 'Beautiful String' using a specific operation.
Check if the input string is already a 'Beautiful String' by checking if it contains 'abc' in the correct positions.
If 'abc' is present in the input string, check if the left and right portions satisfy the defined conditions.
If the conditions are met, return 'True', otherwise return 'False'.
Round duration - 90 minutes
Round difficulty - Medium
There were 3 interviewers in my panel. The most senior panellist asked q. related to my interests and internship experience.
Other 2 asked questions related to Coding and subjects. There was 1 coding question which was implementation based and involved many corner cases. They were checking if I was able to figure out different corner cases and handle those.
There were situation based questions also asked. One question was on system design of Arogya Setu App.
Calculate the product of two complex numbers represented as strings in the form “A+Bi”. Here, ‘A’ represents the real part, and ‘B’ represents the imaginary part.
Calculate the product of two complex numbers represented as strings in the form 'A+Bi'.
Parse the input strings to extract real and imaginary parts of both complex numbers
Perform multiplication of the complex numbers using the formula (a+bi)*(c+di) = (ac - bd) + (ad + bc)i
Format the result as a string in the form 'A+Bi' and return
Round duration - 30 minutes
Round difficulty - Easy
HR round involved basic questions related to background and behaviour. It was basically a cultural fit round.
Tip 1 : Focus on Data Structures, Algorithms as >= 75% of your interview will be dedicated to it. Practice as much as you can.
Tip 2 : Learn the fundamentals of C, C++, OS, SQL as that are basic expectations of interviewer.
Tip 3 : Keep 2 descent projects in resume. Try to have an internship. It will make your resume strong.
Tip 1 : Try to keep relevant information only. Add all your skills and achievements.
Tip 2 : Try to have links of your coding and Github profiles.
Tip 3 : Add 2 to 3 project with small descriptions. Try to keep bullet points. Do mention the Tech Stack.
Tip 4 : Don't lie on any skill. Write only those on which you have worked.
posted on 11 Nov 2023
I applied via Approached by Company and was interviewed in Oct 2023. There were 4 interview rounds.
Just normal MCQ test.
This question involves buying and selling items in an array.
The array must contain strings.
You need to implement a function to buy and sell items from the array.
Provide examples of buying and selling operations.
I applied via Campus Placement
Normal DP question (LC med)
I was interviewed in Dec 2020.
Round duration - 70 Minutes
Round difficulty - Medium
There were 5 people in the zoom meet, including me. Rest all 4 were interviewers, 3 from India and 1 from the United Kingdom.
They started with my introduction and then moved on to the questions from my resume, starting with my internship at Samsung Bangalore and then projects.
Then another interviewer asked about my weakness and strength. Then comes the turn of coding questions.
Starting with finding the minimum element in O(1) time, rotating the 2-D array by 90 degrees, OOPS questions were also asked like- polymorphism, abstraction, virtual class. Some OS questions were- cache, paging algorithms.
Then come my POR and other activities.
You are provided with an array of integers ARR
of size N
and an integer K
. Your task is to find and return the K
-th smallest value present in the array. All elements...
Find the K-th smallest element in an array of distinct integers.
Sort the array and return the element at index K-1.
Use a min-heap to find the K-th smallest element efficiently.
Implement quickselect algorithm for optimal performance.
You are provided with a square matrix of non-negative integers of size 'N x N'
. The task is to rotate this matrix by 90 degrees in an anti-clockwise directi...
Rotate a square matrix by 90 degrees anti-clockwise without using extra space.
Iterate through each layer of the matrix from outer to inner layers
Swap elements in groups of 4 to rotate the matrix in place
Handle odd-sized matrices separately by adjusting the loop boundaries
Page replacement algorithms are used in operating systems to decide which page to replace when a new page needs to be brought in.
FIFO (First In, First Out) - replaces the oldest page in memory
LRU (Least Recently Used) - replaces the page that has not been used for the longest time
LFU (Least Frequently Used) - replaces the page that has been used the least number of times
Optimal - replaces the page that will not be used
Tip 1 : Practice GFG Must Do section, solve at least 5 Questions daily
Tip 2 : Start talking to new people regarding technology to remove hesitation at the time of the interview.
Tip 3 : Be in contact with a senior already working in that company, ask them regarding previous experience and new project the company is working on.
Tip 4 : Once you are done with GFG must do questions, now complete leetcode sorting by your target company.
Tip 5 : For core subjects refer to gate smashers and knowledge gate videos on youtube.
Tip 1 : Try to modify your resume according to the company you are applying for, for this read their Job Description provided to you.
Tip 2 : Mention no more than 3 projects and 1,2 internships.
Tip 3 : Divide your skills into beginner, intermediate and hard sections, otherwise don't mention too many skills.
Tip 4 : Don't mention to many Position Of Responsibilities( at max 2-3).
I applied via LinkedIn and was interviewed in Sep 2021. There was 1 interview round.
I applied via Recruitment Consulltant and was interviewed in Aug 2023. There were 2 interview rounds.
I applied via Campus Placement and was interviewed in Jun 2024. There were 2 interview rounds.
Basic aptitude with logical and verbal and reasoning.also microprocessor and micro controller.
We were divided into 10 and ques were asked from dbms,ds,os,cn
I applied via Job Fair and was interviewed in Mar 2024. There were 2 interview rounds.
Basic questions were asked from topics like time, cost, profits-losses, patterns etc
Questions on microprocessors , networking and sorting algorithms
based on 3 reviews
Rating in categories
Account Assistant
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Dhoot Transmission
Amphenol Interconnect
Ag Industries
Prama Hikvision India