iServices Interview Questions and Answers

DSA questions asked in an interview

Q1. Previous Experience
Add your answer
Q2. Suitability for this job
Add your answer

Q1. Since your past experience is different, how will you fit in here
Ans. 
I believe my diverse experience will bring fresh perspectives and new ideas to the team, enhancing overall performance.
• I have a track record of quickly adapting to new environments and excelling in different roles.

• My varied background has equipped me with a range of skills that can be applied in this position.

• I am eager to learn and contribute to the team, bringing a unique perspective to the table.
Answered by AI
Add your answer
Q2. Will you perform outside KRA also
Ans. 
Yes, I am willing to perform outside my Key Result Areas (KRAs) if needed.
• I believe in going above and beyond my assigned responsibilities to contribute to the overall success of the team and organization.

• I have previous experience taking on additional tasks outside my KRA, such as assisting with project management or training new team members.

• I am flexible and adaptable, willing to step in and help wherever needed to ...read more
Answered by AI
Add your answer

Contracts review and abstraction

Q1. Contracts and essential elements
Add your answer

Q1. How python dictionary is implemented internally ?
Ans. 
Python dictionary is implemented using hash tables.
• Python dictionary is a collection of key-value pairs.

• The keys in a dictionary must be unique and immutable.

• The values in a dictionary can be of any data type.

• Python dictionary is implemented using hash tables.

• Hash tables provide constant time complexity for insertion, deletion and retrieval of elements.

• The hash function used in Python dictionary is based on the key's h...read more
Answered by AI
Add your answer
Q2. What is heap sort
Ans. 
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
• It divides the input into a sorted and an unsorted region.

• It repeatedly extracts the maximum element from the unsorted region and inserts it into the sorted region.

• It has a time complexity of O(n log n) and is not stable.

• Example: [8, 5, 3, 1, 9, 6, 0, 7, 4, 2] -> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
Answered by AI
Add your answer
Q3. Coding question to sort array based on a custom filter
Ans. 
Sort an array of strings based on a custom filter criteria.
• Define the custom filter criteria (e.g., length, alphabetical order).

• Use built-in sorting functions with a comparator.

• Example: Sort by length: ['apple', 'banana', 'kiwi'] -> ['kiwi', 'apple', 'banana'].

• Example: Sort alphabetically: ['banana', 'apple', 'kiwi'] -> ['apple', 'banana', 'kiwi'].
Answered by AI
Add your answer