Filter interviews by
I was interviewed before Oct 2020.
Sort an array of 0s and 1s in O(n) time complexity.
Use two pointers, one at the beginning and one at the end of the array.
Swap 0s from the beginning with 1s from the end until the pointers meet.
Alternatively, count the number of 0s and 1s and overwrite the array with the correct number of each.
Top trending discussions
I applied via Approached by Company and was interviewed in Aug 2021. There were 3 interview rounds.
Assignment to develop a prototype
I applied via Campus Placement and was interviewed before May 2021. There were 2 interview rounds.
Will be given Requirement to write code for Restraunt. Based on that have write code for delivering orders by delivery boys.
I applied via Recruitment Consulltant and was interviewed before Aug 2023. There were 2 interview rounds.
The current project follows a microservices architecture with Docker containers for scalability and flexibility.
Microservices architecture is used to break down the application into smaller, independent services that can be developed, deployed, and scaled independently.
Docker containers are utilized for packaging the application and its dependencies into a standardized unit for easy deployment and management.
Service di...
Basic coding questions
posted on 24 Dec 2022
I applied via Naukri.com and was interviewed before Dec 2021. There were 4 interview rounds.
Matrix rotation and counting 0 and 1's.
posted on 24 Oct 2024
Count the number of islands in a given grid of '1's and '0's.
Iterate through the grid and for each '1' encountered, perform a depth-first search to mark all connected '1's as visited.
Increment the island count for each new island encountered.
Consider edge cases like grid boundaries and handling visited cells.
posted on 14 Apr 2024
posted on 26 Aug 2024
posted on 7 Jun 2024
I applied via LinkedIn and was interviewed in May 2024. There was 1 interview round.
Use dynamic programming to find the shortest path sum with negative integers allowed in a matrix.
Implement dynamic programming to store the minimum sum at each cell
Consider negative integers when calculating the sum of the path
Start from the top left cell and iterate through the matrix to find the shortest path sum
posted on 7 Feb 2024
I was interviewed in Aug 2023.
Optimizing build in Angular involves reducing bundle size, enabling lazy loading, using AOT compilation, and leveraging tree shaking.
Reduce bundle size by removing unused code and optimizing imports
Enable lazy loading to load modules on demand instead of all at once
Use Ahead-of-Time (AOT) compilation to pre-compile templates and reduce runtime overhead
Leverage tree shaking to eliminate dead code and reduce bundle size
based on 1 review
Rating in categories
Solution Engineer
109
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Solution Engineer
58
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Support Engineer
56
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer II
37
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
36
salaries
| ₹0 L/yr - ₹0 L/yr |
LogiNext Solutions
Shiprocket Private Limited
Shadowfax Technologies
Delhivery