Upload Button Icon Add office photos

Citicorp

Compare button icon Compare button icon Compare

Filter interviews by

Citicorp Software Developer Intern Interview Questions and Answers

Updated 19 Dec 2024

Citicorp Software Developer Intern Interview Experiences

3 interviews found

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

I applied via LinkedIn and was interviewed in Jun 2024. There were 2 interview rounds.

Round 1 - Coding Test 

The assessment consisted of two moderate-level questions related to data structures and algorithms, focusing on strings and 2D arrays, within a time frame of 45 minutes. In the web development section, there were 15 questions each from React and Angular.

Round 2 - Technical 

(2 Questions)

  • Q1. What is object-oriented programming (OOP), and can you explain the concepts of shallow copy and deep copy? Additionally, what technology stack would you choose for a project, and what are the reasons behin...
  • Ans. 

    OOP is a programming paradigm based on the concept of objects, with shallow copy creating a new object with references to the original, and deep copy creating a new object with copies of the original's values.

    • OOP is a programming paradigm that focuses on objects and classes.

    • Shallow copy creates a new object that references the original object's data.

    • Deep copy creates a new object with copies of the original object's da...

  • Answered by AI
  • Q2. What are the features of the project?
  • Ans. 

    The project features include real-time data processing, machine learning algorithms, and user-friendly interface.

    • Real-time data processing for instant updates

    • Machine learning algorithms for predictive analysis

    • User-friendly interface for easy navigation

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Practice data structures and algorithms regularly, participate in contests, and review your projects consistently.
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
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 - Coding Test 

DSA algorithms array linkedlist strings dp

Round 3 - One-on-one 

(1 Question)

  • Q1. Merge 2 sorted linked list
  • Ans. 

    Merge 2 sorted linked lists into a single sorted linked list

    • Create a new linked list to store the merged result

    • Compare the values of the nodes from both lists and add the smaller one to the result list

    • Move the pointer of the list with the smaller value to the next node and repeat until both lists are empty

  • Answered by AI

Skills evaluated in this interview

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Amazon
Q2. Fish Eater Problem Statement In a river where water flows from le ... read more
asked in Apple
Q3. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, eac ... read more
asked in CommVault
Q4. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q5. Reverse Words in a String: Problem Statement You are given a stri ... read more
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Naukri.com and was interviewed before Sep 2022. There were 3 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 - Coding Test 

It was aptitude and coding round basically quesstions were in arrrays and linkedlist

Round 3 - Technical 

(1 Question)

  • Q1. Oops questions in java

Interview Preparation Tips

Interview preparation tips for other job seekers - didn't clear it

Interview questions from similar companies

Interview Questionnaire 

8 Questions

  • Q1. Find a number which occurs odd number of times and all number occurs even number of times
  • Ans. 

    Find an odd occurring number among even occurring numbers.

    • Use XOR operation to cancel out even occurring numbers and get the odd occurring number.

    • Iterate through the array and XOR each element with the result variable.

    • The final result will be the odd occurring number.

  • Answered by AI
  • Q2. Some discussion about my minor project
  • Q3. Spiral order of binary tree and mattrix, print it
  • Ans. 

    Print the spiral order of a binary tree and matrix.

    • For binary tree, use level order traversal and alternate direction for each level.

    • For matrix, use four pointers to traverse in spiral order.

    • Example for binary tree: 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9

    • Example for matrix: 1 2 3 4 -> 8 7 6 5 -> 9 10 11 12 -> 16 15 14 13

  • Answered by AI
  • Q4. Some question about os,dbms
  • Q5. Find pair which have a given sum in a given array
  • Ans. 

    Finding pairs in an array with a given sum.

    • Iterate through the array and for each element, check if the difference between the given sum and the element exists in the array.

    • Use a hash table to store the elements of the array and their indices for faster lookup.

    • If there are multiple pairs with the same sum, return any one of them.

    • If no pair is found, return null or an empty array.

  • Answered by AI
  • Q6. Find total number of k element which have a given avg in a given array in minimum time complexity
  • Ans. 

    Find total number of k element with given avg in an array in minimum time complexity.

    • Use sliding window technique to traverse the array in O(n) time complexity.

    • Maintain a sum variable to keep track of the sum of elements in the window.

    • If the sum of elements in the window is equal to k times the given avg, increment the count.

    • Move the window by subtracting the first element and adding the next element in the array.

  • Answered by AI
  • Q7. Print all elements which in not boundary element in a given binary tree
  • Ans. 

    Printing non-boundary elements of a binary tree

    • Traverse the tree in any order (preorder, inorder, postorder)

    • Check if the current node is not a boundary node (not the first or last node in its level)

    • If it is not a boundary node, print its value

    • Recursively traverse its left and right subtrees

  • Answered by AI
  • Q8. Then some question about process synchronisation,error vs exception,and then 2-3 hr question

