Upload Button Icon Add office photos

Xeno

Compare button icon Compare button icon Compare

Filter interviews by

Xeno Software Development Engineer Intern Interview Questions and Answers

Updated 7 Oct 2023

Xeno Software Development Engineer Intern Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

Easy basic dsa questions

Round 3 - Technical 

(5 Questions)

  • Q1. Basics of dsa and project discussion
  • Q2. Stair climbing based on dp
  • 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
  • Q4. Buy and sell stock
  • Q5. Project discussion based on resume

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare dsa well

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Level order tree traversal
  • Q2. Find the pair element from the array
  • Ans. 

    Find the pair element from the array

    • Iterate through the array and use a hashmap to store elements and their counts

    • Check if the current element's complement exists in the hashmap

    • Return the pair if found, otherwise return null

  • Answered by AI

Skills evaluated in this interview

I applied via Recruitment Consultant and was interviewed in May 2021. There were 4 interview rounds.

Interview Questionnaire 

10 Questions

  • Q1. First-round was an online test on hacker rank. There were 4 questions related to the array, string, and tree.
  • Q2. Create an immutable class.
  • Ans. 

    An immutable class is a class whose instances cannot be modified after creation.

    • Make all fields private and final

    • Don't provide any setter methods

    • Ensure that any mutable objects passed to the constructor are defensively copied

    • Make the class final so that it cannot be subclassed

  • Answered by AI
  • Q3. Create a Singelton pattern.
  • Ans. 

    Singleton pattern ensures only one instance of a class is created and provides a global point of access to it.

    • Create a private constructor to prevent direct instantiation of the class.

    • Create a private static instance of the class.

    • Create a public static method to access the instance, and create the instance if it doesn't exist.

    • Ensure thread safety by using synchronized keyword or double-checked locking.

  • Answered by AI
  • Q4. Difference between Vector and ArrayList.
  • Ans. 

    Vector is synchronized and ArrayList is not. Vector is thread-safe and ArrayList is not.

    • Vector is a legacy class and ArrayList is a part of the Java Collection Framework.

    • Vector is synchronized which means only one thread can access it at a time, while ArrayList is not.

    • Vector is thread-safe which means it can be used in a multi-threaded environment, while ArrayList is not.

    • Vector is slower than ArrayList because of synch...

  • Answered by AI
  • Q5. Create Linked List without using the internal library and provide the functionality of add delete find.
  • Ans. 

    Create Linked List without using internal library and provide add, delete, find functionality.

    • Create a Node class with data and next pointer

    • Create a LinkedList class with head pointer and methods to add, delete, and find nodes

    • Use a loop to traverse the list and perform operations

    • Handle edge cases such as adding to an empty list or deleting the head node

  • Answered by AI
  • Q6. One question was related to binary search.
  • Q7. Few more questions related to java.
  • Q8. The architecture of the current system.
  • Ans. 

    The current system follows a microservices architecture.

    • The system is divided into multiple independent services.

    • Each service has its own database and communicates with other services through APIs.

    • The architecture allows for scalability and flexibility.

    • Examples of microservices used in the system include user authentication, payment processing, and inventory management.

  • Answered by AI
  • Q9. Find the total no of the island in a 2d matrix. Working code was required.
  • Ans. 

    Find the total no of islands in a 2D matrix.

    • Use DFS or BFS to traverse the matrix.

    • Mark visited cells to avoid repetition.

    • Count the number of islands found.

  • Answered by AI
  • Q10. Find loop in a linked list.
  • Ans. 

    Loop detection in a linked list.

    • Use two pointers, one moving at twice the speed of the other.

    • If there is a loop, the faster pointer will eventually catch up to the slower one.

    • If there is no loop, the faster pointer will reach the end of the list.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Before the interview brush up on the Linked list, Tree, and array. This is a common interview problem asked in Snapdeal.

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(1 Question)

  • Q1. Where do you see yourself in 5 years
  • Ans. 

    In 5 years, I see myself as a senior software engineer leading a team of developers on innovative projects.

    • Leading a team of developers on innovative projects

    • Continuing to enhance my technical skills and knowledge

    • Contributing to the growth and success of the company

    • Possibly pursuing further education or certifications in a specialized area

  • Answered by AI
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed before Dec 2023. There was 1 interview round.

