i
LambdaTest
Filter interviews by
I applied via Job Portal
It was not good their approach of asking questions not good
Top trending discussions
posted on 23 Dec 2021
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 campus placement at Indian Institute of Information Technology (IIIT), Kota and was interviewed in Dec 2024. There were 2 interview rounds.
A 90-minute coding test on HackerRank, which includes one medium, one easy, and one hard question.
posted on 19 Dec 2024
I applied via Campus Placement
It was good 20 mcqs 3 coding questions
2 Leetcode Medium questions on hackerrank
Medium to hard questions based on arrays, dp
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]
Rotate a matrix by 90 degrees in place
Transpose the matrix
Reverse each row of the transposed matrix
I applied via Campus Placement
Aptitude was including both MCQs and Input
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...
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.
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
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
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
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.
2 DSA questions Both are from DP
I applied via Approached by Company and was interviewed in Jan 2024. There were 2 interview rounds.
Implement a function to mimic the functionality of merging two DataFrames in Python.
Create a function that takes two DataFrames as input.
Merge the two DataFrames based on a common column or index.
Handle different types of joins like inner, outer, left, and right joins.
Return the merged DataFrame as output.
1 hour - Find longest palindromic substring
based on 1 interview
Interview experience
2-4 Yrs
Not Disclosed
Member Technical Staff
18
salaries
| ₹8 L/yr - ₹29.2 L/yr |
Solution Engineer
14
salaries
| ₹6.5 L/yr - ₹18.2 L/yr |
Software Engineer
12
salaries
| ₹11.5 L/yr - ₹35 L/yr |
Senior Software Engineer
11
salaries
| ₹10.9 L/yr - ₹26.3 L/yr |
Senior Member of Technical Staff
11
salaries
| ₹12.1 L/yr - ₹38.5 L/yr |
BrowserStack
QASource
SmartBear
Sauce Labs