Filter interviews by
I applied via LinkedIn and was interviewed in Sep 2024. There was 1 interview round.
Troubleshooting Kubernetes issues involves identifying the root cause, checking logs, examining configurations, and using monitoring tools.
Identify the specific issue by checking logs and error messages.
Examine the Kubernetes configurations to ensure they are set up correctly.
Use monitoring tools like Prometheus or Grafana to track performance metrics.
Check the status of pods, nodes, and deployments to pinpoint any iss...
I applied via Mimecast Careers and was interviewed in Sep 2024. There were 3 interview rounds.
The first round was a simple codility assessment on spring boot.
I led the high-level design of new features at my previous company, focusing on scalability and user experience.
Identified user needs and pain points to inform feature design
Collaborated with cross-functional teams to gather requirements and feedback
Created wireframes and prototypes to visualize the user flow
Implemented scalable architecture to support future growth
Conducted user testing and iteration to refine feature
On Codility - 2 coding questios
CORS issues occur when a web application tries to make a request to a different domain than the one it originated from.
Enable CORS on the server by adding appropriate headers like Access-Control-Allow-Origin
Use a proxy server to make requests on behalf of the client
Ensure that the client-side code is making requests correctly with the appropriate headers
Consider using JSONP as an alternative to CORS in some cases
Mimecast interview questions for popular designations
I applied via Approached by Company and was interviewed in Jul 2023. There was 1 interview round.
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 was interviewed before May 2016.
I applied via Referral and was interviewed before Apr 2021. There was 1 interview round.
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
based on 6 interviews
Interview experience
Senior Software Engineer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Production Support Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Devops Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Proofpoint
Barracuda Networks
Gen
Trend Micro