Filter interviews by
I applied via Referral and was interviewed before Dec 2023. There was 1 interview round.
A storage class in C defines the scope and lifetime of variables.
Storage classes include auto, register, static, and extern.
Auto variables are stored in the stack and have local scope.
Register variables are stored in CPU registers for faster access.
Static variables retain their value between function calls.
Extern variables are declared in one file and can be used in another file.
Redux is a state management library for React Native applications.
Redux helps manage the state of an application in a predictable way.
It stores the entire state of the application in a single immutable object.
Actions are dispatched to update the state through reducers.
Redux is commonly used in large-scale React Native applications to handle complex state management.
Example: Redux is used to manage the state of a shoppi
Top trending discussions
I applied via Naukri.com
There were three coding questions.
I applied via Job Fair and was interviewed in Dec 2024. There were 3 interview rounds.
OA test 3 Dsa questions 2 medium 1 hard you have to solve 1.5 questions in 120 minutes
DSA 2 question
1 -> Find Lca and traverse a tree path available on GFG
2 -> LinkedList pallindrome check (you have to solve that in 0(1) space complexity)
LRU Cache is a data structure that maintains a list of items in order of most recently used to least recently used.
Implement using a doubly linked list and a hashmap for efficient operations
When an item is accessed, move it to the front of the list
When the cache is full, remove the least recently used item from the end of the list
I applied via Campus Placement
2 coding questions and a few MCQs
I applied via Job Portal and was interviewed in Aug 2024. There were 2 interview rounds.
DSA + JAVA + Spring boot
LLD (bookmyshow) + DSA
What is your name write it in binary format using Ensemble language and how to optimize super computer
Use merge sort algorithm to sort the array in O(nlogn) time complexity.
Implement merge sort algorithm which divides the array into two halves, recursively sorts the halves, and then merges the sorted halves.
Time complexity of merge sort is O(nlogn) where n is the number of elements in the array.
Example: ['apple', 'banana', 'cherry', 'date'] can be sorted using merge sort in O(nlogn) time complexity.
Use binary search to find element in sorted array efficiently.
Start with middle element and compare with target
If target is less, search left half, if greater search right half
Repeat until element is found or search space is empty
based on 2 reviews
Rating in categories
Software Engineer
24
salaries
| ₹12.7 L/yr - ₹25.6 L/yr |
Senior Software Engineer
16
salaries
| ₹12.5 L/yr - ₹40 L/yr |
Software Developer
15
salaries
| ₹6.5 L/yr - ₹25 L/yr |
Consultant
12
salaries
| ₹5.9 L/yr - ₹29 L/yr |
Analyst
10
salaries
| ₹8.5 L/yr - ₹28 L/yr |
Reliance Retail
Udaan
American Express
Lenskart