Upload Button Icon Add office photos

HSBC Group

Compare button icon Compare button icon Compare

Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards

zig zag pattern zig zag pattern

Filter interviews by

HSBC Group Software Developer Interview Questions, Process, and Tips for Freshers

Updated 16 Oct 2024

Top HSBC Group Software Developer Interview Questions and Answers for Freshers

View all 11 questions

HSBC Group Software Developer Interview Experiences for Freshers

2 interviews found

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Jan 2023. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

It was just a typical logical reasoning and aptitude MCQ test

Round 3 - Coding Test 

There were 2 coding questions and you can select any language for solving it. The test was online

Round 4 - Technical 

(13 Questions)

  • Q1. He simply asked me which coding language I prefer and why ? (Mine was C++)
  • Q2. Difference between C and C++?
  • Ans. 

    C is a procedural programming language while C++ is an object-oriented programming language.

    • C is a procedural programming language, while C++ supports both procedural and object-oriented programming.

    • C does not have classes and objects, while C++ does.

    • C does not support function overloading, while C++ does.

    • C does not have exception handling, while C++ does.

    • C does not have namespaces, while C++ does.

  • Answered by AI
  • Q3. What is Object oriented programming?
  • Ans. 

    Object oriented programming is a programming paradigm based on the concept of objects, which can contain data and code.

    • Objects are instances of classes, which define the structure and behavior of the objects.

    • Encapsulation, inheritance, and polymorphism are key principles of object oriented programming.

    • Example: Inheritance allows a class to inherit properties and methods from another class.

    • Example: Encapsulation hides t...

  • Answered by AI
  • Q4. What are the 4 pillars of OOPs?
  • Ans. 

    Encapsulation, Inheritance, Polymorphism, Abstraction

    • Encapsulation: Bundling data and methods that operate on the data into a single unit

    • Inheritance: Ability of a class to inherit properties and behavior from another class

    • Polymorphism: Ability to present the same interface for different data types

    • Abstraction: Hiding the complex implementation details and showing only the necessary features

  • Answered by AI
  • Q5. Write down code implementing all 4 pillars of OOPs.
  • Ans. 

    Code implementing all 4 pillars of OOPs

    • Encapsulation: Encapsulate data within classes and provide public methods to access and modify the data.

    • Inheritance: Create a hierarchy of classes where child classes inherit attributes and methods from parent classes.

    • Polymorphism: Allow objects of different classes to be treated as objects of a common superclass through method overriding and overloading.

    • Abstraction: Hide complex ...

  • Answered by AI
  • Q6. Difference between Stacks and Queues?
  • Ans. 

    Stacks are Last In First Out (LIFO) data structures, while Queues are First In First Out (FIFO) data structures.

    • Stacks: Elements are added and removed from the same end, like a stack of plates. Example: Undo feature in text editors.

    • Queues: Elements are added at the rear and removed from the front, like a line of people waiting. Example: Print queue in a printer.

  • Answered by AI
  • Q7. Write a code to find the 2nd largest element in an array.
  • Ans. 

    Code to find the 2nd largest element in an array

    • Sort the array in descending order and return the element at index 1

    • Iterate through the array and keep track of the two largest elements

    • Handle edge cases like arrays with less than 2 elements

  • Answered by AI
  • Q8. What is merge sort and its Algorithm ?
  • Ans. 

    Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them recursively, and then merges them.

    • Divide the input array into two halves

    • Recursively sort each half

    • Merge the sorted halves back together

  • Answered by AI
  • Q9. What is DBMS and RDBMS and difference between them?
  • Ans. 

    DBMS stands for Database Management System, while RDBMS stands for Relational Database Management System. RDBMS is a type of DBMS.

    • DBMS is a software system that allows users to define, create, maintain and control access to the database.

    • RDBMS is a type of DBMS that stores data in a structured format using tables with rows and columns.

    • RDBMS enforces a set of rules called ACID properties to ensure data integrity, while D...

  • Answered by AI
  • Q10. What is SQL and who its different from mySQL?
  • Ans. 

    SQL is a standard language for managing databases, while MySQL is a specific open-source relational database management system.

    • SQL stands for Structured Query Language and is used to communicate with databases.

    • SQL is a standard language that can be used with various database management systems.

    • MySQL is a specific open-source relational database management system that uses SQL.

    • MySQL is one of the most popular database m...

  • Answered by AI
  • Q11. Difference between Delete, Truncate and Drop?
  • Ans. 

    Delete removes specific rows from a table, Truncate removes all rows from a table, and Drop removes the table itself.

    • Delete is a DML command that removes specific rows from a table based on a condition.

    • Truncate is a DDL command that removes all rows from a table but keeps the table structure.

    • Drop is a DDL command that removes the entire table along with its structure.

  • Answered by AI
  • Q12. Different kind of Joins in DBMS ?
  • Ans. 

    Different types of joins in DBMS include inner join, outer join, left join, right join, and full join.

    • Inner join: Returns rows when there is a match in both tables.

    • Outer join: Returns all rows from one table and only matching rows from the other table.

    • Left join: Returns all rows from the left table and the matched rows from the right table.

    • Right join: Returns all rows from the right table and the matched rows from the ...

  • Answered by AI
  • Q13. And at last 2 to 3 SQL queries. They were not that hard, Just basic queries.

