CRED Backend Developer Interview Questions and Answers for Experienced

There was a coding question of string level was Easy to Medium and we can also expect SQL query in this

Q1. Design Book My Show
Add your answer
Q2. Project Discussion
Add your answer

Q1. I Expected the HLD in this but for freshers there is no HLD only DSA, that was N- Queen Problem
Add your answer
Q2. Project Discussion that's it
Add your answer

Q1. Basic HR Questions
Add your answer
Q2. It's easy round
Add your answer

Hackerearth Coding Test

Q1. Technical Round with Senior Software Engineer around Java, DSA and APIs
Add your answer
Q2. 1. Check Valid Parenthesis, 2. Given a problem design your own API and suitable URL for it Discussions about implementation and designing of the above two questions
Add your answer

Q1. One-on-one round with Project manager
Add your answer
Q2. Architecture and System design round, but interviewer given me Java Coding , some basic question and asked some questions on SQL then in the middle of the interview he told that we are not going forward wi...read more
Add your answer

They have problem of K sorted array and you need to make an sorted array of it.

Q1. Your current job role
Add your answer
Q2. Software Developer
Add your answer

Q1. Basic questions on data structures
Add your answer

Q1. Second round was Managerial Round. The interviewer basically had a conversation with me and asked some hr questions also.
Add your answer

Q1. Basic HR questions
Add your answer

It was simple program of url shorting for registered and non registered users each request must have unique shortened url.

Q1. Palindrome implementation and run time
Ans. 
A palindrome is a word or phrase that reads the same backward as forward. Implementing it involves comparing the first and last characters and iterating towards the middle.
• Implement a function that takes a string as input and returns true if it is a palindrome, false otherwise.

• Use two pointers, one starting from the beginning and the other from the end, and compare the characters at each position.

• If the characters matc...read more
Answered by AI
Add your answer
Q2. DSA and various algorithms and run time
Add your answer

Q1. This round was one on one with VP of engineering. Basic q and a regarding role and responsibilities
Add your answer

Q1. Relocation, Reason For job change, future plan, careers objective
Add your answer

Q1. Find connected components in a graph
Ans. 
Use Depth First Search (DFS) to find connected components in a graph
• Start by initializing all vertices as unvisited

• Iterate through each vertex and perform DFS to find connected components

• Keep track of visited vertices to avoid revisiting

• Example: For a graph with vertices {A, B, C} and edges {(A, B), (B, C)}, the connected components are {A, B, C}
Answered by AI
Add your answer

Q1. Design chess game
Ans. 
Design a chess game with proper board setup, piece movements, and win conditions.
• Create a 8x8 grid to represent the chess board

• Assign initial positions to each type of chess piece (pawn, rook, knight, bishop, queen, king)

• Implement rules for each piece's movement (e.g. pawn moves forward, rook moves horizontally/vertically)

• Check for valid moves and capture opponent's pieces

• Implement win conditions (checkmate, stalemate)

• ...read more
Answered by AI
Add your answer

Easy coding questions DSA

Q1. Reverse a linked list
Ans. 
Reverse a linked list by changing the pointers direction
• Start with three pointers: current, previous, and next

• Iterate through the linked list, updating the pointers to reverse the direction

• Update the head pointer to point to the new first node
Answered by AI
Add your answer
Q2. Find middle of linked list
Ans. 
To find the middle of a linked list, use the slow and fast pointer technique.
• Initialize two pointers, slow and fast, both pointing to the head of the linked list.

• Move slow pointer by one step and fast pointer by two steps until fast reaches the end of the list.

• The position of the slow pointer will be the middle of the linked list.
Answered by AI
Add your answer

Q1. Pick from a basket of oranges
Ans. 
The question is asking to pick an orange from a basket.
• Carefully select a ripe orange without any bruises or blemishes

• Gently twist the orange off the stem to avoid damaging the fruit

• Check for firmness and weight to determine ripeness
Answered by AI
Add your answer

Min and max value from an array of integers, reverse of a string

Q1. Data Structures, Algorithms, Understand Common Problem Patterns,
Add your answer
Q2. Advance Laravel and PHP
Add your answer