Filter interviews by
I applied via Recruitment Consulltant and was interviewed before Oct 2021. There were 4 interview rounds.
I applied via Approached by Company and was interviewed in Mar 2022. There were 3 interview rounds.
I abele to the post any problems to slove
Custmer satisfy and trust the office and your language
I applied via Naukri.com and was interviewed in Aug 2022. There was 1 interview round.
ITC is a leading conglomerate with diverse business operations and a strong focus on sustainability.
ITC has a strong presence in multiple industries such as FMCG, hospitality, paperboards, and packaging.
The company has a reputation for innovation and sustainability, with initiatives such as e-Choupal and the ITC Green Centre.
ITC's commitment to social responsibility and community development aligns with my personal val...
I prefer the stability and resources of an established company.
I value the security and benefits that come with working for an established company.
I enjoy being part of a team and working towards a common goal.
I appreciate the opportunity to learn from experienced managers and mentors.
I believe that an established company provides more opportunities for career growth and advancement.
I am excited about the potential to ...
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
The algorithm finds the position of the 3rd occurrence of 'B' in an n-ary tree from a given index in constant time complexity.
Traverse the n-ary tree using a depth-first search (DFS) algorithm
Keep track of the count of 'B' occurrences
When the count reaches 3, return the current position
If the end of the tree is reached before the 3rd 'B', return -1
Check if a given string is a composite of two words from a limited dictionary.
Create a hash set of all the words in the dictionary.
Iterate through all possible pairs of substrings in the given string.
Check if both substrings are present in the hash set.
If yes, return true. Else, return false.
Switch adjacent nodes in a single linked list.
Traverse the linked list and swap adjacent nodes.
Keep track of previous node to update its next pointer.
Handle edge cases for first two nodes and last node.
Example: 1->2->3->4 becomes 2->1->4->3.
Traverse only the left sub-tree of a binary search tree.
Start at the root node
If the left child exists, visit it and repeat the process
If the left child does not exist, return to the parent node
Continue until all nodes in the left sub-tree have been visited
Design an efficient data structure for two lifts in a building of n floors.
Use a priority queue to keep track of the floors each lift is heading to
Implement a scheduling algorithm to determine which lift to assign to a new request
Consider adding a weight limit to each lift to prevent overloading
Use a hash table to keep track of the current location of each lift
To find the maximum number that can be formed from the digits of an integer.
Convert the integer to a string
Sort the characters in descending order
Join the sorted characters to form the maximum number
based on 2 reviews
Rating in categories
Junior Accountant
22
salaries
| ₹3.3 L/yr - ₹4.8 L/yr |
Senior Accountant
21
salaries
| ₹4.2 L/yr - ₹8.2 L/yr |
Sales Associate
6
salaries
| ₹2.4 L/yr - ₹7.1 L/yr |
Sales Executive
5
salaries
| ₹4.3 L/yr - ₹10 L/yr |
Assistant Manager
4
salaries
| ₹7 L/yr - ₹14.6 L/yr |
Lagardère Travel Retail
DFS Group
SSP Group
AutoGrill