Interview Preparation Tips

Interview preparation tips for other job seekers - Well be prepared with DSA,OOPs and DBMS concept. If you don't know BST or Graphs or Heaps that well, no problem just be confident. Most of the times they don't ask anything more that linked list.
If you don't know the answer of a coding question (NOTE: not a theoretical question) try for sometime to come up with the solution and while thinking keep saying your approach out loud to the interview and if after taking 1 to 2 mins you still don't know just say, Sorry I can't recall it right now but I will definitely get to it after the interview. Don't use this approach for theoretical questions, Either you have an answer to that or not.
Never Beat around the bush, be specific and to the point.

And at last, I just wanna say that passing an interview needs 40% skill, 20% communication, 20% confidence, 10% mood of the interview and 10% is luck.

Why I am saying mood of the interview and luck????
In my case, I was not selected for the final HR round. First of all, in all 137 students selected for the technical interview, my name was at 111 and randomly they called the first student for the interview and it was me. So that's luck.
OK after I entered my interviewer cabin, I saw a look of aggression on my interviewers face. We didn't smiled once during my 50min interview. He didn't even asked me to introduce myself.

He asked me 15 questions in total and I correctly answers 10 of them to the point and for the rest 5 I explained my approach to them.
Still I got rejected, and one of my friend who was answered like 2 questions out of 10 got selected because his interviewer was different. (NOTE: I am really happy for my friend, He is like my best buddy and my only well wisher that I know about).

So yeah just prepare well and be confident and even if things go south and you gave your best, just think that today was not your day and just move on.

Skills evaluated in this interview

Software Developer Interview Questions & Answers

user image Deepesh Gupta

posted on 2 Aug 2023

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
-
Result
Not Selected

I applied via Campus Placement

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Double-check your resume for any spelling mistakes. The recruiter may consider spelling mistakes as careless behavior or poor communication skills.
View all tips
Round 2 - Aptitude Test 

Basic Aptitude and Technical Question

Round 3 - Coding Test 

2 coding Questions asked from array and strings

Round 4 - One-on-one 

(2 Questions)

  • Q1. Projects were asked
  • Q2. Resume should be prepared well
Round 5 - HR 

(1 Question)

  • Q1. Basic HR questions were asked

Software Developer Interview Questions Asked at Other Companies for Fresher

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
Q2. Validate Binary Tree Nodes Problem You are provided with 'N' bina ... read more
asked in Nagarro
Q3. Crazy Numbers Pattern Challenge Ninja enjoys arranging numbers in ... read more
asked in Mr Cooper
Q4. Connect Ropes Problem Statement Given a number of ropes denoted a ... read more
asked in Wipro
Q5. Minimum Operations to Make Strings Equal Given two strings, A and ... read more

