Filter interviews by
Clear (1)
I applied via Naukri.com and was interviewed in Sep 2023. There were 2 interview rounds.
Top trending discussions
Design a Zomato Ordering System for online food delivery.
Allow users to browse restaurants and menus
Implement user authentication and profile management
Enable users to place orders and make payments online
Include features like order tracking and ratings/reviews
Integrate with restaurant partners for order fulfillment
I applied via Recruitment Consulltant and was interviewed before Jan 2023. There were 3 interview rounds.
2 leetcode medium questions were asked
Designing a feature for a social media platform to allow users to create and share photo albums.
Allow users to create and name albums
Provide an interface for users to upload and organize photos within albums
Implement privacy settings to control who can view and contribute to albums
Include features like tagging, commenting, and liking photos within albums
Enable users to share albums with others via links or social media
I applied via Recruitment Consulltant and was interviewed before Oct 2022. There were 5 interview rounds.
2 hackerearth problem solving questions was asked.
posted on 21 Dec 2024
I applied via Referral and was interviewed in Nov 2024. There was 1 interview round.
posted on 13 Oct 2023
I applied via LinkedIn and was interviewed in Sep 2023. There were 3 interview rounds.
Total nodes in a binary tree can be found using depth-first or breadth-first traversal algorithms with time complexity O(n) and space complexity O(h), where h is the height of the tree.
Use depth-first traversal (pre-order, in-order, post-order) or breadth-first traversal to visit each node and count the total nodes.
Time complexity is O(n) where n is the number of nodes in the tree.
Space complexity is O(h) where h is th...
Construct 4 Array Tree and implement operations
Create an array to represent the tree structure
Implement operations like insert, delete, search, and traversal
Example: Construct a binary search tree using arrays
Use hashing to compare the JSON files in O(1) time complexity.
Create a hash function to convert the JSON data into a unique hash value.
Calculate the hash value for each JSON file and compare the hash values.
If the hash values are equal, the JSON files are identical.
Example: Use MD5 or SHA-256 hash functions for generating hash values.
Use array indices to map parent to children in a 4 Array tree in O(1) space complexity.
Assign children of a parent at indices 4*i+1, 4*i+2, 4*i+3, 4*i+4 where i is the index of the parent.
To find parent of a child at index j, use (j-1)/4 to get the parent index.
I applied via Referral and was interviewed before May 2023. There were 3 interview rounds.
2 Codes on Hackerrank
DSA medium level questions regarding stack, queue , arrays
posted on 15 Sep 2024
OOPS (Object-Oriented Programming) is a programming paradigm based on the concept of objects, which can contain data and code.
OOPS focuses on creating objects that interact with each other to solve problems.
It involves concepts like classes, objects, inheritance, polymorphism, and encapsulation.
For example, a class 'Car' can have objects like 'Toyota', 'Honda', etc., each with their own properties and methods.
Inheritan...
It was hackerrank test
based on 1 interview
Interview experience
Relationship Manager
22
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Associate
21
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Vice President
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Northern Arc Capital
IFMR Capital
NeoGrowth Credit
LendingKart