i
Leena
AI
Filter interviews by
Find the maximum and minimum subarray sums within a given array of integers.
A subarray is a contiguous part of an array. For example, in [1, -2, 3, 4], [3, 4] is a subarray.
The maximum subarray problem seeks the contiguous subarray with the largest sum. Example: In [-2,1,-3,4,-1,2,1,-5,4], the maximum subarray is [4,-1,2,1] with a sum of 6.
The minimum subarray problem seeks the contiguous subarray with the smalles...
As a recruiter, I leverage AI to streamline candidate sourcing, enhance matching, and optimize hiring processes.
Utilize AI algorithms to analyze resumes and match skills with job requirements, ensuring a better fit.
Implement predictive analytics to identify candidates who are likely to succeed in specific roles based on historical data.
Use chatbots for initial candidate screening, allowing for quicker responses an...
AI will revolutionize HR by streamlining processes, enhancing recruitment, and improving employee engagement.
Automated resume screening: AI can quickly analyze resumes to identify the best candidates, saving time for HR teams.
Predictive analytics: AI can forecast employee turnover and help HR develop retention strategies.
Chatbots for recruitment: AI-powered chatbots can engage with candidates, answer queries, and ...
Efficiently search for an element in a sorted 2D array using binary search.
The array is sorted both row-wise and column-wise.
Start from the top-right corner of the array.
If the current element is greater than the target, move left.
If the current element is less than the target, move down.
Continue until the element is found or out of bounds.
Example: In [[1, 2, 3], [4, 5, 6], [7, 8, 9]], to find 5, start at 3.
Design a background process to fetch and process data efficiently and reliably.
Use a message queue (e.g., RabbitMQ, Kafka) to decouple data fetching from processing.
Implement a worker pool to handle multiple data processing tasks concurrently.
Schedule data fetching using cron jobs or a task scheduler like Celery.
Ensure data integrity with retries and error handling mechanisms.
Consider using a database (e.g., Postg...
The number of dials in a day varies based on goals, industry, and strategies employed in business development.
Typically, a Senior Business Development Executive might aim for 50-100 dials per day.
Quality over quantity: Focusing on meaningful conversations can lead to better outcomes.
Using CRM tools can help track dials and follow-ups efficiently.
Example: A successful day might include 70 dials resulting in 10 qual...
Manual test cases for WhatsApp security features
Verify end-to-end encryption is enabled for all messages
Test two-factor authentication setup and login process
Check for secure storage of user data on the device
Test for secure transmission of media files
Verify the effectiveness of blocking and reporting features
A compare function to compare two objects
Create a function that takes in two objects as parameters
Loop through the keys of one object and compare them with the keys of the other object
Return true if the objects have the same keys and values, otherwise return false
Find the longest substring without repeating characters
Use a sliding window approach to keep track of the current substring
Use a hash set to store the characters in the current substring
Update the start index of the window when a repeating character is encountered
ER Dia stands for Entity-Relationship Diagram, a visual representation of entities and their relationships in a database.
ER Dia is used to design databases by showing the entities (such as customers, products, orders) and the relationships between them.
Entities are represented as rectangles, relationships as diamonds, and attributes as ovals.
For example, in a library database, you may have entities like 'Book', 'A...
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 appeared for an interview in May 2025, where I was asked the following questions.
Find the maximum and minimum subarray sums within a given array of integers.
A subarray is a contiguous part of an array. For example, in [1, -2, 3, 4], [3, 4] is a subarray.
The maximum subarray problem seeks the contiguous subarray with the largest sum. Example: In [-2,1,-3,4,-1,2,1,-5,4], the maximum subarray is [4,-1,2,1] with a sum of 6.
The minimum subarray problem seeks the contiguous subarray with the smallest sum...
Designing a backend system for a ticket booking platform like Book My Show involves various components and interactions.
User Management: Handle user registration, authentication, and profiles.
Event Management: Create, update, and delete events with details like time, venue, and available seats.
Booking System: Manage ticket reservations, including seat selection and payment processing.
Notification Service: Send confirma...
I applied via LinkedIn and was interviewed in Aug 2024. There was 1 interview round.
Build testing is testing the software build to ensure it meets requirements. Shift left testing is moving testing earlier in the development process.
Build testing involves testing the software build to ensure it meets functional and non-functional requirements
Shift left testing is the practice of moving testing activities earlier in the software development process to catch defects sooner
By shifting testing left, defec...
Manual test cases for WhatsApp security features
Verify end-to-end encryption is enabled for all messages
Test two-factor authentication setup and login process
Check for secure storage of user data on the device
Test for secure transmission of media files
Verify the effectiveness of blocking and reporting features
I appeared for an interview in Oct 2024, where I was asked the following questions.
The number of dials in a day varies based on goals, industry, and strategies employed in business development.
Typically, a Senior Business Development Executive might aim for 50-100 dials per day.
Quality over quantity: Focusing on meaningful conversations can lead to better outcomes.
Using CRM tools can help track dials and follow-ups efficiently.
Example: A successful day might include 70 dials resulting in 10 qualified...
A compare function to compare two objects
Create a function that takes in two objects as parameters
Loop through the keys of one object and compare them with the keys of the other object
Return true if the objects have the same keys and values, otherwise return false
Find the longest substring without repeating characters
Use a sliding window approach to keep track of the current substring
Use a hash set to store the characters in the current substring
Update the start index of the window when a repeating character is encountered
I applied via Campus Placement and was interviewed in Jan 2024. There were 2 interview rounds.
1 hour coding question array maths hackearth
The right view of a binary tree shows the nodes visible when the tree is viewed from the right side.
The right view includes the last node at each level of the tree.
To find the right view, perform a level order traversal (BFS) and capture the last node at each level.
Example: For the tree [1, 2, 3, null, 5, null, 4], the right view is [1, 3, 4].
Alternatively, a depth-first traversal (DFS) can be used, prioritizing right ...
To form a binary tree, create nodes with left and right child pointers.
Start by creating a root node.
For each node, create left and right child nodes.
Repeat the process until all nodes are created.
Design a map
Consider the purpose of the map (e.g., navigation, data visualization)
Decide on the level of detail and scale of the map
Choose appropriate symbols and colors for different features
Include a legend or key to explain the map symbols
Ensure the map is easy to read and understand
The right view of a binary tree shows the nodes visible when looking from the right side.
The right view includes the last node at each level of the tree.
To find the right view, perform a level order traversal (BFS) and capture the last node at each level.
Example: For the tree [1, 2, 3, null, 5, null, 4], the right view is [1, 3, 4].
Alternatively, a depth-first traversal (DFS) can be used, keeping track of the maximum d...
I applied via Company Website and was interviewed in Jan 2024. There were 3 interview rounds.
Email and call mocks
I applied via Monster and was interviewed in Apr 2024. There was 1 interview round.
Node.js is a runtime environment that allows you to run JavaScript on the server side, making it useful for building scalable network applications.
Node.js is built on Chrome's V8 JavaScript engine and uses an event-driven, non-blocking I/O model, making it lightweight and efficient.
It is commonly used for building web servers, APIs, real-time applications, and microservices.
Node.js has a large ecosystem of libraries an...
I appeared for an interview before Apr 2024, where I was asked the following questions.
AI will revolutionize HR by streamlining processes, enhancing recruitment, and improving employee engagement.
Automated resume screening: AI can quickly analyze resumes to identify the best candidates, saving time for HR teams.
Predictive analytics: AI can forecast employee turnover and help HR develop retention strategies.
Chatbots for recruitment: AI-powered chatbots can engage with candidates, answer queries, and sched...
As a recruiter, I leverage AI to streamline candidate sourcing, enhance matching, and optimize hiring processes.
Utilize AI algorithms to analyze resumes and match skills with job requirements, ensuring a better fit.
Implement predictive analytics to identify candidates who are likely to succeed in specific roles based on historical data.
Use chatbots for initial candidate screening, allowing for quicker responses and eng...
I appeared for an interview before Apr 2024, where I was asked the following questions.
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 20 interview experiences
Difficulty level
Duration
based on 136 reviews
Rating in categories
Chat Bot Developer
39
salaries
| ₹7.2 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
| ₹18.9 L/yr - ₹55 L/yr |
Software Developer
13
salaries
| ₹13.2 L/yr - ₹26.7 L/yr |
Vyapar
Tata nexarc
Classplus
Fleetx.io