Syfe Senior Software Engineer Interview Questions and Answers

Data structures and algo. 2 ques were asked in hackerrank

Q1. Questions related to System design
Add your answer

Q1. Basic question related to Spring and Java
Add your answer

Q1. System design basics
Add your answer
Q2. Java 8 stream api code
Add your answer
Q3. Current project
Add your answer

Q1. Only arrogance related stuff
Add your answer
Q2. Only arrogance related stuff happened
Add your answer

It was about DS Algo and Java garbage collection,multithreading

Q1. Low level design of rate limiter
Ans. 
Rate limiter is a system that controls the rate of traffic sent or received by a network interface.
• Implement a token bucket algorithm to track and limit the rate of requests

• Use a sliding window algorithm to track the number of requests within a specific time frame

• Consider using a distributed rate limiter for scalability and fault tolerance
Answered by AI
Add your answer
Q2. Springboot basics, java basics, future interfaces, basic sql queries
Add your answer

Q1. Longest Consecutive Sequence
Ans. 
Find the length of the longest consecutive elements sequence in an array.
• Sort the array to ensure consecutive elements are adjacent

• Iterate through the array and keep track of the current consecutive sequence length

• Update the longest consecutive sequence length as you iterate
Answered by AI
Add your answer
Q2. Core Java Questions
Add your answer

Q1. Executor Service and it's code
Ans. 
Executor Service is a framework provided by Java for managing and executing asynchronous tasks.
• Executor Service allows you to easily create and manage threads for executing tasks.

• It provides a way to control the number of threads used for executing tasks, which can help prevent resource exhaustion.

• You can submit tasks to an Executor Service using methods like execute() or submit().

• Executor Service can be used to execut...read more
Answered by AI
Add your answer
Q2. Core Java and Spring boot questions
Add your answer

Q1. Design patterns
Add your answer
Q2. Core Java questions
Add your answer

Q1. Aks about the few questions of dsa
Add your answer
Q2. Ask about the design system
Add your answer

Q1. Ask about the design system
Add your answer

Q1. Machine coding: Design in-memory document search
Add your answer

Q1. HLD: Design a ad-click aggregation service
Ans. 
Design an ad-click aggregation service for tracking and analyzing ad clicks.
• Use a distributed system to handle high volume of ad click data

• Implement real-time processing for immediate insights on ad performance

• Utilize a database to store aggregated ad click data for reporting and analysis
Answered by AI
Add your answer

Search in Rotated sorted array

Machine coding round.

Q1. Algorithm to calculate top k flight from source to destinaton.
Ans. 
Use Dijkstra's algorithm to find the top k shortest paths from source to destination.
• Implement Dijkstra's algorithm to find the shortest paths from source to all other nodes.

• Store the top k shortest paths found in a priority queue or heap.

• Return the top k shortest paths as the result.
Answered by AI
Add your answer