Filter interviews by
2 coding question one easy one medium
Find the maximum sum of non-adjacent elements in an array.
Create an array to store the maximum sum at each index
Iterate through the input array and calculate the maximum sum considering the current element and the previous non-adjacent element
Return the maximum sum found
Utilize efficient algorithms, minimize redundant code, optimize database queries
Use data structures like hash maps or binary trees for faster lookups
Minimize nested loops and unnecessary iterations
Optimize database queries by using indexes and avoiding unnecessary joins
We had some aptitude and coding questions
Topics like time work, permutations etc
Top trending discussions
I applied via Campus Placement and was interviewed before Mar 2023. There were 4 interview rounds.
7 easy coding questions
posted on 13 Jun 2024
I applied via Company Website and was interviewed in May 2024. There was 1 interview round.
The task was a Codility type
Easy problem on java
I applied via LinkedIn and was interviewed in Sep 2020. There was 1 interview round.
I applied via Recruitment Consulltant
A mutex is a synchronization primitive that ensures only one thread can access a resource at a time.
Create a mutex object using the appropriate library or language-specific function.
Lock the mutex before accessing the shared resource to prevent other threads from accessing it.
Unlock the mutex after finishing the operation on the shared resource to allow other threads to access it.
Example: pthread_mutex_t mutex; pthread...
Identify memory leak in code
Check for any dynamically allocated memory that is not being freed
Look for any infinite loops or recursive functions that consume memory
Use memory profiling tools like Valgrind to detect leaks
Check for any global variables that are not properly managed
I was interviewed before Mar 2021.
To check if a number is a power of 2, we can use bitwise operations.
A power of 2 has only one bit set to 1, so we can use the bitwise AND operator to check if the number is a power of 2.
If n is a power of 2, then n & (n-1) will be 0.
For example, 8 (1000 in binary) is a power of 2, and 8 & 7 (0111 in binary) is 0.
Sort a stack without using another data structure
Use recursion to pop the top element and insert it at the bottom of the remaining stack
Repeat until the stack is sorted in ascending order
Time complexity: O(n^2), space complexity: O(n) due to recursion
Check if array has continuous increasing and decreasing values
Loop through the array and check if each element is greater than the previous one
Once you find the maximum element, check if the remaining elements are in decreasing order
If yes, return true else false
Design a cricinfo (LLD)
Identify the entities: players, teams, matches, scorecards, tournaments, etc.
Define the relationships between entities
Create a database schema to store the data
Implement APIs to fetch and update data
Design a UI to display the information
Consider scalability and performance
Ensure data security and privacy
I applied via Company Website and was interviewed in May 2022. There were 2 interview rounds.
Logical reasoning And aptitude test
C++, python and Java programming
based on 2 interviews
Interview experience
Software Engineer
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Solution Architect
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Principal Software Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Product Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Seqrite
QUICK HEAL TECHNOLOGIES
Trend Micro
Palo Alto Networks