Filter interviews by
Be the first one to contribute and help others!
posted on 2 Jan 2025
I applied via Approached by Company and was interviewed in Dec 2024. There were 3 interview rounds.
I applied via Campus Placement
Question related to operating system and computer network
Traverse all child nodes in a tree data structure
Use depth-first or breadth-first traversal algorithms
Recursively visit each child node starting from the root node
Consider using a stack or queue data structure for traversal
Example: Traverse all nodes in a binary tree
I applied via Campus Placement and was interviewed in Nov 2024. There were 4 interview rounds.
1 and half hour coding assessment
1 - Hard question (100M)
1 - Medium question (50M)
1 - easy question (20M)
Reverses groups of k nodes in a linked list
Iterate through the linked list in groups of k nodes
Reverse each group of k nodes using a helper function
Update the pointers to connect the reversed groups back together
I applied via Naukri.com and was interviewed in Nov 2024. There were 3 interview rounds.
Joins in SQL are used to combine rows from two or more tables based on a related column between them.
Joins are used to retrieve data from multiple tables based on a related column between them
Common types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN
Example: SELECT * FROM table1 INNER JOIN table2 ON table1.column = table2.column
I have extensive project experience in operations management, including leading a team to improve efficiency and productivity.
Led a team in implementing a new inventory management system, resulting in a 20% reduction in stockouts
Streamlined the order fulfillment process by reorganizing warehouse layout and optimizing pick routes
Implemented performance metrics to track team productivity and identify areas for improvemen
I am looking to join Axtria because of its reputation for innovation and growth opportunities.
Impressed by Axtria's track record of innovation in the industry
Excited about the potential for growth and advancement within the company
Interested in working with a talented team of professionals at Axtria
I applied via campus placement at Dayananda Sagar College of Engineering, Bangalore and was interviewed in Oct 2024. There were 4 interview rounds.
3 coding dsa question
Difficulty is On your luck
My friends got easy level
I got medium level
Some got hard questions as well
Ssh round , quant and logical
Tip: bring your calculator
I applied via LinkedIn and was interviewed in Nov 2024. There were 2 interview rounds.
Mainly data leakage related problems
Best practices for handling memory leaks in iOS development
Use Instruments to identify memory leaks
Avoid strong reference cycles with weak or unowned references
Use autorelease pools for temporary objects
Implement proper memory management with ARC (Automatic Reference Counting)
Although it was quite challenging.
Complete it without significant difficulty.
posted on 28 Nov 2024
HashMap is a data structure that stores key-value pairs and uses hashing to efficiently retrieve values based on keys.
HashMap internally uses an array of linked lists to store key-value pairs.
When a key-value pair is added, the key is hashed to determine the index in the array where it will be stored.
If multiple keys hash to the same index, a linked list is used to handle collisions.
To retrieve a value, the key is hash...
Find anagrams from a string array
Iterate through each string in the array
Sort the characters of each string to create a key for comparison
Use a hashmap to group anagrams together
Return the grouped anagrams as arrays
A top view of a binary tree shows the nodes visible when looking at the tree from the top.
The top view of a binary tree is the set of nodes visible when looking at the tree from the top.
Nodes at the same horizontal distance from the root are considered at the same level.
Use a map to store the horizontal distance of each node and only keep the first node encountered at each horizontal distance.
Height of a binary tree is the maximum number of edges on the longest path from the root node to a leaf node.
Height of an empty tree is -1
Height of a tree with only one node is 0
Height of a binary tree can be calculated recursively by finding the height of left and right subtrees and adding 1 to the maximum of the two heights
Sales Executive
8
salaries
| ₹2 L/yr - ₹3.3 L/yr |
Store Manager
5
salaries
| ₹3.5 L/yr - ₹4.2 L/yr |
Cashier
5
salaries
| ₹2.5 L/yr - ₹3.7 L/yr |
Assistant Manager
4
salaries
| ₹2.9 L/yr - ₹3 L/yr |
Retail Store Manager
4
salaries
| ₹3.6 L/yr - ₹5.4 L/yr |
Thomson Reuters
Oracle Cerner
R Systems International
Chetu