Filter interviews by
Seeking new challenges and opportunities for growth
Looking to expand my skill set and knowledge in a new environment
Interested in taking on more responsibilities and leadership roles
Seeking a fresh perspective and new challenges to keep me motivated
Want to explore different industries and sectors to broaden my experience
I applied via Recruitment Consulltant and was interviewed in Mar 2023. There were 4 interview rounds.
Coding test includes 2 program and mcq
What people are saying about Citicorp
I applied via Naukri.com and was interviewed before May 2023. There were 3 interview rounds.
Various Spark optimization techniques include partitioning, caching, and tuning resource allocation.
Partitioning data to distribute workload evenly
Caching frequently accessed data in memory
Tuning resource allocation for optimal performance
Citicorp interview questions for designations
I applied via Naukri.com and was interviewed before Aug 2022. There were 2 interview rounds.
I applied via LinkedIn and was interviewed before Jun 2023. There were 2 interview rounds.
I appeared for an interview before Oct 2021.
I applied via Naukri.com and was interviewed before Jun 2020. There were 4 interview rounds.
Other approaches to the same job could include automation, outsourcing, or reorganizing the team.
Automation: Implementing technology to streamline processes and reduce manual labor.
Outsourcing: Hiring a third-party company to handle certain tasks or responsibilities.
Reorganizing the team: Restructuring roles and responsibilities to optimize efficiency and productivity.
Example: Automating inventory management to reduce ...
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.
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
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.
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.
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
based on 6 interviews
2 Interview rounds
based on 21 reviews
Rating in categories
Assistant Vice President
4.8k
salaries
| ₹17 L/yr - ₹48.5 L/yr |
Assistant Manager
3.4k
salaries
| ₹6.2 L/yr - ₹21 L/yr |
Officer
2.9k
salaries
| ₹10.7 L/yr - ₹35.9 L/yr |
Vice President
2.6k
salaries
| ₹24 L/yr - ₹70.8 L/yr |
Manager
2.3k
salaries
| ₹9.7 L/yr - ₹39 L/yr |
Wells Fargo
JPMorgan Chase & Co.
HSBC Group
Cholamandalam Investment & Finance