i
inFeedo
Filter interviews by
I applied via Approached by Company and was interviewed in Aug 2023. There were 2 interview rounds.
Implement a medium difficulty program using Data Structures and Algorithms.
Use efficient data structures like arrays, linked lists, trees, etc.
Optimize the algorithm for time and space complexity.
Test the program with different input sizes and edge cases.
API design at an advanced level involves creating efficient, scalable, and user-friendly interfaces for interacting with software applications.
Focus on creating clear and consistent endpoints for different functionalities
Implement proper authentication and authorization mechanisms to ensure data security
Design for scalability by considering potential future growth and usage patterns
Use versioning to manage changes and ...
I applied via LinkedIn and was interviewed in Aug 2024. There was 1 interview round.
1 hr test on HackerEarth platform, DSA questions
I applied via Naukri.com and was interviewed in Dec 2021. There were 4 interview rounds.
2 easy level coding questions to be solved
4 coding ques + 15 technical aptitude
4 Coding Ques + 10 technical aptitude
I applied via Campus Placement and was interviewed in Jun 2022. There were 5 interview rounds.
50 mcq were asked in 12 mins. Most of the candidates qualified this round.
3 coding questions of basic DSA were asked. Also few mcqs from Operating System, Networking and DBMS.
1 coding question, and basic MCQ
I applied via Referral and was interviewed in Aug 2021. There was 1 interview round.
Find k min elements in given array.
Sort the array and return the first k elements.
Use a min heap of size k to find the k min elements.
Use quickselect algorithm to find the kth smallest element and return first k elements smaller than it.
Check if a given tree is a Binary Search Tree (BST) or not.
Traverse the tree in-order and check if the elements are in ascending order.
Check if the maximum value in the left subtree is less than the root and the minimum value in the right subtree is greater than the root.
Use recursion to check if all subtrees are BSTs.
Time complexity: O(n), Space complexity: O(h) where h is the height of the tree.
Given a BST and a sum, find a pair of nodes whose values add up to the given sum.
Traverse the BST in-order and store the nodes in a list
Use two pointers approach to find the pair with the given sum
If the sum is less than the current pair, move the right pointer to the left
If the sum is greater than the current pair, move the left pointer to the right
If the sum is equal to the current pair, return the pair
Time complexit
I applied via Campus Placement and was interviewed in Nov 2021. There were 3 interview rounds.
Reversing a string involves flipping the order of characters in a given string.
Create an empty string to store the reversed string
Iterate through the original string from the end to the beginning
Append each character to the empty string
Return the reversed string
Two easy questions two wasy questions two easy questions two easy questions
based on 1 interview
Interview experience
Senior Customer Success Manager
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Associate
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Development Representative
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Sigmoid
HackerEarth
Belong
Darwinbox