Filter interviews by
I applied via Campus Placement and was interviewed in Apr 2024. There were 2 interview rounds.
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.
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...
posted on 7 Oct 2023
Easy basic dsa questions
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.
Xeno interview questions for popular designations
Top trending discussions
I applied via Naukri.com and was interviewed before Nov 2020. There were 5 interview rounds.
I applied via Recruitment Consultant and was interviewed before Jun 2020. There were 4 interview rounds.
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
I was interviewed before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 50 minutes
Round difficulty - Easy
Round duration - 60 minutes
Round difficulty - Easy
At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.
Round duration - 40 minutes
Round difficulty - Easy
The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked me some Computer Science fundamentals in this round as well as some behavioural questions.
Implement a Trie data structure with insert and search functions.
Create a TrieNode class with children and isEndOfWord attributes.
Implement insert function to add words by iterating through characters.
Implement search function to check if a word exists by traversing the Trie.
Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.
Do lot of hard work and practice of Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.
Application resume tips for other job seekersMake your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.
Final outcome of the interviewSelectedI applied via Naukri.com
based on 6 interviews
Interview experience
3-6 Yrs
Not Disclosed
3-6 Yrs
Not Disclosed
3-8 Yrs
Not Disclosed
Software Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Consultant
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Web Developer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Zomato
Swiggy
Ola Cabs
Uber