i
NxtWave
Filter interviews by
Be the first one to contribute and help others!
I applied via Job Fair and was interviewed before Nov 2023. There were 3 interview rounds.
3 coding question around prime number arrays and strings
posted on 24 Dec 2021
I applied via Naukri.com and was interviewed in Nov 2021. There were 3 interview rounds.
Question on Linked list. array and string manipulation.
I applied via Naukri.com and was interviewed before Aug 2023. There was 1 interview round.
Android lifecycle refers to the series of states that an activity or fragment goes through from creation to destruction.
Android lifecycle includes states like onCreate, onStart, onResume, onPause, onStop, onDestroy, etc.
Activities and fragments transition between these states based on user interactions and system events.
Understanding Android lifecycle is crucial for managing resources, saving state, and handling config...
Fragment lifecycle refers to the series of events that occur in the lifespan of a fragment in an Android app.
Fragments go through various states like created, started, resumed, paused, stopped, and destroyed.
Fragment lifecycle methods include onCreate(), onCreateView(), onResume(), onPause(), onStop(), onDestroy(), etc.
Fragment lifecycle is closely tied to the hosting activity's lifecycle.
Understanding fragment lifecyc...
posted on 21 Nov 2024
I applied via Company Website and was interviewed in Oct 2024. There were 3 interview rounds.
posted on 29 Dec 2024
I applied via Campus Placement and was interviewed in Nov 2024. There were 3 interview rounds.
Given two questions on personal round
Simple coding questions.
I appeared for an interview in Aug 2022.
2 hrs duration with 2 easy level dsa questions and 15 around mcqs based on core cs concepts.
Implementing stack using linked list
Create a Node class with data and next pointer
Create a Stack class with top pointer
Implement push() method to add element to top of stack
Implement pop() method to remove element from top of stack
Implement peek() method to return top element without removing it
Find the first duplicate value in an array of strings.
Create a hash table to store the frequency of each string.
Iterate through the array and check if the string already exists in the hash table.
If it does, return the string. If not, add it to the hash table.
If no duplicates are found, return null or an appropriate message.
Business Development Associate
263
salaries
| ₹1.8 L/yr - ₹7 L/yr |
Business Development Manager
158
salaries
| ₹6 L/yr - ₹15.5 L/yr |
Business Development Executive
39
salaries
| ₹1.5 L/yr - ₹5.5 L/yr |
BDA
38
salaries
| ₹2 L/yr - ₹5 L/yr |
Data Analyst
36
salaries
| ₹1.8 L/yr - ₹10.1 L/yr |
BYJU'S
Whitehat jr
Unacademy
Extramarks Education