LoanTap Financial Technologies Interview Questions and Answers for Experienced

Easy coding questions DSA

Q1. Reverse a linked list
Ans. 
Reverse a linked list by changing the pointers direction
• Start with three pointers: current, previous, and next

• Iterate through the linked list, updating the pointers to reverse the direction

• Update the head pointer to point to the new first node
Answered by AI
Add your answer
Q2. Find middle of linked list
Ans. 
To find the middle of a linked list, use the slow and fast pointer technique.
• Initialize two pointers, slow and fast, both pointing to the head of the linked list.

• Move slow pointer by one step and fast pointer by two steps until fast reaches the end of the list.

• The position of the slow pointer will be the middle of the linked list.
Answered by AI
Add your answer

Q1. Pick from a basket of oranges
Ans. 
The question is asking to pick an orange from a basket.
• Carefully select a ripe orange without any bruises or blemishes

• Gently twist the orange off the stem to avoid damaging the fruit

• Check for firmness and weight to determine ripeness
Answered by AI
Add your answer

2hrs aptitude test was there

2 hrs coding test was there

GD was conducted and then i passed it

Round one consist of coding problems and there's a minimum criteria of solving 2 problems at least to clear this round

Q1. First question was a coding question, merge intervals leetcode
Add your answer
Q2. Second question was again of leetcode, compare strings
Add your answer

Q1. How dis you tackle the one incident where you disagree with the team lead approach?
Add your answer
Q2. How do you make sure to deliver on time when there are uncertainty?
Ans. 
To deliver on time despite uncertainty, I prioritize tasks, communicate effectively, set realistic deadlines, and have contingency plans.
• Prioritize tasks based on importance and impact on project timeline

• Communicate effectively with team members and stakeholders to address any uncertainties or roadblocks

• Set realistic deadlines taking into account potential delays or uncertainties

• Have contingency plans in place to mitig...read more
Answered by AI
Add your answer

Machine coding round where SOLID principles are evaluated for real life use case

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