Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Leena AI Team. If you also belong to the team, you can get access from here

Leena AI Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Leena AI Software Development Engineer Interview Questions, Process, and Tips

Updated 23 Dec 2021

Leena AI Software Development Engineer Interview Experiences

1 interview found

I applied via Campus Placement and was interviewed in Nov 2021. There were 4 interview rounds.

Interview Questionnaire 

5 Questions

  • Q1. 1) Time complexity of binary search for array and linked list
  • Ans. 

    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...

  • Answered by AI
  • Q2. 2) Construct tree from inorder and post order list
  • Ans. 

    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.

  • Answered by AI
  • Q3. 3) Find depth of binary tree through recursion and iteration
  • Ans. 

    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

  • Answered by AI
  • Q4. 4) Find intersection of two arrays
  • Ans. 

    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.

  • Answered by AI
  • Q5. 5) Find out the heavier ball from 8 identical ball of which one is heavier using only a balance weighting machine in least number of trys
  • Ans. 

    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

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Revise basic data structures and algorithms. Be aware of the logic behind calculating time complexities. Be prepared to implement the given coding questions on an ide

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
1
Bad
Difficulty level
-
Process Duration
-
Result
-

I applied via Job Portal

Round 1 - Coding Test 

It was not good their approach of asking questions not good

Round 2 - Technical 

(2 Questions)

  • Q1. Dsa graph topological sorting
  • Q2. DSA tree question and largest bst
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via campus placement at Indian Institute of Information Technology (IIIT), Kota and was interviewed in Dec 2024. There were 2 interview rounds.

Round 1 - Coding Test 

A 90-minute coding test on HackerRank, which includes one medium, one easy, and one hard question.

Round 2 - Technical 

(2 Questions)

  • Q1. What is the index of the first occurrence where a pattern string matches with a text string?
  • Q2. Given a string, how can we find the minimum length substring whose sum is greater than or equal to a specified target?
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Aptitude Test 

It was good 20 mcqs 3 coding questions

Round 2 - Technical 

(2 Questions)

  • Q1. Dsa and core subjects like cn os
  • Q2. Dsa questions and core subjects
Round 3 - HR 

(1 Question)

  • Q1. Basic family discussion and salary details

Interview Preparation Tips

Interview preparation tips for other job seekers - it was overall a good experience
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

2 Leetcode Medium questions on hackerrank

Round 2 - One-on-one 

(3 Questions)

  • Q1. Kadane algorithm based question
  • Q2. Leetcode medium
  • Q3. Resume based questions
Round 3 - One-on-one 

(4 Questions)

  • Q1. Probability question math problem
  • Q2. Puzzle to solve
  • Q3. AI based question
  • Q4. 1 question to solve Leetcode medium

Interview Preparation Tips

Interview preparation tips for other job seekers - Be strong with DSA and communication skill
Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Medium to hard questions based on arrays, dp

Round 2 - Technical 

(2 Questions)

  • Q1. Quick sort algorithm
  • Ans. 

    Quick sort is a popular sorting algorithm that uses divide and conquer strategy.

    • Divides array into smaller sub-arrays based on a pivot element

    • Recursively sorts sub-arrays

    • Combines sorted sub-arrays to get final sorted array

    • Time complexity: O(n log n) on average, O(n^2) worst case

    • Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]

  • Answered by AI
  • Q2. Modified rotate a matrix
  • Ans. 

    Rotate a matrix by 90 degrees in place

    • Transpose the matrix

    • Reverse each row of the transposed matrix

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - study well and at the end, they would not hire anyone

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement

Round 1 - Aptitude Test 

Aptitude was including both MCQs and Input

Round 2 - Technical 

(4 Questions)

  • Q1. Technical interview 1 It revolved around core subjects Like OS, Oops, CNS, dbms etc,. And few basic questions on arrays
  • Q2. Difference between python and C
  • Ans. 

    Python is a high-level, interpreted language known for its simplicity and readability, while C is a low-level, compiled language known for its speed and efficiency.

    • Python is dynamically typed, while C is statically typed.

    • Python has automatic memory management, while C requires manual memory management.

    • Python is platform-independent, while C is platform-dependent.

    • Python is commonly used for web development and data anal...

  • Answered by AI
  • Q3. Why C is faster than python
  • Ans. 

    C is faster than Python due to its lower-level nature and direct hardware access.

    • C is a compiled language, while Python is an interpreted language.

    • C code is directly translated into machine code, while Python code is executed line by line.

    • C has direct access to hardware, while Python relies on external libraries for such access.

  • Answered by AI
  • Q4. Write a program to count vowels in your name
  • Ans. 

    A program to count vowels in a given name

    • Create a function that takes a string as input

    • Loop through each character in the string and check if it is a vowel (a, e, i, o, u)

    • Increment a counter for each vowel found

    • Return the total count of vowels

  • Answered by AI
