CRED Interview Questions, Process, and Tips

Q1. What’s your experience in collections
Ans. 
I have over 10 years of experience in collections, including managing a team and implementing successful strategies.
• Managed a team of collection agents to ensure targets were met

• Implemented new strategies to improve collection rates

• Utilized data analysis to identify trends and areas for improvement

• Negotiated payment plans with delinquent customers
Answered by AI
Add your answer
Q2. What’s your experience in team handling
Ans. 
I have over 5 years of experience in team handling, including leading a team of 15 collection agents.
• Led a team of 15 collection agents, providing guidance and support to ensure targets were met

• Implemented strategies to improve team performance and efficiency

• Conducted regular team meetings to address any issues and provide feedback

• Trained new team members on collection processes and best practices
Answered by AI
Add your answer

Q1. Difference between put and post
Ans. 
PUT is used to update or replace an existing resource, while POST is used to create a new resource.
• PUT is idempotent, meaning multiple identical requests will have the same effect as a single request.

• POST is not idempotent, meaning multiple identical requests may have different effects.

• PUT is used to update an existing resource at a specific URI.

• POST is used to create a new resource under a specific URI.
Answered by AI
Add your answer
Q2. Difference between authorization and authentication
Ans. 
Authentication verifies the identity of a user, while authorization determines what actions they are allowed to perform.
• Authentication confirms the user's identity through credentials like passwords or biometrics.

• Authorization determines the permissions and access levels granted to a user after authentication.

• Example: Logging into a system with a username and password is authentication, while being able to view/edit sp...read more
Answered by AI
Add your answer

Machine coding round.

Q1. Algorithm to calculate top k flight from source to destinaton.
Ans. 
Use Dijkstra's algorithm to find the top k shortest paths from source to destination.
• Implement Dijkstra's algorithm to find the shortest paths from source to all other nodes.

• Store the top k shortest paths found in a priority queue or heap.

• Return the top k shortest paths as the result.
Answered by AI
Add your answer

Machine coding round where SOLID principles are evaluated for real life use case