Filter interviews by
I applied via Approached by Company and was interviewed before Apr 2023. There were 2 interview rounds.
I have experience in handling various issues that arise during the development process.
I have successfully resolved bugs and errors in code.
I have dealt with compatibility issues across different devices and Android versions.
I have experience troubleshooting performance issues and optimizing code for efficiency.
I applied via Naukri.com and was interviewed in Oct 2022. There were 3 interview rounds.
They give you an small assignment of api integration in android app which is easy
I applied via Naukri.com
Top trending discussions
I applied via LinkedIn and was interviewed in Nov 2024. There was 1 interview round.
Coroutines are a way to perform asynchronous operations in Android, securing app data involves encryption, SSL pinning enhances security, FCM for notifications.
Coroutines are used for managing asynchronous operations in Android, allowing for efficient and non-blocking code execution.
Securing app data involves using encryption techniques such as AES to protect sensitive information from unauthorized access.
SSL pinning i...
To check if a number is palindrome, reverse the number and compare it with the original number.
Convert the number to a string to easily reverse it
Reverse the string and compare it with the original string
If they are the same, the number is a palindrome
To find the smallest number in a list, iterate through the list and keep track of the smallest number found so far.
Iterate through the list and compare each number with the current smallest number.
If a number is smaller than the current smallest number, update the smallest number.
Return the smallest number found after iterating through the entire list.
I applied via Instagram and was interviewed in Mar 2024. There were 3 interview rounds.
Profit and loss syllogism
2 questions string questions and array questions easy
I applied via Naukri.com and was interviewed in Nov 2023. There was 1 interview round.
Use counting sort algorithm to achieve O(n) time complexity.
Count the frequency of each string in the array.
Create a new array based on the frequency counts.
Iterate through the new array to reconstruct the sorted array.
Coding test based on array
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Android Developer
18
salaries
| ₹2.2 L/yr - ₹4.5 L/yr |
PHP Developer
12
salaries
| ₹2.5 L/yr - ₹4.3 L/yr |
IOS Developer
9
salaries
| ₹2.4 L/yr - ₹4.8 L/yr |
UI Developer
8
salaries
| ₹2.4 L/yr - ₹3.2 L/yr |
IOS Application Developer
7
salaries
| ₹2.2 L/yr - ₹3.8 L/yr |
TCS
Accenture
Wipro
Cognizant