Upload Button Icon Add office photos

Citicorp

Compare button icon Compare button icon Compare

Filter interviews by

Citicorp Application Development Analyst Interview Questions and Answers

Updated 25 Mar 2024

Citicorp Application Development Analyst Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Mar 2023. There were 2 interview rounds.

Round 1 - One-on-one 

(1 Question)

  • Q1. Java, multithreading, string, oops, palindrome or not code, sql, etc
Round 2 - HR 

(1 Question)

  • Q1. Puzzel and hr plus technical questions

Interview questions from similar companies

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 ]

Interview Questionnaire 

11 Questions

  • Q1. What is the difference between multi tasking, multi processing and multi programming operating systems with examples ?
  • Ans. 

    Multi tasking, multi processing, and multi programming are different approaches to managing tasks in an operating system.

    • Multi tasking allows multiple tasks to run concurrently on a single processor.

    • Multi processing involves multiple processors running tasks simultaneously.

    • Multi programming allows multiple programs to be loaded into memory and executed concurrently.

    • Examples of multi tasking operating systems include Wi...

  • Answered by AI
  • Q2. Tell me about memory allocation (stack vs. heap)?
  • Ans. 

    Memory allocation refers to the process of assigning memory to programs during runtime.

    • Stack allocation is done automatically and is limited in size.

    • Heap allocation is done manually and is larger in size.

    • Stack memory is used for local variables and function calls.

    • Heap memory is used for dynamic memory allocation.

    • Memory leaks can occur if heap memory is not properly managed.

  • Answered by AI
  • Q3. You have two threads one printing even numbers in order and other odd numbers. Design an algorithm so that it prints numbers in natural order?
  • Ans. 

    Use a shared variable and synchronization mechanisms to ensure natural order printing of numbers.

    • Create two threads, one for printing even numbers and the other for printing odd numbers.

    • Use a shared variable to keep track of the current number to be printed.

    • Implement synchronization mechanisms like locks or semaphores to ensure only one thread can access the shared variable at a time.

    • Each thread should check if it is i...

  • Answered by AI
  • Q4. Print a matrix in spiral order?
  • Ans. 

    Printing a matrix in spiral order

    • Start from the first element and print it

    • Move in a spiral order towards the center of the matrix

    • Repeat until all elements are printed

  • Answered by AI
  • Q5. Thread class and Runnable Interface?
  • Ans. 

    Thread class and Runnable Interface are used for multithreading in Java.

    • Thread class is a predefined class in Java that provides methods to create and control threads.

    • Runnable interface is used to define a task that can be executed by a thread.

    • Thread class implements Runnable interface.

    • Thread class provides more control over threads than Runnable interface.

    • Example: Thread t = new Thread(new MyRunnable()); t.start();

    • Exa...

  • Answered by AI
  • Q6. What’s the difference between a Linked List and an ArrayList and give me an example of when to use which?
  • Ans. 

    Linked List is a dynamic data structure while ArrayList is a static data structure.

    • Linked List is best for frequent insertion and deletion operations.

    • ArrayList is best for frequent access operations.

    • Linked List uses more memory than ArrayList.

    • ArrayList is faster than Linked List for accessing elements.

    • Use Linked List when you need to frequently add or remove elements from the list.

    • Use ArrayList when you need to frequen

  • Answered by AI
  • Q7. Questions of OS concepts?
  • Q8. A role play scenario was given. With a clear instruction on I don’t need to know the basis and the hypothetical assumption was presented. I was told that I was expected to respond to the given scenario, in...
  • Q9. Why are you interested in a career in investment banking?
  • Ans. 

    I am not interested in a career in investment banking.

    • I am more interested in a career in software development

    • I enjoy problem-solving and creating innovative solutions through coding

    • Investment banking does not align with my passion and skill set

  • Answered by AI
  • Q10. Why have you chosen to apply to J.P. Morgan?
  • Ans. 

    I have chosen to apply to J.P. Morgan because of their reputation, global presence, and opportunities for growth.

    • J.P. Morgan has a strong reputation in the financial industry.

    • They have a global presence with offices in multiple countries.

    • The company offers various opportunities for career growth and development.

    • J.P. Morgan is known for its innovative technology solutions in the financial sector.

    • I am impressed by their ...

  • Answered by AI
  • Q11. Have you ever made a mistake? Tell us about it?
  • Ans. 

    Yes, I have made a mistake in my previous project.

    • I underestimated the complexity of a task and ended up missing the deadline.

    • I failed to properly test a feature, resulting in a bug that affected user experience.

    • I accidentally deleted an important file without having a backup.

    • I misunderstood a requirement and implemented a feature incorrectly.

  • Answered by AI

