Faster and better experience!
Filter interviews by
I applied via Naukri.com and was interviewed in Oct 2022. There was 1 interview round.
I applied via Approached by Company and was interviewed before Mar 2023. There were 3 interview rounds.
Was asked to code a url reputation service that was tested against a lot of test cases
FireEye interview questions for popular designations
I appeared for an interview before May 2016.
Top trending discussions
I applied via LinkedIn and was interviewed in Sep 2020. There was 1 interview round.
I appeared for an interview 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 Campus Placement and was interviewed in Jan 2016. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
To find a loop in a linked list, we use Floyd's cycle-finding algorithm.
Floyd's cycle-finding algorithm uses two pointers, one moving at twice the speed of the other.
If there is a loop in the linked list, the two pointers will eventually meet.
To detect the meeting point, we reset one of the pointers to the head of the linked list and move both pointers at the same speed.
The meeting point is the start of the loop.
LRU, MRU and LFU are caching algorithms used to manage memory in computer systems.
LRU stands for Least Recently Used and removes the least recently used items from the cache when the cache is full.
MRU stands for Most Recently Used and removes the most recently used items from the cache when the cache is full.
LFU stands for Least Frequently Used and removes the least frequently used items from the cache when the cache i...
I appeared for an interview before Jun 2016.
based on 3 interviews
Interview experience
Senior Software Engineer
25
salaries
| ₹13.9 L/yr - ₹50 L/yr |
Software Development Engineer
14
salaries
| ₹14 L/yr - ₹26 L/yr |
Software Engineer
12
salaries
| ₹11.5 L/yr - ₹25 L/yr |
Software Developer
12
salaries
| ₹14.3 L/yr - ₹25.5 L/yr |
Software Development Engineer Test
10
salaries
| ₹15 L/yr - ₹28 L/yr |
McAfee
Palo Alto Networks
Gen
Trend Micro