FCI CCM Associate Software Developer Interview Questions and Answers

Java internals, coding questions 2sum

Q1. Hld of your previous project
Ans. 
Developed a web-based project management tool for tracking tasks and deadlines.
• Used React.js for front-end development

• Implemented RESTful APIs for backend using Node.js and Express

• Utilized MongoDB for database storage

• Incorporated authentication and authorization features for user security
Answered by AI
Add your answer
Q2. Question related to self build projects
Add your answer

Q1. Salary negotiation
Add your answer
Q2. Location constrain if any
Ans. 
Open to relocation for the right opportunity
• Willing to relocate for the right job opportunity

• Flexible with location for the right role

• Open to considering different locations for the right position
Answered by AI
Add your answer

Three coding problems were asked one was to print frequency of each character in a string, second was also similar to this problem unable to recall it and third problem was given an array of string and range from L to R find the nth character if all strings from L to R is concatenated and sorted. Apart from these three coding problems there were 10 easy MCQ's.

Q1. Basic questions on java and spring boot, annotations, oops concept.
Add your answer
Q2. Code LRU cache(with no updates), just to implement push and pop operation with given window size of 4.
Add your answer

Q1. It was a design round where I was asked to write class models of a in memory session management system without using tools like redis.
Add your answer

Q1. They asked to design a database table
Add your answer

Q1. Move negative elements to right side of array
Ans. 
Move negative elements to right side of array
• Iterate through the array and swap negative elements to the right side

• Use two pointers approach to keep track of positive and negative elements

• Maintain the order of elements while moving negatives to the right side
Answered by AI
Add your answer

Medium to hard questions based on arrays, dp

Q1. Quick sort algorithm
Ans. 
Quick sort is a popular sorting algorithm that uses divide and conquer strategy.
• Divides array into smaller sub-arrays based on a pivot element

• Recursively sorts sub-arrays

• Combines sorted sub-arrays to get final sorted array

• Time complexity: O(n log n) on average, O(n^2) worst case

• Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]
Answered by AI
Add your answer
Q2. Modified rotate a matrix
Ans. 
Rotate a matrix by 90 degrees in place
• Transpose the matrix

• Reverse each row of the transposed matrix
Answered by AI
Add your answer

Q1. They simply ask what you are doing
Add your answer
Q2. How much you used skill in current project
Ans. 
I utilized my skills extensively in the current project, contributing to its success.
• I applied my knowledge of programming languages such as Java and Python to develop new features.

• I used my problem-solving skills to troubleshoot and resolve technical issues efficiently.

• I leveraged my experience with database management to optimize data storage and retrieval processes.
Answered by AI
Add your answer

Q1. Anything they ask even very old versions
Add your answer

Q1. Where u from and check attitude
Ans. 
I am from XYZ city. My attitude is positive and professional.
• I am from XYZ city

• My attitude is positive and professional
Answered by AI
Add your answer
Q2. Can you join immediately
Ans. 
Yes, I can join immediately.
• Yes, I am available to start right away.

• I have no prior commitments that would prevent me from starting immediately.

• I am excited about the opportunity and ready to hit the ground running.
Answered by AI
Add your answer

Q1. Questions on OOPS, Core Concepts of C#, SQL
Add your answer

Q1. Questions on System Design and tricky questions on OOPS
Add your answer

Q1. Previous organization work culture and expectations
Add your answer

It started with basic introduction, than move ahead with Java, Spring boot question in the end, he asked one leetcode medium question based on DP . Ques : Find a minimum number of jumps required to reach the end of the array, and each index , it can jump arr[index] time at max, you need to calculate minimum number of steps required to reach at the end.