i
Finastra
Filter interviews by
I applied via Naukri.com and was interviewed in Sep 2024. There was 1 interview round.
Swap the positions of two numbers in an array of strings.
Iterate through the array to find the positions of the two numbers to be swapped.
Store the two numbers in temporary variables.
Swap the positions of the two numbers in the array.
Reverse a given string
Use a loop to iterate through the characters of the string
Append each character to a new string in reverse order
Return the reversed string
I applied via Recruitment Consulltant and was interviewed before Feb 2023. There were 4 interview rounds.
Aptitude & Psychometric Test
Technical Aptitude & Coding Round
I applied via Campus Placement and was interviewed in Apr 2022. There were 3 interview rounds.
CCAT aptitude test 50 questions in 20 mins.
Minimum marks required were 31 out of 50
I applied via Campus Placement and was interviewed before Apr 2022. There were 4 interview rounds.
Easy test, but questions to be answered quickly.
Coding test, not very difficult- testing of basic concepts.
Finastra interview questions for designations
I appeared for an interview before Feb 2016.
Top trending discussions
Machine learning advantages and disadvantage
hello world hello OWRLD2
My name is John Doe.
Full name is John Doe
Common first and last name combination
No middle name provided
I am looking for a competitive salary based on my skills, experience, and the industry standard.
Research the average salary for Associate Software Engineers in the industry
Consider your level of experience and skills when determining your salary expectation
Be prepared to negotiate based on the company's offer and benefits package
posted on 21 May 2024
1 hour, around 40 questions on well known aptitude topics.
Simple questions - overlapping area, bit manipulation
There are 2 sections one is Output guess and Another one is Quantitative
I didn't attend 2nd round..i was eliminated in 1st round
I appeared for an interview in Apr 2022.
Round duration - 60 minutes
Round difficulty - Medium
This round had 2 questions with Easy to Medium level of difficulty
You are given two rectangles situated on a 2-D coordinate plane, which may overlap. Your task is to compute the total area covered by these rectangles.
Calculate total area covered by two overlapping rectangles on a 2-D plane.
Calculate the area of each rectangle separately using the given coordinates.
Find the overlapping region by determining the intersection of the two rectangles.
Calculate the area of the overlapping region by multiplying its width and height.
Add the areas of the two rectangles and subtract the area of the overlapping region to get the total area cov
Given an array ARR
consisting of N
integers, rearrange the elements such that all negative numbers are located before all positive numbers. The orde...
Yes, this can be achieved by using a two-pointer approach to rearrange the array with negative numbers at the beginning.
Use two pointers, one starting from the beginning and one from the end of the array.
Swap elements at the two pointers if one is negative and the other is positive, and move the pointers accordingly.
Continue this process until the two pointers meet in the middle of the array.
The resulting array will ha...
Round duration - 70 minutes
Round difficulty - Medium
Standard DS/Algo round with 2 questions
Given the head node of a singly linked list, return a pointer to the middle node of the linked list. If there are an odd number of nodes, return the middle o...
Return the middle node of a singly linked list, considering odd and even number of nodes.
Traverse the linked list with two pointers, one moving at twice the speed of the other
When the faster pointer reaches the end, the slower pointer will be at the middle node
Handle cases for odd and even number of nodes separately
Return null if the list is empty
Given a positive integer N
, your task is to return all the prime numbers less than or equal to N
.
1) A prime number is a number that has only two factors:...
Return all prime numbers less than or equal to a given positive integer N.
Iterate from 2 to N and check if each number is prime using a helper function.
A number is prime if it is not divisible by any number from 2 to its square root.
Store and return the prime numbers in an array in increasing order.
Round duration - 30 minutes
Round difficulty - Easy
This was a Technical Cum HR round where I was first asked some basic Java-related concepts and then we discussed my expectations from the company, learnings and growth in the forthcoming years. I would suggest be honest and try to communicate your thoughts properly in these types of rounds to maximise your chances of getting selected.
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.
Tip 1 : Resume should be informative but not more than two pages
Tip 2 : Provide the links of all your achievements, projects and certificates in your resume
I applied via Referral and was interviewed in Jul 2023. There were 4 interview rounds.
Platform - Hackerrank
time- 90 minutes
2 dsa questions
output- got link for technical interview same day
Longest common subsequence is the longest sequence of characters that appear in the same order in both strings.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of longest common subsequences.
Iterate through the strings and fill the array based on the characters' matches.
Trace back the array to find the actual longest common subsequence.
based on 3 interviews
Interview experience
based on 26 reviews
Rating in categories
Software Engineer
326
salaries
| ₹5.4 L/yr - ₹16.7 L/yr |
Senior Software Engineer
323
salaries
| ₹9 L/yr - ₹30 L/yr |
Associate Software Engineer
165
salaries
| ₹5 L/yr - ₹10 L/yr |
QA Engineer
88
salaries
| ₹5.5 L/yr - ₹11.5 L/yr |
Senior QA Engineer
86
salaries
| ₹7.2 L/yr - ₹24.4 L/yr |
24/7 Customer
Microsoft Corporation
SAP
Thomson Reuters