Interview questions from similar companies

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

It was a cumulative test

  • Q1. 

    Trapping Rainwater Problem Statement

    You are given an array ARR of long type, which represents an elevation map where ARR[i] denotes the elevation of the ith bar. Calculate the total amount of rainwater t...

  • Ans. 

    Calculate the total amount of rainwater that can be trapped within given elevation map.

    • Iterate through the array to find the maximum height on the left and right of each bar.

    • Calculate the amount of water that can be trapped above each bar by taking the minimum of the maximum heights on the left and right.

    • Sum up the trapped water above each bar to get the total trapped water for the elevation map.

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

It was sophisticated in nature and a good brain buster.

  • Q1. 

    Candies Distribution Problem Statement

    Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...

  • Ans. 

    Determine the minimum number of candies needed to distribute to students based on their performance and ratings.

    • Iterate through the array of student ratings and assign 1 candy to each student initially.

    • Then iterate from left to right and check if the current student's rating is higher than the previous student, if so, assign candies accordingly.

    • Similarly, iterate from right to left to handle cases where the current stu...

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 1 hour
Round difficulty - Medium

  • Q1. DBMS

    It revolved around basic concepts

  • Ans. 

    DBMS is a software system that manages databases and allows users to interact with data stored in them.

    • DBMS stands for Database Management System

    • It helps in creating, updating, and managing databases

    • Examples of DBMS include MySQL, Oracle, SQL Server

    • It ensures data integrity, security, and efficient retrieval

  • Answered by AI
Round 4 - Group Discussion 

Round duration - 70 minutes
Round difficulty - Hard

It was a great experience

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaGood Resume and 7 CGPA +Morgan Stanley interview preparation:Topics to prepare for the interview - I have done a rigourous training on Data Structure and Algorithms. It really helped me a lot to excel in life. Also I did vocational courses which enhanced my personality. I did analytical mindset training with problem solving methodologies. The hands on training on Python and Unix helped me a lot.Time required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : Stay consistent with your efforts
Tip 2 : Work hard with honesty
Tip 3 : Try to set goal of +1 level from the goal you want to achieve

Application resume tips for other job seekers

Tip 1 : Present yourself with honesty
Tip 2 : Mention about the Workshops, hackathons, achievements, and the projects.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in May 2017.

Interview Questionnaire 

6 Questions

  • Q1. Can string class be extended
  • Ans. 

    Yes, the string class can be extended in most programming languages.

    • Inheritance can be used to extend the functionality of the string class.

    • By creating a new class that inherits from the string class, additional methods and properties can be added.

    • Extending the string class allows for customization and adding specific functionality to strings.

    • Example: In Python, the string class can be extended by creating a new class

  • Answered by AI
  • Q2. What are the implecit object in JSP
  • Ans. 

    Implicit objects in JSP are predefined objects that are available for use without any declaration or initialization.

    • Implicit objects in JSP include request, response, session, application, out, config, pageContext, page, exception, and others.

    • These objects provide access to various aspects of the JSP environment and can be used to perform common tasks.

    • For example, the request object allows access to HTTP request parame...

  • Answered by AI
  • Q3. How does hash map works
  • Ans. 

    A hash map is a data structure that uses a hash function to map keys to values.

    • Hash map stores key-value pairs

    • It uses a hash function to compute an index for each key

    • Collisions can occur when two keys hash to the same index

    • Hash maps provide fast access to values based on their keys

  • Answered by AI
  • Q4. Difference between string buffer and string builder
  • Ans. 

    StringBuffer and StringBuilder are both used to manipulate strings, but StringBuffer is thread-safe while StringBuilder is not.

    • StringBuffer is synchronized, making it safe for use in multi-threaded environments.

    • StringBuilder is not synchronized, making it faster but not thread-safe.

    • StringBuffer is preferred when multiple threads are involved, while StringBuilder is preferred for single-threaded scenarios.

    • Both classes p...

  • Answered by AI
  • Q5. What is MVC
  • Ans. 

    MVC is a software architectural pattern that separates an application into three main components: Model, View, and Controller.

    • Model represents the data and business logic of the application.

    • View is responsible for displaying the user interface.

    • Controller handles user input, updates the model, and interacts with the view.

    • MVC promotes separation of concerns and modularity in software development.

    • Example: In a web applica...

  • Answered by AI
  • Q6. What are the annotation used in RESTFULL web services
  • Ans. 

    Annotations used in RESTful web services

    • 1. @Path - Specifies the URI path for the resource

    • 2. @GET - Specifies that the method handles HTTP GET requests

    • 3. @POST - Specifies that the method handles HTTP POST requests

    • 4. @PUT - Specifies that the method handles HTTP PUT requests

    • 5. @DELETE - Specifies that the method handles HTTP DELETE requests

    • 6. @PathParam - Binds the value of a URI template parameter to a method paramete...

  • Answered by AI

