Xoriant Sdet Lead Interview Questions and Answers

Q1. Automation framework related questions
Add your answer
Q2. Java coding on strings
Add your answer

Q1. Questions based on java collections
Add your answer

There is 1 coding question from ds, and 5 MCQs from general programming knowledge

This is a craft round where you have to finish an assignment keeping in mind all the protocols, basically a production ready code. Around a week's time is given

Q1. This round is based on the project we have done, they asked to do some modifications there and then, examples like change the queries, api responses, unit test cases, logging, caching, implementation of lo...read more
Add your answer

Q1. This is purely DS algo round, they asked a dp based question which I couldn't answer. Something modified on house robbery problem
Add your answer

Java Coding Test dsa program and all that

Q1. Django in depth questions
Add your answer
Q2. Django ORM related questions
Add your answer

Simple and basic and questions from time and distance and also some blood relation problem.

Easy to Medium and some medium level questions from string and array

Round duration - 90 Minutes
Round difficulty - Easy

In this round, there are a total of 16 questions and the time given was 90 mins.

3 Coding questions – Easy, Medium, and Hard.
13 MCQs based on outputs, Computer fundamentals, Aptitude.

Q1. 
N Queens Problem Statement
You are provided with an integer 'N'. For an 'N' x 'N' chessboard, determine how to position 'N' queens such that no queen can attack another queen on the chessboard.
Explanati...read more
Ans. Backtracking
1. Instead of checking all the places on the chessboard, we can use backtracking and place queen row-wise or column-wise.
2. Suppose we place queens row-wise, and we start with the very first row. Place the queen and move to the next row until either there is a solution or there are no viable cells left.
3. As we backtrack, check to place the queen in the different columns of the same row.
4. When we can place a queen at ...read more
Answered Anonymously
Add your answer
Q2. 
Pair Sum Problem Statement
Given an integer array ARR of size N and an integer S, your goal is to return a list of all pairs of elements such that the sum of elements of each pair equals S.
Example:
Inp...read more
Ans. Brute Force
• Initialize a list to store our results.
• For each element in the array 'ARR[i]', check if ('ARR[i]' + ‘ARR[j]’), equals to given sum or not, where ‘i’ < ‘j’ < ‘N’.
• If the condition matches, add the pair('ARR[i]', ‘ARR[j]’) to the list. Sort the list of pairs as per the given output format and return this list.
Space Complexity: O(1)Explanation:
O(1).
 
Constant extra space is required.
Time Complexity: O...read more
Answered Anonymously
Add your answer
Q3. 
Minimum Number of Platforms Needed Problem Statement
You are given the arrival and departure times of N trains at a railway station for a particular day. Your task is to determine the minimum number of pl...read more
Ans. Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Answered Anonymously
Add your answer

Round duration - 120 minutes
Round difficulty - Easy

This round is an interesting experience to brainstorm, problem-solve and pair alongside a ThoughtWorks Developer that allows you to demonstrate hands-on coding, design, OOP, and solution skills on the code which you have submitted.The problem statement will be shared with you 20 minutes before the start time of the interview

Q1. Programming/Coding skills for automation
Add your answer
Q2. Process related questions, questions related to all type of testing.
Add your answer

They will give you a page or page elements to automate.

Q1. Salary negotiations
Add your answer