Jio Sdet Lead Interview Questions and Answers

Easy questions based on DSA

Q1. Given binary tree tell visible nodes from below
Ans. 
Visible nodes in a binary tree are the nodes that are not blocked by any other nodes when viewed from below.
• Traverse the binary tree level by level and keep track of the maximum value seen at each level. Any node with a value greater than the maximum value seen so far is considered a visible node.

• Example: For a binary tree with values [5, 3, 8, 1, 4, 7, 9], the visible nodes from below would be [5, 8, 9].
Answered by AI
Add your answer
Q2. Reverse kth node in linked list
Ans. 
Reverse the kth node in a linked list
• Traverse the linked list to find the kth node

• Reverse the kth node by changing its next pointer to point to the previous node

• Update the pointers of the previous and next nodes accordingly

• Handle edge cases such as k being out of bounds or kth node being the head of the list
Answered by AI
Add your answer
Q3. Project related questions on mongodb
Add your answer

Q1. Tell me about your self
Ans. 
I am a dedicated and experienced SDET Lead with a passion for quality assurance and automation testing.
• Over 8 years of experience in software testing and test automation

• Strong expertise in leading testing teams and implementing QA processes

• Proficient in various testing tools and technologies such as Selenium, JUnit, and TestNG

• Proven track record of improving testing efficiency and product quality

• Excellent communication
Answered by AI
Add your answer