FinBox interview experience Real time questions & tips from candidates to crack your interview
SDE - Intern
FinBox
2 rounds | 4 Coding
problems
Selected Interview preparation journey
Journey
In the beginning, I started learning about basic DSA concepts. These included topics like array, string, stack, queue and solving questions on online platforms. After practicing enough on that, I moved to advanced DSA topics including LinkedList, Tree, Graph, DP, etc. I practiced these topics on coding platforms. Then I gave some mock interviews as well that helped me prepare for interviews.
Application story
This was an on-campus opportunity. The company visited our campus, and we directly applied through their portal. Shortlisting was done on the basis of resumes and then further interview rounds were carried out.
Why selected/rejected for the role?
My basic concepts of all the topics were clear and I also prepared HR questions through mock interviews. I practiced all the basic to medium coding question before interview.
Preparation
Duration: 2 months
Topics: Array, Dp, string, Tree, graph and other important coding questions
Tip 1: Practice 3 DSA based questions daily.
Tip 2 : Prepare resume well.
Application process
Where: Campus
Eligibility: 6.5
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Interview rounds
01
Round
Medium
Face to Face
Duration60 minutes
Interview date8 Feb 2023
Coding problem3
2. Best time to buy and sell stock
Moderate
30m average time
72% success
0/80
Asked in companies
You are given an array of integers 'prices' of size 'n', where ‘prices[i]’ is the price of a given stock on an ‘i’-th day. You want to maximize the profit by choosing a single day to buy one stock and a different day to sell that stock.
Please note that you can’t sell a stock before you buy one.
3. Reverse Linked List
Moderate
15m average time
85% success
0/80
Asked in companies
Given a singly linked list of integers. Your task is to return the head of the reversed linked list.
For example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Follow Up :
Can you solve this problem in O(N) time and O(1) space complexity?
02
Round
Easy
HR Round
Duration30 minutes
Interview date8 Feb 2023
Coding problem1
1. Basic HR Question
Why should we hire you?
Who is your role model?
What is your long-term goal?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
Selected 
4657 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
Rejected
961 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
Rejected
6451 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3452 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
Rejected
15481 views
4 comments
0 upvotes
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
Selected 15339 views
1 comments
0 upvotes
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
Selected 10142 views
2 comments
0 upvotes