Round 3 - Technical 

(5 Questions)

  • Q1. Technical interview 2 Focuses on DSA
  • Q2. Write quick sort
  • Ans. 

    Quick sort is a divide-and-conquer algorithm that sorts an array by partitioning it into smaller sub-arrays.

    • Choose a pivot element from the array

    • Partition the array into two sub-arrays based on the pivot element

    • Recursively apply quick sort to the sub-arrays

    • Combine the sorted sub-arrays to get the final sorted array

  • Answered by AI
  • Q3. Implement Linked list
  • Ans. 

    Implement a linked list data structure in a programming language.

    • Create a Node class with data and a reference to the next node

    • Implement methods to add, remove, and search for elements in the linked list

    • Handle edge cases like adding to an empty list or removing the last element

  • Answered by AI
  • Q4. All operations on Linked list
  • Ans. 

    Operations on Linked list include insertion, deletion, traversal, and searching.

    • Insertion: Add a new node at the beginning, end, or middle of the linked list.

    • Deletion: Remove a node from the linked list based on a given key or position.

    • Traversal: Visit each node in the linked list to perform operations or display data.

    • Searching: Find a specific node in the linked list based on a given key or value.

  • Answered by AI
  • Q5. Basic machine learning algorithms
Round 4 - HR 

(2 Questions)

  • Q1. Basic fitment questions
  • Q2. Introduction and flexibility

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and brush up all CS core subjects

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Company Website and was interviewed in May 2024. There were 2 interview rounds.

Round 1 - Coding Test 

Some Objective questions and 1 Coding Questions

Round 2 - One-on-one 

(2 Questions)

  • Q1. Situation based questions on Coroutines
  • Q2. About Project Tech Stack Used and Questions on that
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

2 DSA questions Both are from DP

Round 2 - Technical 

(2 Questions)

  • Q1. 2 Questions , 1 is DSA
  • Q2. Second question is Puzzle

Interview Preparation Tips

Interview preparation tips for other job seekers - Practise DSA more and give more and more interviews.
Interview experience
1
Bad
Difficulty level
Hard
Process Duration
-
Result
-
Round 1 - One-on-one 

(1 Question)

  • Q1. Pointless basic questions is what they asked
Round 2 - Technical 

(1 Question)

  • Q1. They had this round for hours together

Interview Preparation Tips

Interview preparation tips for other job seekers - Kindly do not attend interview at Pando. They make the interview process long and tedious. They had less budget despite knowing that they wasted my time and efforts on the whole the company is not well structured and their HR team is very poor. They are a typical unstructured startup company with poor work ethics and culture.

Leena AI Interview FAQs

What are the top questions asked in Leena AI Software Development Engineer interview?

Some of the top questions asked at the Leena AI Software Development Engineer interview -

  1. 5) Find out the heavier ball from 8 identical ball of which one is heavier usin...read more
  2. 1) Time complexity of binary search for array and linked l...read more
  3. 3) Find depth of binary tree through recursion and iterat...read more

Tell us how to improve this page.

Interview Questions from Similar Companies

Vyapar Interview Questions
3.5
 • 50 Interviews
BrowserStack Interview Questions
3.7
 • 48 Interviews
Gupshup Interview Questions
3.6
 • 31 Interviews
Classplus Interview Questions
3.4
 • 27 Interviews
Fleetx.io Interview Questions
3.8
 • 26 Interviews
Springworks Interview Questions
4.6
 • 23 Interviews
Twilio Interview Questions
3.9
 • 23 Interviews
View all
Chat Bot Developer
35 salaries
unlock blur

₹7 L/yr - ₹19.3 L/yr

Customer Success Manager
21 salaries
unlock blur

₹7 L/yr - ₹26 L/yr

Senior Software Engineer
16 salaries
unlock blur

₹18.9 L/yr - ₹55 L/yr

Software Engineer
15 salaries
unlock blur

₹16.3 L/yr - ₹31 L/yr

Sales Development Representative
11 salaries
unlock blur

₹8 L/yr - ₹17 L/yr

Explore more salaries
Compare Leena AI with

Jio Haptik

3.4
Compare

yellow.ai

3.2
Compare

Engati

2.5
Compare

Uniphore Software Systems

3.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview