Angel One Associate Engineer Interview Questions and Answers

Auto complete Input Search box with Dropdown

Q1. Machine coding round for SQL
Add your answer

Q1. Explain Concurrency
Ans. 
Concurrency is the ability of a system to execute multiple tasks simultaneously.
• Concurrency allows multiple tasks to run concurrently, improving performance and efficiency.

• Concurrency can be achieved through multithreading or multiprocessing.

• Example: A web server handling multiple requests simultaneously using multithreading.
Answered by AI
Add your answer
Q2. Explain Acid principles
Ans. 
ACID principles are a set of properties that guarantee database transactions are processed reliably.
• Atomicity: Transactions are all or nothing. If one part of the transaction fails, the entire transaction is rolled back.

• Consistency: Transactions bring the database from one valid state to another. All constraints are satisfied.

• Isolation: Transactions are isolated from each other until they are completed.

• Durability: Once...read more
Answered by AI
Add your answer

Implement thread safe load balancer.
focus on input validations and cover all corner cases in tests

Search in Rotated sorted array

Easy Medium questions

Q1. Asked to design Basic Facebook.
Add your answer

Q1. Low Level Design: How to do rate limiting for a platform serving 100K requests per second.
Ans. 
Implement rate limiting for a platform serving 100K requests per second.
• Use a token bucket algorithm to limit the rate of incoming requests.

• Set a maximum number of tokens in the bucket to control the rate.

• Refill the bucket at a constant rate to allow bursts of requests.

• Track the timestamp of the last request to enforce the rate limit.

• Consider using a distributed rate limiting system for scalability.

• Monitor and adjust t...read more
Answered by AI
Add your answer

Q1. Deep dive into java concepts. Max diameter of a tree in java.
Ans. 
Max diameter of a tree in Java is the longest path between any two nodes in a tree.
• The diameter of a tree can be calculated by finding the longest path between any two nodes in the tree.

• This can be done by finding the longest path from the root to a leaf node, and then finding the longest path from another leaf node to the root.

• The sum of these two paths gives the diameter of the tree.
Answered by AI
Add your answer

Q1. Lld of loan and borrower design. Design dbs schema. About connection pool, db isolation.
Add your answer

Q1. Hiring manager round, more about previous experience and some hypothetical questions.
Add your answer