Citicorp Software Developer Interview Questions and Answers

The coding question was there 2 questions basically on array were there which was easy

Q1. Swap zeros to the end dsa array,
Ans. 
Swap zeros to the end of a string array
• Iterate through the array and move all zeros to the end

• Use two pointers to keep track of non-zero elements and zeros

• Example: Input: ['a', '0', 'b', 'c', '0'], Output: ['a', 'b', 'c', '0', '0']
Answered by AI
Add your answer
Q2. Some questions on oops and react js and javascript
Add your answer

Q1. Tell me about your work
Add your answer

DSA basic question which can be found on dsa sheet

Asked me to design a project from scratch

Q1. Basic question about work life balance
Add your answer

2 medium dsa questions 1 hour time

Q1. OOPS concept, decomposition, aggregation, puzzles
Add your answer

Q1. Why you will be a good fit,
Ans. 
I believe my skills, experience, and passion for software development make me an excellent fit for this role.
• Strong Technical Skills: I have a solid foundation in Java and related technologies, demonstrated through my work on a project that improved application performance by 30%.

• Problem-Solving Ability: I enjoy tackling complex challenges, as shown when I optimized a database query that reduced load times by 50%.

• Team ...read more
Answered by AI
Add your answer

It was fairly standard. 2 coding questions and mcqs plus aptitude questions

Q1. Most questions were about java. Few about the ide i used, etc.
Add your answer

Q1. Resume based questions
Add your answer
Q2. Asked about the paper i had written in college
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

It was in the evening at about 7 pm. The test platform was quite user friendly and easy to use.
There were 3 sections in test. One was logical ability, second was english, third was coding 
Questions were of medium difficulty.

Q1. 
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...read more
Ans. 
The task is to find the total number of ways to make change for a specified value using given denominations.
• Use dynamic programming to solve this problem efficiently.

• Create a 1D array to store the number of ways to make change for each value from 0 to the target value.

• Iterate through the denominations and update the array based on the current denomination.

• The final answer will be the value at the target index of the ar...read more
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

It was a 30 minute interview. In which I was provided with questions on data structures and algorithms to check my problem solving skills.

Q1. 
Non-Decreasing Array Problem Statement
Given an integer array ARR of size N, determine if it can be transformed into a non-decreasing array by modifying at most one element.
An array is defined as non-de...read more
Ans. 
Determine if an array can be transformed into a non-decreasing array by modifying at most one element.
• Iterate through the array and check if there are more than one decreasing elements.

• If there is only one decreasing element, check if modifying it can make the array non-decreasing.

• Return true if the array can be made non-decreasing by modifying at most one element, otherwise false.
Answered by AI
Add your answer

Round duration - 40 Minutes
Round difficulty - Medium

In this round , interviewer discussed about my resume. As I had done a internship in sql and database so he asked me questions related to dbms and sql queries.