Citicorp Software Developer Interview Questions, Process, and Tips

Q1. They grind u in javascript,typescript
Add your answer
Q2. Html css, angular
Add your answer
Q3. Deep preparation needed
Add your answer

DSA and array with graph skills 2:00 hours , leetcode

Q1. Tell me about yourself
Ans. 
I am a passionate software developer with experience in building web applications using various technologies.
• Experienced in developing web applications using HTML, CSS, JavaScript, and frameworks like React and Angular

• Proficient in backend development with Node.js and databases like MongoDB and MySQL

• Familiar with version control systems like Git and deployment tools like Heroku

• Strong problem-solving skills and ability
Answered by AI
Add your answer
Q2. Why we should considered
Add your answer

Q1. Strength and positives
Add your answer
Q2. Weakness and feedback
Add your answer

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

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. Recursion
 
1. The idea is to use recursion.
2. For a particular coin, we have two options either include it or exclude it.
3. If we include that coin, then calculate the remaining number that we have to generate so recur for that remaining number.
4. If we exclude that coin, then recur for the same amount that we have to make.
5. Our final answer would be the total number of ways either by including or excluding.
6. There will be two edg...read more
Answered Anonymously
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. Brute Force
As we are allowed at most one modification, we can try it on every index separately and naively check whether the array becomes non-decreasing by any modification. For this, we can modify the starting index (i.e. 0) to a very less value (say INT_MIN) and the rest of the indexes as the value of the preceding element if present (i.e. ARR[i] = ARR[i - 1]). 
Space Complexity: O(1)Explanation:
O(1).
 
As w...read more
Answered Anonymously
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.