Filter interviews by
I was interviewed in Apr 2021.
Round duration - 40 Minutes
Round difficulty - Easy
The round began at about 3:30 pm. The environment was good and the interviewer was very calm and humble. At the beginning he asked me some general questions so as the make me comfortable, like tell me about yourself and what you did today. After that he came upon my project and about 80% of the interviews discussion was around my project.
Given a positive integer N
, your task is to return all the prime numbers less than or equal to N
.
1) A prime number is a number that has only two factors:...
Return all prime numbers less than or equal to a given positive integer N.
Iterate from 2 to N and check if each number is prime using a helper function.
A number is prime if it is not divisible by any number from 2 to its square root.
Store and return the prime numbers found in an array in increasing order.
Your task is to implement a queue using two stacks. You are provided with ‘Q’ queries and need to handle them, where each query falls under one of these two operations:
...Implement a queue using two stacks with enqueue and dequeue operations.
Use two stacks to simulate a queue - one for enqueue and one for dequeue.
For enqueue operation, push elements onto the enqueue stack.
For dequeue operation, if the dequeue stack is empty, pop all elements from enqueue stack and push onto dequeue stack.
Return true for successful enqueue and the dequeued element for successful dequeue.
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...
Determine if two strings are anagrams of each other by checking if they have the same characters in different order.
Create character frequency maps for both strings and compare them.
Sort both strings and compare if they are equal.
Use a hash table to store character counts and check if they are the same for both strings.
Tip 1 : Do not rush into things. Learning takes time. Focus should be on the concepts and not just on leaving topics half-prepared. Devote 70% of both time and effort to DSA. I solved a total of around 500 questions on sites like GFG and Leetcode. Do not repeat similar questions just to increase the count of the number of questions
Tip 2 : Competitive Programming is a bonus and not a necessity, rather focus on core DSA based problems before trying CP. Do not pursue CP if you do not like it. Devote that extra time to core CS subjects and aptitude preparation.
Tip 3 : Projects play an important role too, do no ignore them. Try to get your hands dirty with a little bit of every field i.e., frontend, backend, and database.
Tip 1 : Try to make a single-page resume. Highlight skills, projects, and work experience more than CGPA. Ensure proper spacing and font to maintain professionalism.
Tip 2 : Does not lie on a resume. Everything written on your resume must be known by you in and out.
I was interviewed in Dec 2020.
Round duration - 90 minutes
Round difficulty - Medium
It was video call round in teams which went for around 90 minutes. Interviewer is flexible and it went well.
Given a 2D matrix MAT
of size M x N, where M and N represent the number of rows and columns respectively. Each row is sorted in non-decreasing order, and the first element of each ro...
Implement a function to search for a given integer in a 2D matrix with specific properties.
Iterate through each row of the matrix and perform a binary search on each row to find the target integer.
Since the rows are sorted, binary search can be applied efficiently to determine if the target exists in the matrix.
Handle edge cases such as empty matrix or invalid input values.
Return 'TRUE' if the target is found in the ma
You are given a string S
of length N
. Your task is to find the index (considering 1-based indexing) of the first unique character in the string. If there are no uni...
Find the index of the first unique character in a given string, return -1 if no unique characters are found.
Iterate through the string to count the frequency of each character
Iterate through the string again to find the first character with frequency 1
Return the index of the first unique character or -1 if none found
Round duration - 30 minutes
Round difficulty - Easy
Interview went arounf 30minutes at 10AM. As it was hr round there wont be any technical stuff and I have only concentrated on my communication skills and had a glance of frequently asked hr questions before interview. It was more of a discussion.
Tip 1 : It is recommended to know at least one language thoroughly (C, C++, Java, Python)
Tip 2 : Students generally are skip practice part and landing into trouble when asked to write the code in a live interview. Therefore, PRACTICE is strongly recommended from websites like hackerrank, coding ninjas, leetcode etc.
Tip 3 : Deep dive into your Core subjects.
Tip 4 : Practise 5-6 problems daily. 2Easy, 2Medium, 2Hard
Tip 5 : Don't do half learning. Though it takes time be perfect at each concept you learn.
Tip 1 : Include only the most relevant information and put the most important information first
Tip 2 : Don't Put Everything on There. Your resume should not have every work experience you've ever had listed on it.
Tip 3 : Customize your resume to each position.
Tip 4 : Include atleast one full stack project.
Top trending discussions
I applied via Campus Placement and was interviewed before Mar 2021. There were 3 interview rounds.
Normal aptitude , moderate level
Same c / Java based coding test , what u have practiced in college level
I applied via Recruitment Consultant and was interviewed before Aug 2020. There was 1 interview round.
I applied via Recruitment Consultant and was interviewed in Jan 2021. There was 1 interview round.
I applied via Recruitment Consultant and was interviewed before Aug 2020. There were 3 interview rounds.
I applied via Naukri.com and was interviewed before Dec 2019. There was 1 interview round.
based on 1 review
Rating in categories
TCS
Accenture
Wipro
Cognizant