Filter interviews by
I applied via Naukri.com and was interviewed in Jul 2022. There were 4 interview rounds.
I applied via Approached by Company
Python test on CodeSignal
I applied via Campus Placement and was interviewed before Apr 2023. There were 3 interview rounds.
Duration - 1hr
Topic - String, Number, Array
Platform - Their own
String is immutable in Java to ensure security, thread safety, and optimization.
Immutable strings are thread-safe as they cannot be modified concurrently by multiple threads.
String pooling allows Java to optimize memory usage by reusing common string literals.
Immutable strings prevent security vulnerabilities like SQL injection attacks.
I applied via Campus Placement and was interviewed in Feb 2022. There were 2 interview rounds.
1 Hour, Basic Java, Array, DSA Questions
Binary search on a linked list involves dividing the list into halves and searching for the target value.
Linked list must be sorted before binary search can be performed.
Binary search on linked list has a time complexity of O(log n).
The middle element of the linked list is found using slow and fast pointers.
If the target value is less than the middle element, search the left half of the list. If it's greater, search th...
A palindrome string is a string that reads the same backward as forward. Efficient methods include using two pointers and reversing the string.
Use two pointers, one starting from the beginning and the other from the end, and compare the characters at each position until they meet in the middle.
Reverse the string and compare it to the original string. If they are the same, it is a palindrome.
Use recursion to check if th...
FICO interview questions for popular designations
I applied via Campus Placement and was interviewed in Apr 2022. There was 1 interview round.
Sort an array of 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of the positions of 0s, 1s, and 2s.
Traverse the array and swap elements to their respective positions.
Time complexity: O(n), Space complexity: O(1).
Spiral order traversal of BST
Use two stacks to traverse the tree in a spiral order
Push the root node into the first stack
While the first stack is not empty, pop a node and print its value
Push its left and right children into the second stack
Once the first stack is empty, swap the stacks and repeat the process
Continue until both stacks are empty
Get interview-ready with Top FICO Interview Questions
I applied via Campus Placement and was interviewed before Sep 2022. There were 3 interview rounds.
Java-based DSA questions
I applied via Referral and was interviewed in Dec 2021. There were 3 interview rounds.
I applied via Approached by Company and was interviewed in Sep 2021. There were 4 interview rounds.
DS Algo
I was interviewed in Nov 2020.
Round duration - 60 minutes
Round difficulty - Medium
1)Aptitude
2)Java (Questions from Maps, Collections, Arrays class)
3)2 Coding Questions
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.
If the two pointers meet at any point, it indicates the presence of a cycle in the linked list.
If one of the pointers reaches the end of the list (null), it means there is no cycle.
Round duration - 150 Minutes
Round difficulty - Easy
Multiple technical questions were asked
Round duration - 10 minutes
Round difficulty - Easy
Tip 1 : Prepare you CV well with projects well explained .
Tip 2 : Prepare DSA and programming well because interviewer can ask in technical round.
Tip 3 : Prepare Core subjects like OS, DBMS, CN .
Tip 1 : Do not put false things on a resume, in-depth of knowledge of everything there on the resume
Tip 2 : Focus on your projects
I applied via Campus Placement and was interviewed in Jan 2021. There were 4 interview rounds.
Hashmap is a key-value pair data structure while Hashset is a set of unique values.
Hashmap allows duplicate values but not duplicate keys.
Hashset does not allow duplicate values.
Hashmap is implemented using a combination of hash table and linked list.
Hashset is implemented using only a hash table.
Example of Hashmap: {1:'one', 2:'two', 3:'three'}
Example of Hashset: {'apple', 'banana', 'orange'}
ArrayList is a resizable array while HashMap is a key-value pair data structure.
ArrayList is ordered and allows duplicates while HashMap is unordered and does not allow duplicate keys.
ArrayList is accessed by index while HashMap is accessed by key.
ArrayList is suitable for storing and accessing elements sequentially while HashMap is suitable for fast lookup of values by key.
Example: ArrayList - List
Abstract class is a class that cannot be instantiated, while an interface is a contract that a class must implement.
Abstract classes can have implemented methods, while interfaces cannot
A class can implement multiple interfaces, but can only inherit from one abstract class
Interfaces are used for achieving multiple inheritance in Java
Abstract classes are used for creating a base class for other classes to inherit from
Ex...
Top trending discussions
The duration of FICO interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 28 interviews
Interview experience
Software Engineer
89
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Engineer
70
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer Level 1
53
salaries
| ₹0 L/yr - ₹0 L/yr |
Devops Engineer
49
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Consultant
40
salaries
| ₹0 L/yr - ₹0 L/yr |
Experian
TransUnion
Equifax
Crif High Mark Credit Information Services