Filter interviews by
Clear (1)
I applied via Referral and was interviewed before Jan 2021. There was 1 interview round.
Top trending discussions
posted on 25 Oct 2023
I applied via Recruitment Consulltant and was interviewed before Oct 2022. There were 3 interview rounds.
A data structure is a way of organizing and storing data in a computer so that it can be accessed and modified efficiently.
Data structures define the way data is stored, accessed, and manipulated in a computer program.
Examples include arrays, linked lists, stacks, queues, trees, and graphs.
Choosing the right data structure is crucial for optimizing the performance of algorithms and applications.
A linked list is a data structure where each element is connected to the next element through pointers.
Consists of nodes where each node contains data and a reference to the next node
Can easily insert or delete elements without shifting other elements
Examples: singly linked list, doubly linked list, circular linked list
HashSet is a collection that does not allow duplicate elements and does not guarantee the order of elements.
HashSet implements the Set interface in Java.
It uses a hash table for storage.
Example: HashSet
Recursion is a programming technique where a function calls itself in order to solve a problem.
Recursion involves breaking down a problem into smaller subproblems and solving them recursively.
A base case is needed to stop the recursion and prevent infinite loops.
Recursion can be used to solve problems like factorial calculation, Fibonacci sequence, and tree traversal.
A static constructor is a special type of constructor in a class that is used to initialize static data members.
Static constructors are called only once when the class is first accessed.
They are used to initialize static variables or perform any necessary setup for the class.
Static constructors do not take any parameters and cannot be called explicitly.
Example: public class MyClass { static MyClass() { // initializatio
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
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.
based on 1 interview
Interview experience
Software Engineer
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
HR Recruiter
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Engineer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Keysight Technologies
Rohde & Schwarz
Anritsu
National Instruments