RingCentral Sdet 2 Interview Questions and Answers

Data Structure related questions

Q1. Java related interview questions
Add your answer

Leetcode trap watee question

Q1. Design and code a zoo management system.
Ans. 
A zoo management system to track animals, enclosures, staff, and visitor information.
• Create classes for animals, enclosures, staff, and visitors

• Implement functions for adding, updating, and deleting records

• Include features for scheduling feeding times, cleaning enclosures, and managing staff shifts
Answered by AI
Add your answer

Standard DSA questions

Q1. Standard HR stuff.
Add your answer

4 Coding Questions Leetcode Level Medium to Hard. Had to solve it within 1.5 hours.

Was able to solve 2 questions - One hard and one Medium. Hadn't enough time to solve all.

Q1. DSA based round. Was asked to write 3 APIs based on the the given n-ary tree.
Add your answer
Q2. Questions based on Path, end node, best path, etc.
Add your answer

Q1. System Design round : Was asked to design RDBMS for the given problem.
Add your answer

Q1. HM Round : Mostly behavioral based around Twilio Magic Values
Add your answer

Q1. Bar Raiser Round : Taken by a director. Was asked behavioral questions again.
Add your answer

Hacker rank codinv problems level medium

Q1. Coding round again D and S
Add your answer

Q1. System design tech dummies
Add your answer

Q1. Common questions , why we should hire you , achievements
Add your answer

Q1. Reverse linked list using the recursion
Ans. 
Reverse a linked list using recursion
• Create a recursive function that takes the head of the linked list as input

• Base case: if the head is null or the next node is null, return the head

• Recursively call the function with the next node as input

• Set the next node's next pointer to the current node

• Set the current node's next pointer to null

• Return the new head of the reversed linked list
Answered by AI
Add your answer
Q2. Find max number in the linked list using stack.
Ans. 
To find max number in linked list using stack.
• Create an empty stack.

• Traverse the linked list and push each element onto the stack.

• Pop elements from the stack and compare with max value.

• Return the max value.
Answered by AI
Add your answer