System Design:
• How would you design a distributed caching system that scales globally for millions of users?
• Explain how you would design a URL shortening service like Bitly, focusing on scalability and fault tolerance.
• Design a payment gateway system with high availability and low latency.
2. Algorithms & Data Structures:
• Given a stream of real-time stock prices, how would you calculate the median efficiently at any point?
• Explain how you would implement a least recently used (LRU) cache from scratch.
• Write a function to find the shortest path in a weighted graph with negative edges.
3. Coding:
• Given a matrix where each cell represents the cost to enter, find the minimum cost path from the top-left to the bottom-right corner.
• Implement a thread-safe singleton pattern in Java.
• Write code to detect if a linked list has a cycle, and if so, find the start of the cycle.
4. Database:
• Explain the differences between ACID and BASE principles. When would you prioritize one over the other?
• How would you optimize a query that involves millions of rows and joins across multiple tables?
• Design a schema for an e-commerce website where product search is extremely fast.
5. Cloud & DevOps:
• Explain the CAP theorem and its implications in designing a distributed database.
• How would you deploy and scale a microservices-based application on Kubernetes or OpenShift?
• What is the difference between serverless architecture and container-based architecture? When would you use each?
Me postulé en línea. El proceso tomó 4 semanas. Acudí a una entrevista en Altimetrik (Bengaluru) en sept 2025
Entrevista
It consists of 2 round as I am an Immediate Joiner. I think for candidate with high notice period they take 4 round. For me 1st round is mostly focused on DSA and 2nd round is client round.

Preguntas de entrevista [1]
Pregunta 1
In first round interviewer asked below question.
1. Given a mathematical expression as a string, evaluate it using the reverse BODMAS rule. Reverse BODMAS rule — that is, apply operations in the following order:
Subtraction → Addition → Division → Multiplication
Input : “3 + 2 * 4 - 1”
output : 15
Input : “12 + 5 * 3 - 7”
output : -68
2. Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path.
Ex: Input: grid = [[1,3,1],[1,5,1],[4,2,1]]
Output: 7
Me postulé a través de otra fuente. Acudí a una entrevista en Altimetrik (Bengaluru) en jul 2025
Entrevista
I have just attend 1st round , They will do all general verification and Ask about your project and experience , They didn't even asked any basic question they redirectly asked only react coding
Me postulé a través de un reclutador. El proceso tomó 1 semana. Acudí a una entrevista en Altimetrik (Bengaluru) en may 2025
Entrevista
HR called and schedules Interview from call via third party.
Too many rounds and Interviewers only concentrate on theory instead of practical knowledge.
Only gave 1 round.
total 5 rounds
Preguntas de entrevista [1]
Pregunta 1
They concentrate only on theory, they will tell you about DSA but will ask only theory things
What is thread, is array thread safe, RedBlack tree, etc.
I dont suggest you to appear and waste time if you are solving Leetcode. they never ask to write code. Just go learning theory like school kids.
