Filter interviews by
Q1 - Delete all entries of a given number from a linked list.
Q2 - Find inorder traversal of a BST (with and without recursion).
Top trending discussions
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
2 coding question both and 15 MCQ
Only C , Java , Python are allowed
Given a square chessboard of size 'N x N', determine the minimum number of moves a Knight requires to reach a specified target position from its initial position...
The idea is to perform BFS traversal. Start from the initial position of the Knight and proceed to further cells. Traversal is performed using a queue. The queue stores the different paths travelled by the knight and also keeps storing the count of steps. When the target is popped from the queue, the corresponding count of the steps is the answer.
You are provided with an N * M
sized binary matrix 'MAT' where 'N' denotes the number of rows and 'M' denotes the number of columns. Your t...
Round duration - 45 minutes
Round difficulty - Easy
Around 6 am morning
2 interviewers
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
One way is to use recursion to reverse the list. Divide the linked list in two halves, the first node and the rest of the list. Reverse the second half using recursion and append the first half, that is the first node at the end of the reversed linked list. Return the head of the reversed linked list.
Algorithm
Tip 1 : Go through Semaphore extremely important
Tip 1 : they will ask question in between make sure u explain it in very detail and give example live like how this interview is happening online with each layer playing its role.
Tip 1 : Network address translation router
Tip 1 : I took this question to system design horizontal and vertical scaling which they agreed
Tip 1 : I said that i know earth radius , will calculate its surface area and multiple with average depth of water bodies in earth , they didn't respond.
Round duration - 30 minutes
Round difficulty - Easy
Manager Round
Tip 1 : Make sure if u project is working put its link preferably video of the working project my project was on ML and IOT and I put a Video link .
Round duration - 10 Minutes
Round difficulty - Easy
Salary breakdown and Location preference
Tip 1 : Computer Network should be strong
Tip 2 : Exposure to system programming also helps
Tip 3 : At least 150 problems and C++ was not allowed so prepare accordingly
Tip 1 : Project should be really good
Tip 2 : Write Computer Network and Operating System Courses in resume as course taken
I applied via Walk-in and was interviewed in Jul 2024. There was 1 interview round.
I applied via Campus Placement and was interviewed before May 2023. There were 3 interview rounds.
C, C++, OS, aptitute test, OS concepts
Pointers are variables that store memory addresses of other variables. Double pointers store memory addresses of pointers.
Pointers are used to access and manipulate memory addresses of variables.
Double pointers are used to store memory addresses of pointers themselves, allowing for indirect access to variables.
Example: char *ptr; int **dptr;
I applied via Referral and was interviewed in Jan 2024. There was 1 interview round.
DSA and Python based questions
posted on 17 Dec 2022
They ask us 40 mcqs and 2 coding questions. Mcqs are from networking,OS,DS,Ada and also have questions of general aptitude like direction,blood relation. Coding question are not easy both the questions are from Graph.
Find unique character from a string and optimize it
Use a hash table to store the frequency of each character in the string
Iterate through the hash table to find the character with frequency 1
If there are multiple characters with frequency 1, return the first one
Optimization: Stop iterating through the hash table once a character with frequency 1 is found
They give me a scenario like you have to go from place A to place B then what should You consider.
I applied via Company Website and was interviewed in Oct 2022. There were 4 interview rounds.
Basic Easy Level LeetCode Questions.
Medium Level Questions from LeetCode along with questions on String and one scenario based DS question.
posted on 5 Jul 2022
Reverse a linked list and find all possible subsequences in a given array.
To reverse a linked list, iterate through the list and change the next pointers of each node to the previous node.
To find all possible subsequences in an array, use recursion and generate all possible combinations of elements.
For example, given the array [1, 2, 3], the possible subsequences are [], [1], [2], [3], [1, 2], [1, 3], [2, 3], [1, 2, 3]
Computer Science Fundamentals
The project involves using machine learning algorithms to analyze and make predictions based on data.
Collecting and cleaning data
Selecting appropriate ML algorithms
Training and testing the model
Evaluating the model's performance
Applying the model to new data
Examples: predicting customer churn, detecting fraud, diagnosing diseases
Interview experience
Software Engineer
207
salaries
| ₹16 L/yr - ₹60 L/yr |
Software Developer
27
salaries
| ₹14.9 L/yr - ₹45 L/yr |
Softwaretest Engineer
26
salaries
| ₹11.4 L/yr - ₹41.4 L/yr |
Technical Solutions Engineer
13
salaries
| ₹8 L/yr - ₹22 L/yr |
Senior Software Engineer
12
salaries
| ₹15.5 L/yr - ₹56.6 L/yr |
Cisco
Juniper Networks
Hewlett Packard Enterprise
Extreme Networks