Filter interviews by
I applied via Job Fair and was interviewed in Aug 2024. There were 2 interview rounds.
Diff between e Learning and traditional
Case study on soft ware products
Automation test framework assignment using playwright
I would carefully weigh all factors and make a well-informed decision.
Consider all available information
Evaluate potential outcomes
Seek input from relevant parties
Make a decision based on facts and logic
The assessment is named 'Customer Support Associate'.
The assessment will likely focus on evaluating your skills and experience in customer service.
Prepare to discuss your communication skills, problem-solving abilities, and ability to handle difficult customers.
Be ready to provide examples of past experiences in customer support roles.
Demonstrate your knowledge of customer service best practices and techniques.
Showcase...
I applied via Naukri.com and was interviewed in Apr 2023. There were 3 interview rounds.
Erre ere ere e re r qw eq342 12312 312 3 123 123
Ttt. Pvt.ltd interview questions for popular designations
There are various inventory methods such as FIFO, LIFO, and weighted average. Different types of cargo include perishable, hazardous, and fragile items.
FIFO (First In, First Out) - oldest items are sold first
LIFO (Last In, First Out) - newest items are sold first
Weighted Average - average cost of all items in inventory
Perishable cargo - items that have a limited shelf life such as food and flowers
Hazardous cargo - item...
Coding Test Based on Sorting and scheduling algorithm
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 6 interviews
Interview experience
based on 15 reviews
Rating in categories
Manager
8
salaries
| ₹14.9 L/yr - ₹28.7 L/yr |
Softwaretest Engineer
8
salaries
| ₹11 L/yr - ₹20 L/yr |
Ttse
6
salaries
| ₹8.7 L/yr - ₹27 L/yr |
TT
6
salaries
| ₹4 L/yr - ₹41.7 L/yr |
TTS Employ
6
salaries
| ₹9 L/yr - ₹19 L/yr |
Xyz Company
1.2.3
Digital Empowerment Foundation
Ghi