Cleartrip Software Developer Interview Questions and Answers

Q1. 2 code and 2 MySQL query
Add your answer

2 Graph question of leetcode

Q1. DSA Questions of leetcode
Add your answer
Q2. DSA Questions
Add your answer

Basic aptitude with tracing program

3 problem with easy to hard

I haven't appeared but this website asking me everytime that's why giving review but I wanted to know what are the ratings for this company

Q1. I haven't appeared but ratings it
Add your answer
Q2. Why you choose uplers
Add your answer

Q1. Launch modes on android
Ans. 
Launch modes on Android determine how a new instance of an activity is associated with the current task.
• Standard: Creates a new instance of the activity in the task's stack

• SingleTop: If an instance of the activity already exists at the top of the stack, it will not be recreated

• SingleTask: Activity is always at the root of the task and no other activities can be on top of it

• SingleInstance: Similar to SingleTask, but the
Answered by AI
Add your answer

Questios based on Activity backstacks

Techstack knowledge of Scala, Kafka etc

Round duration - 90 minutes
Round difficulty - Medium

The online round was conducted on Hackerearth around 11:30 PM 
This round was an online coding plus MCQ round which includes 15 MCQ with positive 4 and negative 1 and 3 coding questions with two questions 10 marks and one was of 20 marks . MCQ were easy to medium and covers all the topic of Networks OOPS DBMS and CPP/JAVA 
In Coding section one 20 marks question was medium and two 10 marks were of easy level, like if you practice regularly you can crack two 10 marks means you can score 20 marks out of 40 in coding

Q1. 
Reach the Destination Problem Statement
You are given a source point (sx, sy) and a destination point (dx, dy). Determine if it is possible to reach the destination point using only the following valid mo...read more
Ans. Brute force approach
The naive approach to solve this problem is to consider each and every possible move until we reach the destination.
 
This can be done using recursion. Below is the algorithm:
 
• Check for the bases:
  • If the source and destination coordinates are the same, return true.
  • Return false, if the x (or y) coordinate of source point is greater than the x (or y) coordinate of the destination point. As the...read more
Answered Anonymously
Add your answer
Q2. 
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...read more
Ans. Recursion
 
1. The idea is to use recursion.
2. For a particular coin, we have two options either include it or exclude it.
3. If we include that coin, then calculate the remaining number that we have to generate so recur for that remaining number.
4. If we exclude that coin, then recur for the same amount that we have to make.
5. Our final answer would be the total number of ways either by including or excluding.
6. There will be two edg...read more
Answered Anonymously
Add your answer
Q3. 
Min Jumps Problem Statement
In Ninja town, represented as an N * M grid, people travel by jumping over buildings in the grid's cells. Santa is starting at cell (0, 0) and must deliver gifts to cell (N-1, ...read more
Ans. Recursive
1. Since we want to try all the possible combinations and then find the answer, recursion is a good way to do it.
2. Let the name of the given matrix be ARR[][] where ARR[X][Y] denotes the height of the building at coordinates X, Y.
3. Let us suppose that we have a recursive function findMinCost() which takes X, Y as the input and returns the minimum cost to reach from start to end.
4. Now at every step, we have 3 options, t...read more
Answered Anonymously
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

It was a technical interview which was scheduled on 16th October 2020 at 10:00 AM 
This round mainly focus on your DSA, DBMS , OS Networking and coding skills like how optimised you can write code 
This round was conducted on Zoom 
Their were 2 interviewers and both of them were very calm and supportive

Q1. 
Pythagorean Triplets Detection
Determine if an array contains a Pythagorean triplet by checking whether there are three integers x, y, and z such that x² + y² = z² within the array.
Input:
The first lin...read more
Ans. Brute Force
• One simple naive solution is to try every possible triplet present in the array as a candidate for the pythagorean triplet.
• So, we simply run three nested loops, and pick three integers and check if they follow the property given in the problem statement( i.e for three integers a,b and c a^2 b^2 = c^2).
• If we find any required triplet, we return true. Otherwise, if we can't find any valid triplet, we return fa...read more
Answered Anonymously
Add your answer
Q2. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. Outer And Inner Loop
We are going to have two loops outer-loop and inner-loop 
1. Maintain a count of the number of nodes visited in outer-loop.
2. For every node of the outer-loop, start the inner loop from head.
3. If the inner-loop visits the node next to the outer-loop node, then return true, else repeat the process for the next iteration of outer-loop.
4. If outer-loop reaches the end of list or null, then return false.
Space ...read more
Answered Anonymously
Add your answer

Round duration - 10 minutes
Round difficulty - Easy

This was the HR round conducted online through ZOOM on 16th October 2020 around 4:00 PM
There were two interviewers and both were quite good and frank 
This round mainly focus on basic resume questions and about yourself