Filter interviews by
I appeared for an interview in Nov 2024.
I appeared for an interview before Apr 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with 2 DSA problems.
You are provided with an undirected graph composed of 'N' vertices and 'M' edges, where vertices are labeled from 1 to 'N'.
Your task is to determine if...
Detect if there exists a cycle in an undirected graph.
Use Depth First Search (DFS) to traverse the graph and detect cycles.
Maintain a visited set to keep track of visited vertices.
If a visited vertex is encountered again during DFS, a cycle exists.
Return 'Yes' if a cycle is found, 'No' otherwise.
Given a binary tree, your task is to perform a zigzag level order traversal. This traversal starts from left to right on the first level, then switches to righ...
Perform zigzag level order traversal on a binary tree.
Use a queue to perform level order traversal of the binary tree.
Alternate between left to right and right to left traversal for each level.
Handle null nodes represented by -1 in the input.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via LinkedIn and was interviewed in Jul 2020. There was 1 interview round.
Cycle detection in a directed graph
Use Depth First Search (DFS) algorithm to detect cycles in a directed graph
Maintain a visited set to keep track of visited nodes
Maintain a recursion stack to keep track of nodes in the current DFS traversal
If a node is visited and is already in the recursion stack, then a cycle is detected
Zig Zag order traversal of a binary tree is a way to traverse the tree in a zigzag pattern.
Start from the root node and traverse the tree level by level.
For odd levels, traverse from right to left.
For even levels, traverse from left to right.
Use a stack to keep track of the nodes to be traversed.
Repeat until all nodes have been visited.
Query to find number of trains between 2 given stations in SQL design.
Use a JOIN statement to join the tables containing train and station information.
Filter the results based on the given stations.
Count the number of trains in the result set.
Consider the direction of travel and the order of the stations in the query.
Handle cases where there are no trains between the given stations.
Top trending discussions
I applied via Campus Placement and was interviewed in Sep 2024. There were 2 interview rounds.
There are 3 questions. basic to medium level.
I will walk through a project code to explain its structure and functionality.
Start by explaining the overall architecture of the project
Discuss the main components/modules and their interactions
Explain any key algorithms or data structures used
Highlight any design patterns or best practices implemented
Provide examples of specific code snippets to illustrate your points
I appeared for an interview before Jun 2023.
Program to read a file in backend development
Use a programming language like Python, Java, or C++ to open and read the file
Use file handling functions to read the contents of the file
Handle exceptions for file not found or permission issues
Close the file after reading to free up system resources
I applied via Approached by Company and was interviewed in Jul 2024. There were 4 interview rounds.
The first round is an aptitude assessment that consists of coding questions focused on dynamic programming, as well as medium to hard level aptitude and reasoning questions.
The second round focuses on coding and consists of data structure and algorithm questions related to arrays, linked lists, basic Java concepts, strings, and project-based questions from the resume.
The third round also consists of coding, which includes challenging data structures and algorithms questions based on graphs, trees, multithreading, and difficult SQL-based questions.
My short-term goal is to enhance my skills in backend development and contribute effectively to the team. My long-term goal is to become a lead developer and work on innovative projects.
Short-term goal: Improve backend development skills
Short-term goal: Contribute effectively to the team
Long-term goal: Become a lead developer
Long-term goal: Work on innovative projects
I break down the problem into smaller tasks, prioritize them, and focus on the most critical aspects first.
Break down the problem into smaller, more manageable tasks
Prioritize tasks based on importance and impact
Focus on critical aspects first to ensure progress
Regularly reassess and adjust the plan as needed
I applied via Recruitment Consulltant and was interviewed in Jul 2024. There was 1 interview round.
I have to write code for a load balancer. The code should be testable and imahoild be thread safe
I applied via Referral and was interviewed before Sep 2022. There were 4 interview rounds.
Exam to test reasoning and aptitude, and speed to answer them
Dsa question easy to medium level
Print pyramid from Fibonacci sequence
Generate Fibonacci sequence up to a certain number
Use the Fibonacci numbers to create the pyramid structure
Print each row of the pyramid with appropriate spacing
Design SQL tables for library management system
Create tables for books, authors, members, transactions, etc.
Use primary and foreign keys to establish relationships between tables
Include columns like book title, author name, member ID, due date, etc.
based on 1 interview
Interview experience
Senior Software Engineer
68
salaries
| ₹11 L/yr - ₹33 L/yr |
Senior Associate
68
salaries
| ₹3 L/yr - ₹7 L/yr |
Software Engineer
54
salaries
| ₹8.4 L/yr - ₹18 L/yr |
Team Lead
47
salaries
| ₹2.5 L/yr - ₹10 L/yr |
Associate
30
salaries
| ₹1 L/yr - ₹5 L/yr |
HighRadius
Angel One
AGS Transact Technologies
Rupeek