Filter interviews by
I applied via Walk-in and was interviewed in May 2021. There was 1 interview round.
Top trending discussions
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...
posted on 7 May 2017
I was interviewed in Feb 2017.
I applied via Referral and was interviewed before May 2023. There were 2 interview rounds.
To resolve space issue with GET API request, consider pagination, compression, caching, and optimizing query parameters.
Implement pagination to limit the number of results returned in each request.
Use compression techniques like Gzip to reduce the size of the response data.
Implement caching mechanisms to store frequently accessed data and reduce the number of requests.
Optimize query parameters to only request necessary
I applied via LinkedIn and was interviewed in Sep 2020. There was 1 interview round.
Easy problem on java
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 10 reviews
Rating in categories
GIS Engineer
817
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior GIS Engineer
192
salaries
| ₹0 L/yr - ₹0 L/yr |
CAD Engg
95
salaries
| ₹0 L/yr - ₹0 L/yr |
Apprentice GIS Engineer
50
salaries
| ₹0 L/yr - ₹0 L/yr |
BIM Modeller
48
salaries
| ₹0 L/yr - ₹0 L/yr |
Cyberoam Technologies
QUICK HEAL TECHNOLOGIES
Seqrite
Paladion Networks