Glance Software Engineer Intern Interview Questions and Answers

Math, logic, and some error debugging

Q1. Talk about yourself, projects, organization experience
Add your answer

Q1. Rotate array and fizz buzz
Add your answer

Medium DSA questions

Q1. String subsequence based question
Add your answer
Q2. Only one question
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. Techical questions and coding questions related profile.
Add your answer
Q2. Basic concepts about your programming skills.
Add your answer

Solving normal Puzzles to test aptitude.

Sample app was asked to create.

Q1. Delete nth node from end in linked list
Ans. 
To delete the nth node from the end in a linked list, we can use a two-pointer approach.
• Use two pointers, one to traverse the list and another to keep track of the nth node from the end.

• Move the second pointer n steps ahead of the first pointer.

• When the second pointer reaches the end of the list, the first pointer will be at the nth node from the end.

• Adjust the pointers to delete the nth node.
Answered by AI
Add your answer
Q2. Project discussion
Add your answer

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

Q1. How set is implemented?
Ans. 
A set is implemented as a data structure that stores unique elements with no specific order.
• A set does not allow duplicate elements.

• Sets are commonly implemented using hash tables or binary search trees.

• Examples of set implementations include HashSet in Java and std::set in C++.
Answered by AI
Add your answer
Q2. How unordered set is implemented?
Ans. 
Unordered set is typically implemented using hash tables.
• Uses hash tables to store elements with unique keys

• Provides constant time complexity for insertion, deletion, and lookup operations

• Does not maintain any specific order of elements
Answered by AI
Add your answer