Interview Preparation Tips

Skills: Java Application Development

Skills evaluated in this interview

Interview Preparation Tips

Round: Technical Interview
Experience: Technical on paper test questions:(dis was only for 12 among d 26 shortlisted ppl after apti...others directly had interviews)
5 wer selected in this test who wer nw sent for interviews
TECHNICAL INTERVIEW: (pls list the questions asked in all the rounds)
26 shortlisted after apti (14 directly for interviews & 12 had one more technical on paper test...mentioned above)
der wer min 2 technical rounds for each of them...max were 5

- You are given course dependencies
A->B,C
B->D
C->A
D->nothing
The above dependencies mean...if you want to take course A...you should take courses B and C first....To take B,Course D must be taken first....D is an independent course and can be taken without any prior requirements.
Now you are told these dependencies.Come up with an appropriate data structure to represent these dependencies.Then write a code that finds out all the courses that the student can take up...in this case the student can first take course D because its independent.Now that course D has been taken he can next take up B as it depends on B alone...But the courses A and C can never be taken because they depend on each other...So here all the courses that can be taken are B and D.
After i wrote the code....he asked for all possible test cases
-Given an array of length N....It can be filled with nos. only from 1 to N....find which nos are repeated in the array
-Given pointers to two nodes in a binary tree....find their least common ancestor...each node has pointer to only the parent node...not the left and right child..
-In a binary tree(Not necessarily a BST)...suppose the weight of any node is defined as the product of the key value of the node and the level of the node(Root at level 1)...find the node with maximum weight in the binary tree
-A sorted array of size n is right circularly rotated k times and this rotated array is given to you as input...Find out the value of k in log n time .
-There are some processes running at time T....and there are processes running at time T+30.
You have to find out
1)Which processes died at time T+30,which were alive at time T
2)Which are the new processes at time T+30,which were not there at time T
3)Which are the processes that were there at time T and are still running at time T+30
What data structure will you use to represent the process lists and write code to find out the answers to the 3 questions above
-Given a binary search tree...and a target sum...starting at the root...which all paths add up to the target sum?...if there are multiple paths....return the path with least no. of nodes.


College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

