FinIQ interview experience Real time questions & tips from candidates to crack your interview
Software Engineer Trainee
FinIQ
3 rounds | 5 Coding
problems
Selected Interview preparation journey
Journey
During my B Tech, I started practising coding questions and participating in interview mocks.Till then, I solved many questions in all the practicing websites.
Application story
This company visited to my campus for the placement. We just had to upload resume and filled all details
Why selected/rejected for the role?
I was accepted as I answered all the given questions correctly. Also I had active participation in the Group Discussion rounds.
Preparation
Duration: 3 months
Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Application process
Where: Campus
Eligibility: Above 7 CGPA
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Interview rounds
01
Round
Medium
Video Call
Duration45 MINUTES
Interview date18 Feb 2021
Coding problem2
Technical round with 2 DSA questions.
1. Find prime numbers
Easy
15m average time
80% success
0/40
Asked in companies
You are given a positive integer ‘N’. Your task is to print all prime numbers less than or equal to N.
Note: A prime number is a natural number that is divisible only by 1 and itself. Example - 2, 3, 17, etc.
You can assume that the value of N will always be greater than 1. So, the answer will always exist.
Problem approach
We will optimize the test to check if a given number is prime. Instead of looping to N-1, we check divisibility till (N)^½. This is because if the number is not prime, there must be at least one divisor till N^½.
2. Binary Search
Easy
15m average time
85% success
0/40
Asked in companies
You are given an integer array 'A' of size 'N', sorted in non-decreasing order. You are also given an integer 'target'. Your task is to write a function to search for 'target' in the array 'A'. If it exists, return its index in 0-based indexing. If 'target' is not present in the array 'A', return -1.
Note:
You must write an algorithm whose time complexity is O(LogN)
Problem approach
while(low <= high) do until the pointers low and high meet each other.
mid = low + (high - low)/2
if (key == arr[mid])
return mid
/* key is on the right side */
else if (key > arr[mid])
low = mid + 1
/* key is on the left side */
else
high = mid - 1
02
Round
Easy
Video Call
Duration30 minutes
Interview date18 Feb 2021
Coding problem2
Technical round with questions on core subjects.
1. DBMS
What is SQL?
Why we use databases?
What is RDBMS ?
2. SQL
Write query to retrieve all names start with 'S'
03
Round
Easy
HR Round
Duration30 minutes
Interview date18 Feb 2021
Coding problem1
HR round with behavioural questions,
1. Basic HR Questions
Introduce yourself
What are your achievements?
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 - Intern
3 rounds | 4 problems
Interviewed by FinIQ
Selected 
558 views
0 comments
0 upvotes
Graduate Engineer Trainee
3 rounds | 5 problems
Interviewed by FinIQ
Selected 535 views
0 comments
0 upvotes
Graduate Engineer Trainee
2 rounds | 5 problems
Interviewed by FinIQ
Selected 524 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3452 views
0 comments
0 upvotes