Interview Preparation Tips

Round: Test
Experience: practice codes on paper
Tips:

Round: Technical Interview
Experience: very good
Tips: please try to explain each and every question in detail

Round: Technical Interview
Experience: my hr round is not taken by them,and some of face 3rd round ,which is HR
Tips: please prepare all types of problem from geeksforgeeks

Skill Tips: please try to understand every problem from geeksforgeeks
Skills: ds
College Name: NIT Bhopal
Motivation: best work culture,and a lots of learning opportunity in this company,and in every 6 month there is a appraisal

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 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

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 written test was quite similar to the typical CAT pattern. It contained sections on Reading Comprehension, Data Interpretation and Mathematics.

Round: Technical + HR Interview
Experience: There were 2 interviewers in the first interview, one was a technical guy and the other was from HR. They asked me a few very simple puzzles, a few basic programming questions (swapping the value of two variables etc.), questions related to the development cycle of software products. The HR guy asked stuff like what do you want to achieve in life? Strengths, weaknesses etc.

Round: Case Study Interview
Experience: The third interview was the most important one (and I guess that was the deciding interview). The interviewer started with questions like why finance? Which companies are you sitting for? Then he gave me a case study:

Interview Questionnaire 

2 Questions

  • Q1. Oops, os, dbms, project
  • Q2. Why hsbc, why should I hire you.
  • Ans. 

    I have a strong background in software engineering and a passion for innovation, making me a valuable asset to HSBC.

    • I have a proven track record of successfully delivering high-quality software solutions in previous roles.

    • I am highly skilled in various programming languages and technologies, including Java, Python, and SQL.

    • I have experience working in agile development environments, allowing me to adapt quickly to chan...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: 4 sections, 15 questions each. Sections on apti, english, programming, technical.
Tips: Time management, complete english and technical first
Duration: 1 hour
Total Questions: 60

Round: Group Discussion
Experience: We were asked which super hero would you like to be. Shared the information. Always present the positives and negatives and emphasize that despite of being negatives
Tips: Think everything through before speaking
Duration: 40 minutes

Round: Technical Interview
Experience: Prepare well, anything can be asked on the things written on your resume

Round: HR Interview
Experience: Sell yourself. Tell them why you would be the best candidate.
Tips: Tell your advantages of being a fresher that you would be comfortable in any technology

College Name: Acropolis institute of technology and research

Citicorp Interview FAQs

How many rounds are there in Citicorp Software Developer Intern interview?
Citicorp interview process usually has 2-3 rounds. The most common rounds in the Citicorp interview process are Coding Test, Resume Shortlist and Technical.
What are the top questions asked in Citicorp Software Developer Intern interview?

Some of the top questions asked at the Citicorp Software Developer Intern interview -

  1. What is object-oriented programming (OOP), and can you explain the concepts of ...read more
  2. What are the features of the proje...read more
  3. Merge 2 sorted linked l...read more

Tell us how to improve this page.

Citicorp Software Developer Intern Interview Process

based on 3 interviews

Interview experience

3.3
  
Average
View more

Interview Questions from Similar Companies

Wells Fargo Interview Questions
3.8
 • 575 Interviews
HSBC Group Interview Questions
3.9
 • 487 Interviews
American Express Interview Questions
4.2
 • 365 Interviews
BNY Interview Questions
3.9
 • 347 Interviews
UBS Interview Questions
3.9
 • 338 Interviews
Morgan Stanley Interview Questions
3.6
 • 293 Interviews
FactSet Interview Questions
3.9
 • 208 Interviews
View all
Assistant Vice President
4.8k salaries
unlock blur

₹17 L/yr - ₹48.5 L/yr

Assistant Manager
3.3k salaries
unlock blur

₹6.1 L/yr - ₹20.7 L/yr

Officer
2.9k salaries
unlock blur

₹10.9 L/yr - ₹35.9 L/yr

Vice President
2.6k salaries
unlock blur

₹21 L/yr - ₹70 L/yr

Manager
2.3k salaries
unlock blur

₹11.5 L/yr - ₹39 L/yr

Explore more salaries
Compare Citicorp with

Wells Fargo

3.8
Compare

JPMorgan Chase & Co.

3.9
Compare

HSBC Group

3.9
Compare

Cholamandalam Investment & Finance

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