Filter interviews by
Clear (1)
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.
Top trending discussions
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
I applied via Job Portal and was interviewed before Apr 2021. There was 1 interview round.
Solid principles are a set of design principles for writing maintainable and scalable code in C#.
Single Responsibility Principle (SRP) - a class should have only one reason to change
Open/Closed Principle (OCP) - a class should be open for extension but closed for modification
Liskov Substitution Principle (LSP) - derived classes should be substitutable for their base classes
Interface Segregation Principle (ISP) - client...
I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
This was MCQ+Coding round.
Check if two strings are anagrams by comparing the sorted versions of the strings.
Sort both strings and compare if they are equal.
Use a hashmap to store the frequency of characters in each string and compare the maps.
Ignore spaces and punctuation when comparing the strings.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.
Add projects and Internships if you have done any and add only those things which you really know.
Final outcome of the interviewSelectedI was interviewed before Sep 2020.
Round duration - 90 Minutes
Round difficulty - Medium
Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.
You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...
Detect cycle in a directed graph using depth-first search (DFS) algorithm.
Use DFS to traverse the graph and detect back edges indicating a cycle.
Maintain a visited array to keep track of visited nodes during traversal.
If a node is visited again during traversal and it is not the parent node, then a cycle exists.
Return true if a cycle is detected, false otherwise.
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
You are given a number in string format, a...
Find the next smallest palindrome greater than a given number represented as a string.
Convert the string to an integer, find the next greater palindrome, and convert it back to a string.
Handle cases where the number is a palindrome or has all digits as '9'.
Consider both odd and even length numbers when finding the next palindrome.
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 11:00 am. Interview went well.
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
The first line ...
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
Traverse the left boundary nodes in a top-down manner
Traverse the leaf nodes from left to right
Traverse the right boundary nodes in a bottom-up manner
Handle cases where duplicates occur in the boundary nodes
Implement the function without printing as printing is already managed
Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. Learn them by heart.
Tip 2 : For Web.Development Try to learn full stack development. See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.
Tip 1 : Always try to make it a single page
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.
I applied via Company Website and was interviewed in Oct 2018. There was 0 interview round.
I applied via Naukri.com and was interviewed before Oct 2019. There were 3 interview rounds.