Round 1 - Coding Test 

Techstack knowledge of Scala, Kafka etc

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

This was MCQ+Coding round.

  • Q1. How can you check if two strings are anagrams of each other?
  • Ans. 

    Check if two strings are anagrams by comparing the sorted versions of the strings.

    • Sort both strings and compare if they are equal.

    • Use a hashmap to store the frequency of characters in each string and compare the maps.

    • Ignore spaces and punctuation when comparing the strings.

  • Answered by AI
Round 2 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round 3 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from National Institute Of Technology, Silchar, Assam. I applied for the job as SDE - 1 in SiddharthnagarEligibility criteria6 CGPAAmazon interview preparation:Topics to prepare for the interview - Basic Computer Science backgroundTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.

Application resume tips for other job seekers

Add projects and Internships if you have done any and add only those things which you really know.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.

  • Q1. 

    Detect Cycle in a Directed Graph

    You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...

  • Ans. 

    Detect cycle in a directed graph using depth-first search (DFS) algorithm.

    • Use DFS to traverse the graph and detect back edges indicating a cycle.

    • Maintain a visited array to keep track of visited nodes during traversal.

    • If a node is visited again during traversal and it is not the parent node, then a cycle exists.

    • Return true if a cycle is detected, false otherwise.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview

  • Q1. 

    Next Smallest Palindrome Problem Statement

    Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.

    Explanation:

    You are given a number in string format, a...

  • Ans. 

    Find the next smallest palindrome greater than a given number represented as a string.

    • Convert the string to an integer, find the next greater palindrome, and convert it back to a string.

    • Handle cases where the number is a palindrome or has all digits as '9'.

    • Consider both odd and even length numbers when finding the next palindrome.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 11:00 am. Interview went well.

  • Q1. 

    Boundary Traversal of a Binary Tree

    Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.

    Input:

    The first line ...
  • Ans. 

    Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.

    • Traverse the left boundary nodes in a top-down manner

    • Traverse the leaf nodes from left to right

    • Traverse the right boundary nodes in a bottom-up manner

    • Handle cases where duplicates occur in the boundary nodes

    • Implement the function without printing as printing is already managed

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaGood knowledge of Data Structures, Some great projects which are used by the usersAmazon interview preparation:Topics to prepare for the interview - Data Structures, Web development, System Design, Algorithms, Dynamic Programming, Database, OS, Networking, OOPS, DevOpsTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. Learn them by heart. 
Tip 2 : For Web.Development Try to learn full stack development. See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.

Application resume tips for other job seekers

Tip 1 : Always try to make it a single page 
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Aug 2017.

Interview Questionnaire 

