i
Xoriant
Filter interviews by
Our framework is a hybrid framework that combines data-driven and keyword-driven approaches.
Our framework uses Excel sheets to store test data and keywords.
We have created custom libraries for commonly used functions.
We use Selenium WebDriver for web application testing.
Our framework supports parallel execution of tests.
We have integrated it with Jenkins for continuous integration.
We have also added reporting functiona
Top trending discussions
posted on 21 Nov 2020
I appeared for an interview in Sep 2019.
I applied via Recruitment Consultant and was interviewed before Jan 2020. There were 5 interview rounds.
I am proficient in Java, Python, and C++. I have 2 years of experience in software development. I have excellent communication skills for client interaction.
Proficient in Java, Python, and C++
2 years of software development experience
Excellent communication skills for client interaction
I applied via Naukri.com and was interviewed before Oct 2020. There were 5 interview rounds.
I appeared for an interview in Sep 2020.
posted on 12 Jul 2021
I applied via Naukri.com and was interviewed before Jul 2020. There were 3 interview rounds.
I applied via Recruitment Consulltant and was interviewed before Oct 2021. There were 3 interview rounds.
Deep Copy creates a new object with a new memory address while Shallow Copy creates a new reference to the same memory address.
Deep Copy duplicates the object and its properties while Shallow Copy only duplicates the object reference.
Object Prototyping is a way to create new objects based on existing objects.
Prototyping allows for inheritance and the ability to add or override properties and methods.
posted on 16 Apr 2021
I applied via Referral and was interviewed in Oct 2020. There was 1 interview round.
posted on 16 Apr 2021
Implement merge sort and find kth largest element in an array.
Merge sort is a divide and conquer algorithm that recursively divides the array into two halves, sorts them and then merges them.
Kth largest element can be found using quick select algorithm or by sorting the array and returning the kth element from the end.
Merge sort has a time complexity of O(nlogn) and space complexity of O(n).
Quick select has a time comp...
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Engineer
1.7k
salaries
| ₹4.5 L/yr - ₹14.5 L/yr |
Senior Software Engineer
1.7k
salaries
| ₹9 L/yr - ₹33.7 L/yr |
Softwaretest Engineer
623
salaries
| ₹2.5 L/yr - ₹8.7 L/yr |
Technical Lead
622
salaries
| ₹12 L/yr - ₹40 L/yr |
Senior Test Engineer
451
salaries
| ₹9 L/yr - ₹31.5 L/yr |
CitiusTech
HTC Global Services
HERE Technologies
Collabera Technologies