Random Trees Sdet Engineer Interview Questions and Answers

Dp, trees and basic time complexity

Q1. Tell me about your self
Ans. 
I am a software engineer with 5 years of experience in developing web applications using Java, Spring, and Angular.
• 5 years of experience in software development

• Proficient in Java, Spring, and Angular

• Strong problem-solving skills

• Experience working in Agile development environment
Answered by AI
Add your answer
Q2. Projects and intership
Add your answer

Questions based or percentage, profit loss, ratio

Q1. Explain about stacks
Ans. 
Stacks are a data structure that follows the Last In First Out (LIFO) principle.
• Elements are added and removed from the top of the stack

• Common operations include push (add element) and pop (remove element)

• Stacks can be implemented using arrays or linked lists

• Examples of stack usage include function call stack and undo/redo functionality in text editors
Answered by AI
Add your answer
Q2. To find middle number in the linked list
Ans. 
To find the middle number in a linked list.
• Traverse the linked list using two pointers, one moving twice as fast as the other.

• When the fast pointer reaches the end, the slow pointer will be at the middle node.

• If the linked list has even number of nodes, there will be two middle nodes. Return either one.
Answered by AI
Add your answer

Q1. Introduction , hobbies, goals
Add your answer
Q2. Strength, weakness, short term and long term goals
Add your answer

There are three sections: -
1. Quants
2. English
3. Reasoning
All sections are accessible medium but you have maintained the speed and accuracy.
after that coding snippet are in java/python.

Code snippets are there in coding sections.

Dsa problems dp and tress problem

Q1. Tell me about your self
Ans. 
I am a passionate software engineer with 5 years of experience in developing web applications using various technologies.
• 5 years of experience in software development

• Proficient in developing web applications

• Skilled in using various technologies

• Passionate about software engineering
Answered by AI
Add your answer
Q2. Projects and intership
Add your answer

The test was in hackerrank platform, it was moderate level.

3 questions, medium hard

Q1. Greedy Algorithm, simple jumps question, easily approachable by greedy algorithm
Add your answer
Q2. Binary Search, simple array based
Add your answer

Q1. DBMS, Projects, SQL Queries
Add your answer
Q2. 2 coding questions
Add your answer

Leetcode practice should be sufficient to tackle this round.

Q1. Trapping Rain Water problem.
Ans. 
Trapping Rain Water problem involves calculating the amount of water that can be trapped between buildings given their heights.
• Calculate the maximum height of buildings to the left and right of each building

• Find the minimum of the two heights

• Subtract the height of the current building to get the amount of water that can be trapped at that building
Answered by AI
Add your answer

Q1. DBMS: Indexing Python: Monkey Patching
Add your answer