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
I applied via Recruitment Consulltant and was interviewed in Dec 2021. There were 2 interview rounds.
I applied via LinkedIn and was interviewed before Jul 2022. There were 3 interview rounds.
I applied via LinkedIn and was interviewed before Sep 2020. There were 3 interview rounds.
The accounts receivable process involves managing and tracking customer payments for goods or services provided by a company.
Invoicing customers for products or services rendered
Recording and tracking customer payments
Following up on overdue payments
Reconciling customer accounts
Generating financial reports related to accounts receivable
Working closely with sales and customer service teams
Implementing credit policies an...
The default credit term given on an invoice as per the MSME Act is 45 days.
The MSME Act mandates a default credit term of 45 days for invoices.
This means that the buyer is required to make payment within 45 days of receiving the invoice.
The credit term may be extended by mutual agreement between the buyer and seller.
If no specific credit term is mentioned in the invoice, the default term of 45 days applies.
Non-complian...
Leena AI interview questions for popular designations
Top trending discussions
The duration of Leena AI interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 14 interviews
Interview experience
based on 119 reviews
Rating in categories
Gurgaon / Gurugram,
Bangalore / Bengaluru
5-10 Yrs
Not Disclosed
Chat Bot Developer
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Manager
21
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Development Representative
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Jio Haptik
yellow.ai
Engati
Uniphore Software Systems