Faster and better experience!
Filter interviews by
I was interviewed in Dec 2024.
My strengths include strong analytical skills, attention to detail, and ability to work well under pressure.
Strong analytical skills
Attention to detail
Ability to work well under pressure
Core Java concepts and SQL
The most important annotation in Spring Boot is @SpringBootApplication.
Used to mark the main class of a Spring Boot application
Enables auto-configuration and component scanning
Combines @Configuration, @EnableAutoConfiguration, and @ComponentScan annotations
Spring Boot is an opinionated framework for building stand-alone, production-grade Spring-based Applications.
Spring Boot is a framework that simplifies the setup and configuration of Spring applications.
Spring MVC is a part of the Spring Framework that focuses on providing a model-view-controller architecture for web applications.
Spring Boot includes Spring MVC as one of its components, along with other features like e...
Discover Financial Services interview questions for popular designations
I applied via LinkedIn and was interviewed before Feb 2023. There were 3 interview rounds.
Based on string manipulation
Data structure trees based problem
Scenario based questions
Top trending discussions
I applied via Campus Placement
My short term goal is to gain experience and improve my skills. My long term goal is to become a leader in my field.
Short term goal: Gain experience and improve skills
Long term goal: Become a leader in the field
Examples: Attend workshops, take on challenging projects, seek mentorship
In 5-6 years, I see myself as a senior analyst or manager, leading a team and contributing to the growth of the company.
Leading a team of analysts or managers
Contributing to the growth of the company
Continuing to learn and develop new skills
Building strong relationships with clients and colleagues
Exploring opportunities for professional growth and advancement
I wanted to gain practical experience and develop my skills in the workforce before pursuing further education.
I believe that hands-on experience is invaluable in any field
I wanted to develop my skills and knowledge in a practical setting
I felt that pursuing an MBA immediately after my undergraduate degree would not provide me with the same level of experience and growth
I plan to pursue an MBA in the future, once I hav...
I have the necessary skills, experience, and passion to contribute to the company's growth and success.
I have a proven track record of achieving targets and delivering results.
I possess strong communication and interpersonal skills, which enable me to work effectively with colleagues and clients.
I am a quick learner and adaptable to new technologies and work environments.
I am passionate about the industry and committed...
I prefer not to disclose my political preference.
I believe in keeping my political views private.
As an analyst, it is important to remain neutral and unbiased.
My personal political preference does not affect my work or analysis.
CBI is the premier investigating agency of India, responsible for investigating high-profile cases.
CBI stands for Central Bureau of Investigation
It is responsible for investigating cases related to corruption, economic offenses, and special crimes
It has the power to investigate cases across state borders
CBI is also responsible for maintaining the Interpol wing in India
Some high-profile cases investigated by CBI include...
I am interested in both fields and believe that understanding politics is crucial for auditing.
Politics and business are intertwined, and understanding the political landscape can help in auditing decisions.
As a commerce student, I have learned about the impact of government policies on businesses.
In India, politics plays a significant role in shaping the economy and business environment.
Having knowledge of political d...
My favorite subject is history.
I love learning about past events and how they shaped the world we live in today.
I find it fascinating to study different cultures and civilizations throughout history.
I enjoy analyzing historical documents and artifacts to gain a deeper understanding of the past.
Some of my favorite topics include ancient Egypt, the Roman Empire, and World War II.
I was interviewed before Jan 2021.
Round duration - 90 minutes
Round difficulty - Medium
It was conducted in Hacker rank which consisted of 10 aptitude questions that included C, C++, Java MCQ. 2 programming questions were also given.
Given an N x M
matrix filled with integers, determine the minimum sum obtainable from a path that starts at a specified cell (x, y)
and ends at the top left corner of t...
The problem involves finding the minimum sum path from a specified cell to the top left corner of a matrix.
Start from the specified cell and calculate the minimum sum path to reach the top left corner using dynamic programming.
Consider the three possible moves: down, right, and down-right diagonal.
Keep track of the minimum sum at each cell and update it based on the minimum of the three possible moves.
Finally, the mini...
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use backtracking to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Recursively generate combinations by adding open parentheses if there are remaining, and closing parentheses if the number of open parentheses is greater than the number of clo...
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on data structures, oops and networking.
Create a program that counts and prints the total number of specific character types from user input. Specifically, you need to count lowercase English alphabets, numeric digi...
Create a program to count lowercase alphabets, digits, and white spaces from user input until '$' is encountered.
Read characters from input stream until '$' is encountered
Count lowercase alphabets, digits, and white spaces separately
Print the counts of each character type as three integers separated by spaces
Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.
The fir...
Find K largest elements in an unsorted array and return them in non-decreasing order.
Sort the array in non-decreasing order.
Return the last K elements of the sorted array.
To check internet connection on a system, you can use various methods like pinging a website or checking network status.
Use ping command to check connectivity to a website (e.g. ping www.google.com)
Check network status using network settings or command line tools
Try accessing a website or online service to verify internet connection
When you type a URL in a web browser, the browser sends a request to the server hosting the website, which then responds with the necessary files to display the webpage.
Browser checks cache for DNS resolution
If not found, browser sends a DNS query to resolve the domain name to an IP address
Browser establishes a TCP connection with the server
Browser sends an HTTP request to the server for the webpage
Server processes the...
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on data structures, oops and networking.
Ninja is learning about sorting algorithms, specifically those that do not rely on comparisons. Can you help Ninja implement the counting sort algorithm?
Implement counting sort algorithm to sort an array of integers without comparisons.
Count the frequency of each element in the input array.
Calculate the prefix sum of frequencies to determine the position of each element in the sorted array.
Place each element in its correct position based on the prefix sum.
Time complexity of counting sort is O(n+k), where n is the number of elements and k is the range of input.
Example: ...
The Fibonacci series has applications in various fields such as mathematics, computer science, art, and nature.
Used in algorithms for optimization problems and dynamic programming.
Found in nature, such as the arrangement of leaves on a stem, the branching of trees, and the spiral shapes of shells.
Applied in financial markets for predicting stock prices and analyzing market trends.
Utilized in art and design for creating
Round duration - 30 minutes
Round difficulty - Easy
HR round where the interviewer asked questions to know more about me.
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 : 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.
I was interviewed before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
I couldn't find an optimal approach to the first question, so she skipped that question and proceeded to next questions. Remaining questions I have answered satisfactorily.
Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Provide true
if such a subset exists, otherwise r...
Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Use dynamic programming to solve this problem efficiently
Create a 2D array to store if a subset with a particular sum exists
Iterate through the array and update the 2D array accordingly
Check if the value at the end of the iteration is true for the given K
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
BFS traversal in a disconnected graph starting from vertex 0.
Implement BFS algorithm to traverse the graph starting from vertex 0.
Use a queue to keep track of visited nodes and their neighbors.
Ensure to print the traversal sequence in the correct order.
Handle disconnected components by checking for unvisited nodes.
Follow the BFS approach of exploring neighbors before moving to the next level.
Round duration - 60 minutes
Round difficulty - Easy
I told that my strength is problem solving and I can always find a way when there is a bottle-neck. Gave some examples of my experiences while doing my assignments.
Given a string STR
consisting of words separated by spaces, your task is to replace all spaces between words with the characters "@40".
The first line contains an integ...
Replace spaces in a string with '@40'.
Iterate through each character in the string
Replace spaces with '@40'
Return the modified string
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 : 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.
based on 7 interviews
Interview experience
based on 8 reviews
Rating in categories
Senior Data Engineer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Test Automation Manager
3
salaries
| ₹0 L/yr - ₹0 L/yr |
American Express
Capital One Financial Corporation
Visa
MasterCard