HSBC Group Software Engineer Intern Interview Questions and Answers

Q1. OOP basic about the concept
Add your answer
Q2. Ms Sql based sql queries
Add your answer

Q1. How exception handing in api
Ans. 
Exception handling in API involves catching and handling errors that occur during API execution.
• Use try-catch blocks to catch exceptions and handle them appropriately

• Throw custom exceptions to provide meaningful error messages to API consumers

• Use status codes to indicate the outcome of API requests (e.g. 200 for success, 400 for client errors, 500 for server errors)

• Log exceptions to track errors and troubleshoot issues

• ...read more
Answered by AI
Add your answer
Q2. Code for multiplication table
Ans. 
Code to generate a multiplication table in a programming language
• Use nested loops to iterate through rows and columns

• Print the product of row and column for each cell

• Consider formatting the output for better readability
Answered by AI
Add your answer

Two easy code ,basic array string

Q1. Coding question
Add your answer
Q2. Oops, dbms,sql,
Add your answer

Q1. How do you Structure Database? Make Design ?
Ans. 
A well-structured database design is crucial for efficient data management.
• Identify entities and their relationships

• Normalize data to reduce redundancy

• Choose appropriate data types and constraints

• Consider performance and scalability

• Document the design and update as needed
Answered by AI
Add your answer
Q2. Ask about Low Level Design?
Add your answer

Q1. Basic & Advance concepts of .NET & SQL
Add your answer
Q2. OOPs basics, Linq, jQuery, Javascript
Add your answer

Q1. Basic discussion about your previous company & salary negotiation etc.
Add your answer

Same as all aptitude tests they will give u 7 coding but there will be some mistake in coding we should find and solve that for any 3 or 1 we get a interview call.

Q1. They will ask u to write coding in note pad and they will ask data structure questions thats it. Add 2 numbers in all languages On data structure: about binary search.
Add your answer

Round duration - 120 minutes
Round difficulty - Easy

It consisted of 3 coding questions which were purely based on Data Structures and Algorithms.

Question 1 - Find the length of the longest switching sub-array. An array is called switching if all numbers in even positions are equal and all numbers in odd positions are equal. 


Question 2 - It was a long passage question on Dynamic Programming but the solution was really easy.

Question 3 - Given a string S consisting of N lowercase letters, return the minimum number of letters that must be deleted to obtain a word in which every letter occurs a unique number of times. Ex - "aaaabbbb" should return 1, as when we delete 1 a or 1 b , a and b will have different frequencies.


The major point to note in the coding round was that they did not have any time or space limit, so brute force solutions were also accepted. 
The result of my test was declared just as the test ended and I scored a 100%, but they took a long time to release the final shortlist. There was a gap of about a week between the test and interviews.

Q1. 
Longest Switching Subarray Problem Statement
Determine the length of the longest contiguous subarray in a given array of positive integers, where the subarray qualifies as 'switching'. An array is defined...read more
Ans. 
It's like a sliding window problem.
We keep track of even and odd equality with 2 variables, even and odd.
Whenever we come across a unmet condition, like index even but not equal with even variable and same goes for odd, we first
Record the length till now in max_len.
Reset start to i-1 as this is need incase of all elements equal.
Reset even and odd according to current index i to arr[i] and arr[i-1] respectively.
Answered Anonymously
Add your answer
Q2. 
Unique Frequency Problem Statement
Given a string 'STR' with lowercase letters, determine the minimum number of deletions required to ensure that every letter in the string appears a unique number of time...read more
Ans. Brute Force
As we are only allowed to delete the character, thus the resulting string after deletion of some character would be the subsequence of the string. So, we have to find such a subsequence which has the unique frequency of each character. 
 
Initialise a variable ‘ans’ that will store the minimum number of characters that are needed to remove from the string. Create all the subsequences of the string an...read more
Answered Anonymously
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

Amex came for two profiles - Tech Role and Analyst, 19 and 23 people respectively were shortlisted for the interviews. Fortunately, I was shortlisted for both the roles. I was asked basic question of C++ and it was majorly an HR Round

Round duration - 20 minutes
Round difficulty - Easy

It was a fairly simple round conssting of 5 - 6 questions related to coding, puzzles and me.

What are your interests? 
What projects have you done and your field of interest?

Round duration - 50 minutes
Round difficulty - Easy

This round was purely technical
No introduction was done, straight to the point

My preference was the Tech Role, so as I was selected in this, I never had to give interviews for the Analyst role. In total 5 people were selected in the Analyst profile and 4 in the Tech profile.

In the end, I was offered a 6 months internship at Amex.

Q1. 
Palindrome Linked List Detection
Given a singly linked list of integers, determine if it is a palindrome. A linked list is considered a palindrome if it reads the same forward and backward.
Example:
Inp...read more
Ans. 
I gave the two pointer approach. Then he said what if we are provided with the length of the list. I said that we will move forward in the list till n/2 nodes and then the same approach as above. Then he said what if we had to do it with a stack. I said we will add elements into the stack till n/2 nodes and then start popping elements while simultaneously traversing the linked list from the (n/2+1)th node till n if the...read more
Answered Anonymously
Add your answer