Glance Software Engineer Intern Interview Questions and Answers

Q1. DSA - level order traversal, sliding window.
Add your answer

Q1. Atomic transaction in distributed system
Ans. 
Atomic transactions ensure that all operations in a transaction are completed successfully or none at all in a distributed system.
• Atomic transactions guarantee that all operations within a transaction are either all successful or all rolled back.

• In distributed systems, atomic transactions are crucial for maintaining data consistency across multiple nodes.

• ACID properties (Atomicity, Consistency, Isolation, Durability) a...read more
Answered by AI
Add your answer

Computer Fundamentals

Q1. Flatten a binary tree
Ans. 
Flatten a binary tree by converting it into a linked list in-place.
• Use a recursive approach to flatten the binary tree.

• Traverse the tree in a pre-order manner and keep track of the previous node.

• Set the left child of each node to null and the right child to the next node in the linked list.

• Example: Input: 1 -> 2 -> 5 -> 3 -> 4 -> null, Output: 1 -> null -> 2 -> null -> 3 -> null -> 4 -> null -> 5 -> null
Answered by AI
Add your answer

Q1. Questions about python, Sql, Basic coding questions
Add your answer

Q1. How will you handle exceptions in django framework. it was basic discussion round with the cto
Add your answer

Q1. React, React Native Basics
Add your answer
Q2. Coding Arrays & Objects
Add your answer

It was good, actually they asked parentheses balance question, Getting duplicate values , pallindrome question and also Target sum with O(n) TC.

Q1. Basic questions
Add your answer
Q2. Tell Me about yourself?
Add your answer

Q1. How many sorting algorithms you know? Explain any one of the algorithm (He told me for insertion sort)? Write the code for it and tell the complexity
Add your answer
Q2. Puzzle based on 9 coins puzzle
Add your answer
Q3. Explain about the Project and the technologies used in it.
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Timing was late evening. Platform was good.

Q1. 
Largest Cycle in Maze Problem Statement
Given a maze represented by 'N' cells numbered from 0 to N-1, and an array arr of 'N' integers where arr[i] denotes the cell number that can be reached from the 'i'...read more
Ans. 
Identify the length of the largest cycle in a maze represented by cells and an array of integers.
• Iterate through each cell and find the cycle length using DFS or Floyd's Tortoise and Hare algorithm.

• Handle self-cycles and cells with no exit by checking arr[i] = i and arr[i] = -1 respectively.

• Output the length of the largest cycle found or -1 if no cycles exist.
Answered by AI
Add your answer
Q2. 
Ninja and the Maze Problem Statement
Ninja is stuck in a maze represented as a 2D grid. He can move in four directions (Up, Down, Left, Right) until he hits a wall ('1'). Once stopped, he can choose a new...read more
Ans. 
Determine if Ninja can reach the destination in a maze by moving in four directions until hitting a wall.
• Create a function to traverse the maze using depth-first search or breadth-first search.

• Keep track of visited cells to avoid infinite loops.

• Return 'True' if destination is reachable, 'False' otherwise.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Timing was late evening . Platform was good.

Q1. 
Largest Cycle in Maze Problem Statement
Given a maze represented by 'N' cells numbered from 0 to N-1, and an array arr of 'N' integers where arr[i] denotes the cell number that can be reached from the 'i'...read more
Ans. 
Identify the length of the largest cycle in a maze represented by cells and an array of integers.
• Iterate through each cell and find the cycle length using DFS or Floyd's Tortoise and Hare algorithm.

• Keep track of visited cells to avoid infinite loops.

• Return the length of the largest cycle found or -1 if no cycles exist.
Answered by AI
Add your answer