Filter interviews by
I applied via Campus Placement and was interviewed in Sep 2023. There were 4 interview rounds.
3 basic DSA questions were asked from the topics binary trees, strings. The test was for 1 hour.
Top trending discussions
I applied via Campus Placement and was interviewed in Feb 2024. There were 2 interview rounds.
It was a 2 hour test with medium level questions
I applied via LinkedIn and was interviewed in Feb 2024. There were 2 interview rounds.
40 MCQ's, 2 Coding question
Dijkstra's Algorithm is a graph search algorithm that finds the shortest path between nodes in a graph.
Dijkstra's Algorithm is used to find the shortest path from a starting node to all other nodes in a weighted graph.
It works by maintaining a set of nodes whose shortest distance from the starting node is known.
The algorithm iteratively selects the node with the smallest distance and updates the distances of its neighb...
DSA, Behavioural, os, some networks basics
posted on 21 Jun 2024
BFS tree traversal visits nodes level by level starting from the root.
Start at the root node and visit its children before moving on to the next level.
Use a queue data structure to keep track of nodes to visit next.
BFS is often used to find the shortest path in unweighted graphs.
posted on 24 Dec 2022
I applied via campus placement at Birla Institute of Technology and Science (BITS), Pilani and was interviewed in Jun 2022. There were 4 interview rounds.
There were 2 DSA medium level questions
posted on 24 Dec 2022
I applied via campus placement at International Institute of Information Technology (IIIT), Allahabad and was interviewed in Jun 2022. There were 3 interview rounds.
Two easy coding problems with few mcqs
Google Contacts is a web-based address book application.
Users can add, edit, and delete contacts
Contacts can be organized into groups
Users can import and export contacts
Contacts can be searched and filtered
Integration with other Google services like Gmail and Calendar
I was interviewed in Oct 2020.
Round duration - 60 minutes
Round difficulty - Medium
There were 25 mcqs and 1 coding question. OS, aptitude, C and C++ concepts were the main focus.
You are given a positive integer 'N'. Your objective is to determine the number of ways to express 'N' as the sum of two or more consecutive natural numbers.
...Approach:
In this brute force approach,. We will iterate from 1 to ‘N’ using the iterator i and will check if there is a possible sequence of consecutive positive integers such that their sum is ‘N’, and the ending integer of the consecutive sequence is 'i'. The checking will be done as follows:
Round duration - 60 minutes
Round difficulty - Medium
It was of 60 minutes,
Questions asked were
1. Swap without temp variable
2. A problem question in which I was asked to find the ball with odd weight out of the remaining in the least number of attempts and write an algorithm for it.
3. Code to insert in the middle of circular linked list, code to find middle element of a singly linked list with knowing the number of elements in it.
4. Socket programming
5. Operating system concepts
6. Types of joins in DBMS
7. A DBMS query
8. Print in C without a semi colon
9. If I have any questions in the end.
Your task is to interchange the values of two numbers given as variables 'X' and 'Y' without using a temporary variable or any additional variable.
Y...
Tip 1 : Brush up your operating systems concept
Tip 2 : study Computer Architecture
Tip 3 : Emphasise more on theoretical concepts rather than coding concepts, Nvidia is a hardware company and deals with kernel level drivers mostly.
Tip 1 : Put C and C++ as yours skills if you have it
Tip 2 : Do not lie about your skills , be specific
I was interviewed before Mar 2021.
Round duration - 70 Minutes
Round difficulty - Medium
Interviewer was very nice and made me feel pretty comfortable. We talked about our hobbies for about 10mins and then he asked about my projects and which was my favourite of all. He then asked me a coding question. Which was like pretty easy and I gave him the optimized approach right away. He was satisfied with my approach and just moved on to the next part. He asked me some basic questions related to Operating Systems(related to deadlocks and semaphores). He even asked some basic questions related to OOPS. Then he gave me the next question. This was like a pretty new question for me and I took some time to understand the problem statement and then took some time to think about the logic. I was also sharing my approach with interviewer as well.I finally told him about my approach. He told me that my approach was fine but there also was some other approach but normally no-one would come up with that approach until they have previously solved the question.
We are provided with a tree containing 'N' nodes, numbered from 0 to N-1. The objective is to determine the total number of nodes within each subtree of the provided tree. Speci...
Round duration - 30 Minutes
Round difficulty - Easy
Interviewer seemed to be a senior manager.He just asked about me and started with the interview.Interviewer asked me to design a standard map(hash-map). I gave him my approach and he also asked me to devise a hash function for it. I also gave him a hash function and he seemed to be pretty satisfied.
Tip 1 : Practise as many questions as you can
Tip 2 : Try solving the question on your own.
Tip 3 : To learn the concepts of OOM its best to go through a project.
Tip 1 : Mention your coding achievements
Tip 2 : Do not make a big resume.
I was interviewed before Jun 2021.
Round duration - 45 Minutes
Round difficulty - Medium
The interviewer was nice and he made me feel comfortable
Topics :- Data structures, string manipulation and pointers
Timing :- Afternoon
You are provided a string STR
of length N
, consisting solely of lowercase English letters.
Your task is to remove all duplicate occurrences of characters i...
Round duration - 60 Minutes
Round difficulty - Medium
The interviewer was very supportive and we had a good discussion regarding his role in cisco etc.
Questions on various topics were asked including my courses, resume and internship
You are provided with a binary tree consisting of integer-valued nodes. The task is to compute the In-Order, Pre-Order, and Post-Order traversals for the given binary tree.
Round duration - 30 Minutes
Round difficulty - Medium
It was the HR round
Tip 1 : Practice coding questions of each difficulty level in the ratio of 3:2:1 (easy:medium:hard)
Tip 2 : Make sure that you have thorough knowledge of your projects/internships
Tip 1 : Update your resume to highlight your strengths
Tip 2 : Remove unnecessary courses in which you aren’t confident
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Development Engineer II
8
salaries
| ₹15.5 L/yr - ₹40 L/yr |
Software Engineer
7
salaries
| ₹12 L/yr - ₹16.6 L/yr |
Software Developer
7
salaries
| ₹12.7 L/yr - ₹18 L/yr |
Engineering Manager
7
salaries
| ₹42 L/yr - ₹62.3 L/yr |
Software Development Engineer 3
7
salaries
| ₹33 L/yr - ₹60 L/yr |
Cisco
Juniper Networks
Aruba Networks
Fortinet