i
Leena
AI
Filter interviews by
I applied via Campus Placement and was interviewed in Nov 2021. There were 4 interview rounds.
Binary search has O(log n) time complexity for arrays and O(n) for linked lists.
Binary search is efficient for arrays due to their random access nature.
Linked lists require sequential traversal, making binary search inefficient.
For arrays, the time complexity is O(log n) as the search space is halved with each iteration.
For linked lists, the time complexity is O(n) as all nodes must be visited to find the target.
Binary...
Construct a tree using inorder and postorder traversal lists.
The last element of the postorder list is the root of the tree.
Find the root in the inorder list and split the list into left and right subtrees.
Recursively construct the left and right subtrees using the corresponding sublists.
Return the root node.
Time complexity: O(n^2) in worst case, O(nlogn) on average.
Find depth of binary tree through recursion and iteration
Recursively traverse left and right subtrees and return the maximum depth
Iteratively traverse the tree using a stack or queue and keep track of the depth
Depth of an empty tree is 0
Depth of a tree with only one node is 1
Intersection of two arrays is the common elements present in both arrays.
Sort both arrays and use two pointers to compare elements.
Use a hash set to store elements of one array and check for presence in the other array.
If arrays are already sorted, use binary search to find common elements.
Find the heavier ball from 8 identical balls using a balance weighting machine in least number of tries.
Divide the balls into 3 groups of 3, 3, and 2 balls.
Weigh the first two groups against each other.
If they balance, the heavier ball is in the remaining group of 2 balls.
If one group is heavier, weigh two balls from that group against each other.
If they balance, the heavier ball is the remaining ball.
If one ball is he...
Top trending discussions
I applied via Campus Placement and was interviewed in Mar 2023. There were 4 interview rounds.
Aptitude Test with 1 coding question and 8 other aptitude questions
I appeared for an interview in Oct 2024, where I was asked the following questions.
Low level Design Problem in Java
System Design with few details
Design a database table for managing user accounts in a web application.
Table Name: Users
Columns: id (INT, Primary Key), username (VARCHAR), password (VARCHAR), email (VARCHAR), created_at (TIMESTAMP)
Indexes: Create an index on username for faster lookups.
Constraints: Ensure email is unique and validate password strength.
I appeared for an interview before Jun 2024, where I was asked the following questions.
posted on 15 Nov 2024
I applied via Referral and was interviewed in Oct 2024. There was 1 interview round.
Promises in JavaScript are objects representing the eventual completion or failure of an asynchronous operation.
Promises are used to handle asynchronous operations in JavaScript.
They can be in one of three states: pending, fulfilled, or rejected.
Promises can be chained using .then() to handle success and .catch() to handle errors.
posted on 14 May 2024
Event loop in Node.js manages asynchronous operations by executing callback functions when certain events occur.
Event loop is responsible for handling I/O operations, timers, and callbacks in Node.js
It allows Node.js to perform non-blocking operations efficiently
Event loop continuously checks the event queue for new events to execute
Some of the top questions asked at the Leena AI Software Development Engineer interview -
Chat Bot Developer
39
salaries
| ₹10.7 L/yr - ₹19.3 L/yr |
Customer Success Manager
24
salaries
| ₹9 L/yr - ₹26 L/yr |
Software Engineer
16
salaries
| ₹7.3 L/yr - ₹18.6 L/yr |
Senior Software Engineer
16
salaries
| ₹27.9 L/yr - ₹49.5 L/yr |
Software Developer
13
salaries
| ₹13.2 L/yr - ₹26.7 L/yr |
Vyapar
Tata nexarc
Classplus
Fleetx.io