Crif Solutions Software Developer Interview Questions and Answers

Q1. Basic oops, .net, c# coding, sql questions
Add your answer

Q1. More coding and details on project
Add your answer

Q1. More on projects and system design and troubleshooting approach
Add your answer

Q1. Salary discussion
Add your answer

Q1. More technical + managerial round even after HR round
Add your answer

One medium and one standard DP question

Q1. Medium level question based on binary search
Add your answer

Q1. Design google-pay
Ans. 
Design Google Pay - a digital wallet platform for online payments and transactions.
• Allow users to securely store payment information such as credit/debit cards, bank accounts, and loyalty cards.

• Enable users to make payments in stores, online, and within apps using their stored payment methods.

• Implement security features like biometric authentication, tokenization, and encryption to protect user data.

• Provide features fo...read more
Answered by AI
Add your answer
Q2. HLD of recursive
Ans. 
High Level Design (HLD) of recursive functions in software development.
• Recursive functions call themselves to solve smaller instances of the same problem.

• HLD of recursive functions involves defining the base case, recursive case, and termination condition.

• Example: HLD of a recursive function to calculate factorial of a number involves defining base case as factorial(0) = 1.
Answered by AI
Add your answer

Q1. Puzzles available on GFG
Add your answer
Q2. Behavioral question
Add your answer

Maths and communication based questions

Estimate and SQL and coding was there

Time ,speed ,distance

Java application using oops concept

Q1. Inheritance , oops
Add your answer

Q1. Tell me about urself
Add your answer

Q1. Array basics, java basics oops and all
Add your answer

There is some aptitude questions along with some subject question(C++,DBMS,OS). And also there is one easy/medium coding question

Q1. Interview involves subjects(OS,DBMS,CN,OOPs) , project related questions, and also easy questions from DSA.
Add your answer

Q1. It was an easy round HR asked me about intoduction,will you be able to relocate,.... Overall it is an easy round.
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

It was on hackerearth platform and duration was 60 mins.

Q1. 
Maximum Path Sum in a Matrix
Given an N*M matrix filled with integer numbers, determine the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row...read more
Ans. 
We are given a matrix of N * M. To find max path sum first we have to find max value in first row of matrix. Store this value in res. Now for every element in matrix update element with max value which can be included in max path. If the value is greater then res then update res. In last return res which consists of max path sum value.
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Only problem solving was asked simple DSA based questions

Q1. 
Valid Parentheses Problem Statement
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
Input:
The first line contains an...read more
Ans. 
Declare a character stack S.
Now traverse the expression string exp. 
If the current character is a starting bracket (‘(‘ or ‘{‘ or ‘[‘) then push it to stack.
If the current character is a closing bracket (‘)’ or ‘}’ or ‘]’) then pop from stack and if the popped character is the matching starting bracket then fine else brackets are not balanced.
After complete traversal, if there is some starting bracket left in stac
Answered Anonymously
Add your answer

Round duration - 60 mins
Round difficulty - Easy

Problem solving and DSA

Q1. 
Find All Pairs Adding Up to Target
Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.
Input:
The first line ...read more
Ans. 
This problem can be solved efficiently by using the technique of hashing. Use a hash_map to check for the current array value x(let), if there exists a value target_sum-x which on adding to the former gives target_sum. This can be done in constant time.
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was hiring manager round and it was mostly behavioural round

Map question with frequency in a vector

Q1. Discussion on the test plus a logical puzzle also
Add your answer