Filter interviews by
I applied via Great learning
Top trending discussions
I applied via Naukri.com and was interviewed in May 2021. There was 1 interview round.
I appeared for an interview in Sep 2020.
I applied via Approached by Company and was interviewed before May 2021. There were 3 interview rounds.
Multiple choice questions
I appeared for an interview before Oct 2021.
A nested list is a list that contains other lists as its elements.
Nested lists can be created using square brackets and separating the elements with commas.
Elements of a nested list can be accessed using indexing and slicing.
Example: my_list = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
Accessing element 5: my_list[1][1]
A queue is a data structure that follows the First In First Out (FIFO) principle.
Elements are added to the back of the queue and removed from the front.
Example: A line of people waiting for a movie ticket.
Operations: Enqueue (add element to back), Dequeue (remove element from front), Peek (view front element)
posted on 27 Jul 2022
I applied via Campus Placement and was interviewed before Jul 2021. There were 5 interview rounds.
Round 1 was about 60 mins long. Basic Aptitude questions along with Programming MCQ
Round 2 had 2 coding questions with a time limit of 60mins. Intermediate level problem solving
knowledge is neccessary.
posted on 13 Dec 2021
I applied via Naukri.com and was interviewed in Jun 2021. There was 1 interview round.
posted on 24 Jan 2022
I applied via Campus Placement and was interviewed before Jan 2021. There were 3 interview rounds.
Code to split an array of integers into two subarrays with equal sum.
Iterate through the array and calculate the total sum.
Divide the sum by 2 to get the target sum for each subarray.
Use dynamic programming to find a subset of the array that adds up to the target sum.
Return the two subarrays.
Example: [1, 2, 3, 4, 5, 6] -> [1, 2, 3, 6], [4, 5]
Example: [1, 2, 3, 4, 5] -> [1, 4, 5], [2, 3]
Implementing a binary search tree and its traversal methods.
Start by defining a Node class with left and right child pointers.
Implement insert() method to add nodes to the tree.
Implement inorder(), preorder(), and postorder() traversal methods.
Implement search() method to find a node in the tree.
Implement delete() method to remove a node from the tree.
Consider edge cases like empty tree, duplicate nodes, etc.
I applied via Campus Placement and was interviewed in May 2021. There were 4 interview rounds.
Software Engineer
101
salaries
| ₹3 L/yr - ₹11.8 L/yr |
Technical Specialist
71
salaries
| ₹6 L/yr - ₹15.5 L/yr |
Technical Analyst
64
salaries
| ₹9 L/yr - ₹17 L/yr |
Senior Technical Analyst
62
salaries
| ₹11.5 L/yr - ₹19.5 L/yr |
Senior Software Engineer
62
salaries
| ₹4.5 L/yr - ₹17.4 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant