Virtual Employee Senior Developer Interview Questions and Answers

Q1. Distance bw 2 nodes in binary tree
Ans. 
To find the distance between two nodes in a binary tree, we can find the distance from the root to each node and then calculate the distance between the two nodes.
• Calculate the distance from the root to each node using a recursive function

• Find the lowest common ancestor of the two nodes

• Calculate the distance from each node to the lowest common ancestor and add them together to get the total distance
Answered by AI
Add your answer
Q2. Valid sudoku of 9*9
Ans. 
A valid sudoku of 9*9 is a grid where each row, column, and 3x3 subgrid contains the numbers 1-9 without repetition.
• Each row must contain the numbers 1-9 without repetition

• Each column must contain the numbers 1-9 without repetition

• Each 3x3 subgrid must contain the numbers 1-9 without repetition
Answered by AI
Add your answer

It's was MCQ based test

Q1. Tell me some of the oops concepts
Ans. 
Some OOP concepts include inheritance, encapsulation, polymorphism, and abstraction.
• Inheritance: Allows a class to inherit properties and behavior from another class.

• Encapsulation: Bundling data and methods that operate on the data into a single unit.

• Polymorphism: Ability to present the same interface for different data types.

• Abstraction: Hiding the complex implementation details and showing only the necessary features
Answered by AI
Add your answer

Q1. What is Guid Id please explain
Ans. 
A Guid Id is a globally unique identifier used in software development to uniquely identify objects or entities.
• Guid Ids are 128-bit integers represented as a hexadecimal string.

• They are typically used in databases, APIs, and various software systems to ensure uniqueness.

• Example: 6B29FC40-CA47-1067-B31D-00DD010662DA
Answered by AI
Add your answer

Q1. Discussion about salary
Add your answer

Q1. Abstract class and interface
Add your answer
Q2. Oops concepts and
Add your answer

Profit and loss average , simple intesest

Fibonacci numbers , prime numbers , even odd numbers

Q1. Check Valid parenthesis
Ans. 
Check if a string of parentheses is valid
• Use a stack to keep track of opening parentheses

• Pop from stack when encountering a closing parenthesis

• If stack is empty at the end and all parentheses are matched, it is valid
Answered by AI
Add your answer

Medium leveln coding round

Q1. Closure promise event loop
Add your answer

Q1. Tell me about yourself
Add your answer

Q1. Technical questions
Add your answer