Qapita Fintech Senior Software Engineer Interview Questions and Answers

Q1. System Design for Task Scheduler
Ans. 
Design a scalable task scheduler to manage and execute tasks efficiently based on priority and timing.
• Define task attributes: ID, priority, execution time, and status.

• Use a priority queue to manage task scheduling based on priority.

• Implement worker threads to execute tasks concurrently.

• Consider persistent storage for tasks to survive system restarts.

• Provide an API for adding, updating, and removing tasks.
Answered by AI
Add your answer
Q2. Past work experience
Ans. 
I have extensive experience in software development, focusing on scalable applications and team collaboration.
• Led a team of 5 developers in creating a microservices architecture for a healthcare application, improving scalability by 40%.

• Implemented CI/CD pipelines using Jenkins and Docker, reducing deployment time from hours to minutes.

• Collaborated with cross-functional teams to gather requirements and deliver features...read more
Answered by AI
Add your answer

Easy Medium questions

Q1. Asked to design Basic Facebook.
Ans. 
Design a basic social networking platform similar to Facebook, focusing on user profiles, posts, and interactions.
• User Registration: Users can create accounts with email and password.

• User Profiles: Each user has a profile with a photo, bio, and friend list.

• Posts: Users can create text, image, or video posts visible to friends.

• News Feed: A central feed displays posts from friends and followed users.

• Friend Requests: User...read more
Answered by AI
Add your answer

Q1. Find edge score of the nodes in a directed graph
Ans. 
Edge score of nodes in a directed graph
• Edge score is a measure of the importance of a node in a graph

• It is calculated by counting the number of edges that point to or from a node

• Nodes with higher edge scores are considered more important

• Edge score can be calculated using algorithms like PageRank or HITS
Answered by AI
Add your answer

Q1. Rotten oranges after every second in 2D matrix
Ans. 
Simulate rotting of oranges in a 2D matrix every second.
• Create a queue to store the coordinates of fresh oranges

• Iterate through the matrix and add the coordinates of fresh oranges to the queue

• Simulate the rotting process by iterating through the queue and rotting adjacent fresh oranges

• Keep track of the time taken for all oranges to rot

• Return -1 if there are any fresh oranges left after the simulation
Answered by AI
Add your answer
Q2. Java and Spring concepts, HTTP, HTTPS, OSI layers
Add your answer
Q3. DB design for air ticket booking system
Ans. 
DB design for air ticket booking system
• Create tables for flights, passengers, bookings, and payments

• Use foreign keys to establish relationships between tables

• Include fields for flight details, passenger information, and payment details

• Consider implementing a caching mechanism for frequently accessed data
Answered by AI
Add your answer

DP questions 1D DP and Array question

Q1. Java questions and technical questions from previous experience
Add your answer

Q1. Behavioural questions and standard HR questions
Add your answer
Q2. Why looking for job switch
Ans. 
Seeking new challenges and opportunities for growth in a different environment.
• Looking for new challenges and opportunities to learn and grow

• Interested in working with new technologies or industries

• Seeking a better work-life balance or company culture

• Want to expand my skill set and experience
Answered by AI
Add your answer

Q1. GCD of 2 strings
Ans. 
GCD of 2 strings is not a common concept in software engineering.
• GCD of 2 strings is not a standard problem in software engineering.

• It is more common to find GCD of integers or numbers.

• If the strings represent numbers, you can convert them to integers and find the GCD.
Answered by AI
Add your answer

Q1. Minimum number of platforms required for train station
Ans. 
Minimum of two platforms are required for a train station.
• At least two platforms are needed for trains to arrive and depart simultaneously.

• Additional platforms may be required depending on the frequency of trains and passenger traffic.

• Platforms should be long enough to accommodate the longest trains that will use the station.
Answered by AI
Add your answer
Q2. Longest Palindromic substring
Ans. 
The problem is to find the longest substring that is a palindrome in a given string.
• A palindrome is a string that reads the same backward as forward.

• We can use dynamic programming to solve this problem.

• We can start by considering each character as the center of a palindrome and expand outwards to find the longest palindrome.

• We can also optimize the solution by using Manacher's algorithm which reduces the time complexit...read more
Answered by AI
Add your answer

Q1. Sort the elements of an unsorted array
Ans. 
Use any sorting algorithm to sort the elements of an unsorted array.
• Choose an appropriate sorting algorithm based on the size of the array and the type of elements.

• Common sorting algorithms include bubble sort, insertion sort, selection sort, merge sort, quick sort, and heap sort.

• Implement the chosen algorithm in the programming language of your choice.

• Test the sorting function with various input arrays to ensure corre...read more
Answered by AI
Add your answer
Q2. Minimum energy required to cross all the hurdles without loosing life. If any point energy becomes 0 game over. Input: [-2,-3,3,1,5]
Ans. 
Find minimum energy required to cross all hurdles without losing life.
• Calculate cumulative sum of energy required to cross each hurdle.

• Find the minimum cumulative sum and add 1 to it.

• If the minimum cumulative sum is negative, return its absolute value + 1.

• This is the minimum energy required to cross all hurdles without losing life.
Answered by AI
Add your answer

Q1. LC 410: Split Array Largest Sum
Ans. 
Split an array into 'm' subarrays to minimize the largest sum among them.
• Use binary search to find the minimum largest sum possible.

• Define a helper function to check if a target sum can be achieved with 'm' splits.

• Example: For array [7, 2, 5, 10, 8] and m=2, the optimal split is [7, 2, 5] and [10, 8] with largest sum 15.
Answered by AI
Add your answer
Q2. Intro was asked
Add your answer