There were 33 questions in total. The objective questions were simple.

  • Q1. 

    Sort Big List Dates Problem Statement

    Mary is an enthusiastic party-goer who struggles with remembering event dates. Help Mary by sorting a given list of event dates in an ascending order.

    Example:

    Inpu...
  • Ans. 

    Sort a list of event dates in ascending order based on year, month, and day.

    • Sort the list of dates based on year, then month, and finally day.

    • Use a sorting algorithm to rearrange the dates in ascending order.

    • Ensure the constraints are met for each date in the list.

  • Answered by AI
  • Q2. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Given an array and a target sum, find all pairs of elements that add up to the target sum.

    • Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.

    • If the complement exists, add the pair to the result list.

    • Sort the pairs based on the first element and then the second element.

    • Handle edge cases like duplicate elements and pairs with the same values.

    • Example...

  • Answered by AI
  • Q3. 

    Maximum Sum Problem Statement

    Given an integer N, your task is to recursively break it into three integer parts: N / 2, N / 3, and N / 4. You need to compute the maximum sum possible by dividing the numbe...

  • Ans. 

    Given an integer N, recursively break it into three parts and find the maximum sum possible.

    • Recursively divide N into N/2, N/3, and N/4 to find the maximum sum

    • Compare the sum obtained by dividing N with the sum of N itself

    • Return the maximum sum for each test case

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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 resume tips for other job seekers

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

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview before Mar 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions based on DSA.

  • Q1. 

    Duplicate Integer in Array

    Given an array ARR of size N, containing each number between 1 and N-1 at least once, identify the single integer that appears twice.

    Input:

    The first line contains an integer...
  • Ans. 

    Identify the duplicate integer in an array containing numbers between 1 and N-1.

    • Iterate through the array and keep track of the frequency of each element using a hashmap.

    • Return the element with a frequency greater than 1 as the duplicate integer.

    • Ensure the constraints are met and a duplicate number is guaranteed to be present.

  • Answered by AI
  • Q2. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Calculate the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current node value to the path sum and multiply by 10 for each level

    • When reaching a leaf node, add the final path sum to the total sum

    • Return the total sum modulo (10^9 + 7)

  • Answered by AI
  • Q3. 

    Topological Sort Problem Statement

    You are given a directed acyclic graph (DAG). Your task is to perform topological sorting of the graph and return any valid ordering.

    Explanation:

    A directed acyclic g...

  • Ans. 

    Implement a function to perform topological sorting on a directed acyclic graph (DAG) and return any valid ordering.

    • Create a graph data structure to represent the DAG

    • Use depth-first search (DFS) to perform topological sorting

    • Maintain a visited array to keep track of visited nodes

    • Return the ordering of nodes after DFS traversal

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical interview round with questions based on DSA.

  • Q1. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other.

    • Consider edge cases like when X or Y is the root node.

    • Implement a recursive or iterative solution to find the LCA efficiently.

  • Answered by AI
  • Q2. 

    Rotated Array Minimum Finder

    You are provided with a sorted array that has undergone 'K' rotations (the exact value of 'K' is unknown). A rotation involves shifting each element of the array to the right,...

  • Ans. 

    Implement a function to find the minimum number in a rotated sorted array efficiently.

    • Use binary search to find the minimum element in the rotated array.

    • Compare the mid element with the start and end elements to determine which half of the array to search next.

    • Continue the binary search until the minimum element is found.

  • Answered by AI
  • Q3. 

    Maximum Binary Tree Construction Problem

    Given an array TREE of 'N' unique integers, construct a maximum binary tree using the following rules:

    1. The root of this tree is the maximum number in TREE.
    2. T...
  • Ans. 

    Construct a maximum binary tree from an array of unique integers following specific rules.

    • Find the maximum number in the array to set as the root of the tree.

    • Recursively construct the left subtree with elements before the maximum number.

    • Recursively construct the right subtree with elements after the maximum number.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

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 resume tips for other job seekers

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.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: The test was for two and half hours where 1 hour was for general aptitude, 1 hr was for coding aptitude(either on java or C or C++as you choose) and 1/2 an hour for two coding questions.

Round: Technical Interview
Experience: In technical round they asked puzzles, aptitude questions and basic C coding. I was asked to write the code for two questions(one was on sort and search) and was asked the logic of two questions.They asked basics of linked lists, stacks, queues. Infact they were not very interested in the syntax and were pressing on the logic

