Xeno Interview Questions and Answers

He will be asking you about the logic you used to solve the OA questions. So prepare well.
He then asked questions from my resume and asked me to code and explain cycle in a linked list. I easily did the coding part using brute force and optimized approach but then he asked my to give proof that why tortoise and hare algo will work here. I explained him the mathematical proof.

Q1. In this round he started asking questions from my resume and then gave me DSA question to solve which was 523. Continuous subarray sum and then he asked me several question related to Reactjs , Nodejs , Mo...read more
Add your answer
Q2. 523. Continuous Subarray sum
Add your answer

Q1. 2 sum problem [leetcode]
Add your answer
Q2. Linkedlist problem
Ans. 
Implement various operations on a linked list and solve related problems like reversing a linked list or detecting a cycle.
• Understand the basic structure of a linked list with nodes containing data and a reference to the next node.

• For insertion, update the pointers of the nodes accordingly to maintain the sequence.

• For deletion, adjust the pointers to skip the node to be deleted.

• To reverse a linked list, iterate through...read more
Answered by AI
Add your answer

Q1. Given a data set of hotel you need to find number of booking.
Add your answer
Q2. SQL Query based upon join leetcode.
Add your answer

Easy basic dsa questions

Q1. Basics of dsa and project discussion
Add your answer
Q2. Stair climbing based on dp
Add your answer
Q3. Longest common subsequence
Ans. 
Longest common subsequence is the longest sequence of characters that appear in the same order in two or more strings.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the lengths of longest common subsequences of substrings.

• Traverse the array to find the longest common subsequence.
Answered by AI
Add your answer
Q4. Buy and sell stock
Add your answer
Q5. Project discussion based on resume
Add your answer