FICO Software Engineer Interview Questions, Process, and Tips

It was an online non proctored assessment having aptitude mcq and 3 coding quss , process was non proctored

Group discussion for test shortlisted

After this pan paper system design based qus

Q1. Ask me a question that i know the answer but i cant tell you right now
Add your answer
Q2. Ask me a question that i dont know the answer
Add your answer
Q3. PROJECT QUESTIONS
Add your answer

Q1. Tell me about yourself
Ans. 
I am a passionate software engineer with experience in developing 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 Docker

• Strong problem-solving skills and ability
Answered by AI
Add your answer
Q2. Can you join us in Banglore
Ans. 
Yes, I am open to relocating to Bangalore for the Software Engineer position.
• I am open to relocating for the right opportunity

• I am excited about the prospect of working in Bangalore

• I have experience working in different locations
Answered by AI
Add your answer

Duration - 1hr
Topic - String, Number, Array
Platform - Their own

Q1. Opps, Java concepts
Add your answer
Q2. Why is string immutable in java?
Ans. 
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.
Answered by AI
Add your answer

Q1. General Questions
Add your answer

Q1. Sort array containing 0s, 1s and 2s
Ans. 
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).
Answered by AI
Add your answer
Q2. Spiral order traversal of BST.
Ans. 
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
Answered by AI
View 1 more answer