7 Questions

  • Q1. Implement Merge Sort.
  • Ans. 

    Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.

    • Divide the array into two halves

    • Recursively sort the two halves

    • Merge the sorted halves

  • Answered by AI
  • Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
  • Ans. 

    Find pairs of integers in a BST whose sum is equal to a given number.

    • Traverse the BST and store the values in a hash set.

    • For each node, check if (X - node.value) exists in the hash set.

    • If yes, add the pair (node.value, X - node.value) to the result.

    • Continue traversal until all nodes are processed.

  • Answered by AI
  • Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
  • Ans. 

    Merge overlapping time intervals into mutually exclusive intervals.

    • Sort the intervals based on their start time.

    • Iterate through the intervals and merge overlapping intervals.

    • Output the mutually exclusive intervals.

    • Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]

  • Answered by AI
  • Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
  • Ans. 

    Different types of hashing and alternative for Linear Chaining

    • Different types of hashing include division, multiplication, and universal hashing

    • Alternative for Linear Chaining is Open Addressing

    • Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing

  • Answered by AI
  • Q5. Implement AVL Tree.
  • Ans. 

    An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.

    • AVL tree is a binary search tree with additional balance factor for each node.

    • The balance factor is the difference between the heights of the left and right subtrees.

    • Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.

    • Rotations are performed ...

  • Answered by AI
  • Q6. Minimum number of squares whose sum equals to given number n.
  • Ans. 

    Find the minimum number of squares whose sum equals to a given number n.

    • Use dynamic programming to solve the problem efficiently.

    • Start with finding the square root of n and check if it is a perfect square.

    • If not, then try to find the minimum number of squares required for the remaining number.

    • Repeat the process until the remaining number becomes 0.

    • Return the minimum number of squares required for the given number n.

  • Answered by AI
  • Q7. Insertion sort for a singly linked list.
  • Ans. 

    Insertion sort for a singly linked list.

    • Traverse the list and compare each node with the previous nodes

    • If the current node is smaller, swap it with the previous node

    • Repeat until the end of the list is reached

    • Time complexity is O(n^2)

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22

Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.

Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.

College Name: The LNM Institute Of Information Technology, Jaipur

Skills evaluated in this interview

I applied via Campus Placement

Interview Preparation Tips

Round: Resume Shortlist
Experience: They selected 10 students from our college from CS and IT .They are looking for guys with extra projects done during college .App development will be a bonus ,contribution to open source and competitive programming will help for shortlisting.
Some of my friends had research papers published and they too got selected.

Round: Test
Experience: Have to write code snippet for 4 questions in 45 minutes
1.Difference between hour hand and minute hand
2.longest palindromic sub string.
3.Product Array puzzle
4.Some question related to matrix

Tips: All question were from geeksforgeeks
So practice it well ..u will make through it

Round: Test
Experience: Long Discussion on projects
They will scan each and every line of your Resume ,so dont write bullshits..
I wrote about interest in AI and got screwed..Discussion on college projects and final year project.
Then asked me to design a snake and ladder game OOPS concepts
Told me to find sum of all elements of sub matrix..(hint pre-processing the matrix)
Asked me about sessions and cookies
Gave a query to write on database indexing (dont remember exactly)
Asked me the code of the difference between hour hand and minute hand and extended it wid the second hand
Asked me as how to implement a dictionary
asked about TRIES ,CODE SNIPPET ON THE SHARED DOCS
One of my friend was asked to implement (set) of STL
Tips: The interviewer was cool guy..helped me a lot always made me comfortable.Interact with them as much as possible

Round: Test
Experience: Wid the CTO of the company .
Started wid the projects again .ACID properties,Database transactions,Concurrency Control
Optimization in database.
Then he asked me to code a function
Given a hash function applied on letters of English words ,un-hash it.Took me 45 minutes to reach the solution ,he helped me a lot.
Asked me to write the code for diameter of a binary tree
Asked me write the code for Boolean Matrix
One of my friend was asked to a question in which there was a bug in a m*n matrix and we have to find the bug(hint dfs or bfs)
Tips: keep calm ,,just keep talking ad he will help u a lot...

Round: HR
Experience: This was the toughest round for me...I had cleared all the rounds but they rejected me in the HR round ,,,dont know where I screwed..Learn every thing of Zomato..
They offered me an internship and thereafter they would look to give a PPO ...!!!lets see what happens

Skills: Coding Skills And Knowledge On Data Structures
Duration: 3
College Name: NIT Srinagar

Interview Questionnaire 