Interview Preparation Tips

Round: Test
Total Questions: 1

General Tips: Interview Process: Aptitude test, followed by 3 rounds of interview. Interview process was very good. Just be positive to clear the interview.
Check this link before appearing for interview with JP Morgan. It will help  -----
Skills: Algorithm, Data structure, Stack
College Name: Na

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Face to Face 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

It was in the day time. I was asked the programming language of my choice. It was mostly focused on programming fundamentals. I was asked 2 questions based on Data Structures and Algorithms.

  • Q1. How can you detect a loop in a linked list?
  • Ans. 

    A loop in a linked list can be detected using Floyd's Cycle Detection Algorithm.

    • Use two pointers - slow and fast, where slow moves one step at a time and fast moves two steps at a time.

    • If there is a loop, the two pointers will eventually meet at some point within the loop.

    • To detect the start of the loop, reset one pointer to the head and move both pointers one step at a time until they meet again.

  • Answered by AI
Round 2 - Face to Face 

Round duration - 30 minutes
Round difficulty - Easy

This round was mostly focused on my resume and projects.

Round 3 - Face to Face 

Round duration - 30 minutes
Round difficulty - Easy

It was in the evening. I went to their office in Gurgaon. It was taken by one of the technology director who had a lot of experience. 
 

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Bharati Vidyapeeth's College of Engineering. I applied for the job as SDE - 1 in GurgaonAmerican Express interview preparation:Topics to prepare for the interview - Data structures and algorithms, Object-Oriented Programming System concepts, Database Management System, Operating System, Networking.Time required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Do practice a lot of data structures questions as mostly questions in interviews are based on them. Also, do prepare for projects mentioned in your resume and skills which you have mentioned. Coding ninjas has a big hand in making my interview clear as I have taken a course from the coding Ninjas which helped me a lot to make my concepts clear.

Application resume tips for other job seekers

Keep it short and crisp. Go through it properly before the interview. Make sure that you haven't put anything in it that can cause you problems during the interview.

Final outcome of the interviewSelected

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

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 applied via Naukri.com and was interviewed in Jul 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Web Api, authentication

Interview Preparation Tips

Interview preparation tips for other job seekers - Easy interview
Prepare and be procise

Interview Questionnaire 

1 Question

  • Q1. All questions are related to ds and algorithm. Implications of data structure

Citicorp Interview FAQs

How many rounds are there in Citicorp Application Development Analyst interview?
Citicorp interview process usually has 2 rounds. The most common rounds in the Citicorp interview process are One-on-one Round and HR.

Tell us how to improve this page.

Citicorp Application Development Analyst Interview Process

based on 2 interviews

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Wells Fargo Interview Questions
3.8
 • 570 Interviews
HSBC Group Interview Questions
3.9
 • 487 Interviews
American Express Interview Questions
4.2
 • 364 Interviews
BNY Interview Questions
3.9
 • 346 Interviews
UBS Interview Questions
3.9
 • 336 Interviews
Morgan Stanley Interview Questions
3.7
 • 292 Interviews
FactSet Interview Questions
3.9
 • 208 Interviews
View all
Citicorp Application Development Analyst Salary
based on 124 salaries
₹10 L/yr - ₹30 L/yr
179% more than the average Application Development Analyst Salary in India
View more details

Citicorp Application Development Analyst Reviews and Ratings

based on 12 reviews

3.4/5

Rating in categories

3.4

Skill development

3.4

Work-life balance

3.8

Salary

3.5

Job security

3.6

Company culture

3.6

Promotions

3.3

Work satisfaction

Explore 12 Reviews and Ratings
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.4 L/yr

Officer
2.9k salaries
unlock blur

₹10.6 L/yr - ₹35.9 L/yr

Vice President
2.6k salaries
unlock blur

₹21 L/yr - ₹72 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