Filter interviews by
I applied via Naukri.com and was interviewed in Jun 2020. There were 3 interview rounds.
Top trending discussions
I don't want to reveal them
To search a file inside folder levels via command line, use the 'find' command.
Open the command prompt or terminal
Navigate to the folder where you want to start the search
Use the 'find' command followed by the name of the file you want to search for
Optionally, you can specify the depth of the search using the '-maxdepth' flag
Example: 'find . -name myfile.txt -maxdepth 2'
I applied via Naukri.com and was interviewed before May 2023. There was 1 interview round.
Discovered a bug in the software during testing and resolved it by identifying the root cause and implementing a fix.
During testing, found a bug where the application crashed when a specific input was entered.
Investigated the issue by analyzing the code and logs to identify the root cause.
Implemented a fix by updating the code to handle the input correctly and retested to ensure the bug was resolved.
Check volume settings, restart phone, check for software updates, test with headphones
Check if volume is turned up on the phone
Restart the phone to see if that resolves the issue
Check for any software updates that may fix the problem
Test the speakers with headphones to determine if the issue is with the speakers or the phone
I applied via Company Website and was interviewed in Mar 2024. There were 3 interview rounds.
A total of 2 question where asked -
The 1st question was a easy one involving Arrays and 2-Pointers
The 2nd question was medium-hard problem involving Matrix, Recursion and Back-Tracking.
I handle errors by identifying the root cause, troubleshooting, and implementing a solution to prevent future occurrences.
Identify the root cause of the error
Troubleshoot the issue thoroughly
Implement a solution to prevent future occurrences
Document the error and solution for reference
I applied via Approached by Company and was interviewed in Nov 2023. There were 2 interview rounds.
1hr test 2 DSA problems
Dynamic programming and heap problems are common in technical interviews for Applications Engineer roles.
Dynamic programming (DP) involves breaking down a problem into smaller subproblems and solving each subproblem only once. Example: finding the longest increasing subsequence in an array.
Heaps are data structures that satisfy the heap property. Example: finding the kth largest element in an array using a heap.
I applied via Company Website and was interviewed in Mar 2024. There were 3 interview rounds.
Coding test was easy mainly based on array and string both the questions were doable. If you have practiced in past you d good to go.
Move all 0s to the end of an array of strings
Iterate through the array and move all 0s to the end
Use two pointers to keep track of the current position and the position to swap with
Example: Input: ['apple', '0', 'banana', '0', 'cherry'], Output: ['apple', 'banana', 'cherry', '0', '0']
I applied via Referral and was interviewed in Feb 2024. There were 3 interview rounds.
It consists of Code based on DSA-concepts
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Senior Executive
251
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
215
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Executive
185
salaries
| ₹0 L/yr - ₹0 L/yr |
Beauty Advisor
180
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Manager
119
salaries
| ₹0 L/yr - ₹0 L/yr |
Myntra
Purplle.com
LimeRoad
Voonik