9 Questions

  • Q1. Write a regex for email validation?
  • Ans. 

    Regex for email validation

    • Start with a string of characters followed by @ symbol

    • Followed by a string of characters and a period

    • End with a string of characters with a length of 2-6 characters

    • Allow for optional subdomains separated by periods

    • Disallow special characters except for . and _ in username

  • Answered by AI
  • Q2. Parse the XML? and store the output in JSON. Discussed different approaches?
  • Q3. Print prime numbers in a given range and optimize the solution?
  • Ans. 

    Print prime numbers in a given range and optimize the solution.

    • Use Sieve of Eratosthenes algorithm to generate prime numbers efficiently

    • Start with a boolean array of size n+1, mark all as true

    • Loop through the array and mark all multiples of each prime as false

    • Print all the indexes that are still marked as true

  • Answered by AI
  • Q4. Puzzle – 25 horses – 5 lanes, find fastest 3 horses?
  • Q5. Web related questions on Sessions and cookies?
  • Q6. A lot of discussion on my resume, experience etc
  • Q7. Find angle between hour hand and minute hand in clock if time is given? Write a program or pseudo code?
  • Ans. 

    Find angle between hour and minute hand in a clock given the time.

    • Calculate the angle made by the hour hand with respect to 12 o'clock position

    • Calculate the angle made by the minute hand with respect to 12 o'clock position

    • Find the difference between the two angles and take the absolute value

    • If the angle is greater than 180 degrees, subtract it from 360 degrees to get the smaller angle

  • Answered by AI
  • Q8. A hash function was written to convert a string into a hash. Write a un-hash function to revert it(from hash to string)?
  • Ans. 

    To un-hash a string, use a reverse algorithm to convert the hash back to the original string.

    • Create a reverse algorithm that takes the hash as input and outputs the original string

    • Use the same logic as the hash function but in reverse order

    • If the hash function used a specific algorithm, use the inverse of that algorithm to un-hash the string

  • Answered by AI
  • Q9. He discussed about expectations and role. Asked me if I have any questions. He said to me “yaha aana hai to marwani padegi. tyar ho”? I smiled and asked what are the work timings? He said 9-9 and I was kin...

Interview Preparation Tips

General Tips: I applied through a recruiter. Then I got a call from Zomato HR. It was for LAMP developer profile. She asked me about my profile and also shared some expectations from the role. She asked me to come for F2F rounds to take the process further
Skills: Web development, JSON, Algorithm
College Name: na
Motivation: Overall process was not very tough. But they have start up culture. People work their for 11-12 hours a day. Sometimes on Saturday as well. So people who are geeks or have nothing in life to do except their job can go and join

Skills evaluated in this interview

Xeno Interview FAQs

How many rounds are there in Xeno Software Development Engineer Intern interview?
Xeno interview process usually has 3 rounds. The most common rounds in the Xeno interview process are Resume Shortlist, Coding Test and Technical.
What are the top questions asked in Xeno Software Development Engineer Intern interview?

Some of the top questions asked at the Xeno Software Development Engineer Intern interview -

  1. Longest common subseque...read more
  2. Basics of dsa and project discuss...read more
  3. Stair climbing based on...read more

Tell us how to improve this page.

Xeno Software Development Engineer Intern Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
Flipkart Interview Questions
4.0
 • 1.3k Interviews
Paytm Interview Questions
3.3
 • 752 Interviews
Swiggy Interview Questions
3.8
 • 428 Interviews
Zomato Interview Questions
3.8
 • 312 Interviews
Uber Interview Questions
4.2
 • 149 Interviews
Ola Cabs Interview Questions
3.4
 • 139 Interviews
MakeMyTrip Interview Questions
3.7
 • 122 Interviews
Snapdeal Interview Questions
3.8
 • 75 Interviews
BookMyShow Interview Questions
4.0
 • 23 Interviews
View all

Fast track your campus placements

View all
Software Engineer
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Consultant
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Data Analyst
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Web Developer
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Xeno with

Zomato

3.8
Compare

Swiggy

3.8
Compare

Ola Cabs

3.4
Compare

Uber

4.2
Compare
Did you find this page helpful?
Yes No
write
Share an Interview