General Tips: Being a non software branch students is not at all a problem. The company took 4 interns where 3 were from core branches. The fact that we had to work in JAVA and most of us didn't know JAVA, the company only looks for aptitude and ability to learn. So if you don't know anything, tell frankly that you don't know that part, rather than guessing. Be thorough with what you know and confidentially answer all the questions.
Also do not be tensed and take things lightly, if the interviewer is joking. Be candid.
Skill Tips: Learn basics of coding from books . Aptitude can be done from sites likes geeks for geeks, etc. The level of aptitude is not very high and infact the coding aptitude is also theoretical and does not involve in depth knowledge.
Skills:
College Name: NIT Surathkal

Interview Preparation Tips

Round: Test
Experience: Online Test (General aptitude, C aptitude ,Programming problems).

General Tips: Study basics of C and DSA well. Utilize the last summer vacations for studying for placements. Be confident and Honest.
Yes it is challenging and exhausting. It tests your patience. But final reward is also great so we must keep going toward it.
Skill Tips: Online coding sites such as Codechef, etc. Narasimha Karumanchi for data structures and algorithm will help in preparation.
Skills:
College Name: NIT Surathkal

I applied via Campus Placement

Interview Questionnaire 

2 Questions

  • Q1. How can a chemical Engineer help citi?
  • Ans. 

    A chemical engineer can help Citi by providing expertise in process optimization, risk management, and sustainability.

    • Optimizing Citi's manufacturing processes to reduce costs and increase efficiency

    • Developing risk management strategies to ensure compliance with environmental regulations

    • Implementing sustainable practices to reduce Citi's environmental impact

    • Providing technical expertise in chemical reactions and materi...

  • Answered by AI
  • Q2. He asked me about my JEE Rank, preparations

Interview Preparation Tips

Round: HR Interview
Experience: I had done many web and android apps. They asked me about my institute experience, things I have done here. It was an easy walk for me.

Skills: SQL, Java Programming
Duration: 2
College Name: IIT Madras

HSBC Group Interview FAQs

How many rounds are there in HSBC Group Software Developer interview for freshers?
HSBC Group interview process for freshers usually has 4-5 rounds. The most common rounds in the HSBC Group interview process for freshers are Resume Shortlist, Aptitude Test and Coding Test.
What are the top questions asked in HSBC Group Software Developer interview for freshers?

Some of the top questions asked at the HSBC Group Software Developer interview for freshers -

  1. What is DBMS and RDBMS and difference between th...read more
  2. What are the 4 pillars of OO...read more
  3. What is Object oriented programmi...read more

Tell us how to improve this page.

HSBC Group Software Developer Interview Process for Freshers

based on 2 interviews

Interview experience

3.5
  
Good
View more
HSBC Group Software Developer Salary
based on 158 salaries
₹5.8 L/yr - ₹25 L/yr
62% more than the average Software Developer Salary in India
View more details

HSBC Group Software Developer Reviews and Ratings

based on 26 reviews

4.3/5

Rating in categories

3.7

Skill development

4.2

Work-life balance

3.6

Salary

4.1

Job security

4.5

Company culture

3.6

Promotions

3.9

Work satisfaction

Explore 26 Reviews and Ratings
Assistant Manager
2.6k salaries
unlock blur

₹4.5 L/yr - ₹15 L/yr

Manager
2.1k salaries
unlock blur

₹8.1 L/yr - ₹28.1 L/yr

Senior Software Engineer
1.6k salaries
unlock blur

₹7.8 L/yr - ₹26 L/yr

Assistant Vice President
1.5k salaries
unlock blur

₹13.8 L/yr - ₹45 L/yr

Software Engineer
1.4k salaries
unlock blur

₹4.9 L/yr - ₹14.5 L/yr

Explore more salaries
Compare HSBC Group with

Wells Fargo

3.8
Compare

JPMorgan Chase & Co.

3.9
Compare

Cholamandalam Investment & Finance

3.9
Compare

Citicorp

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview