C2L BIZ Full Stack Developer Interview Questions and Answers

Amazon pay customer service cnt number

Customer care number..

Q1. Calling" Amazon 091-53-56-47-89- Customer Care number to receive email from trustpilot about your reviews, inspection, tips about businesses and product, ...Calling" Amazon 09153.564.789 .Customer Care num...read more
Add your answer
Q2. Amazon pay customer care number
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

11:05am – 12:05pm (IST). What are classes in javascript? how do you integrate js in html.

Q1. Longest Substring Without Repeating Characters
Given a string 'S' of length 'L', return the length of the longest substring without repeating characters.
Example:
Suppose given input is ...read more
Ans. Brute Force
In the brute force approach, we will use two nested loops. The outer loop is used to select the starting index of the substring and the inner loop is used to fix the ending index of the substring. After selecting the substring, we will use another loop (or a method) to check whether the substring contains all unique characters or not using a HashSet.
Space Complexity: O(n)Explanation:
O(L), where L is the len...read more
Answered Anonymously
Add your answer
Q2. Print Nodes at Distance K From a Given Node
You are given an arbitrary binary tree, a node of the tree, and an integer 'K'. You need to find all such nodes which have a distance K from the given no...read more
Ans. DFS
• Create a map to store the parent of each node in the tree, Traverse the tree recursively (via depth-first search), at each step if the current node is not NULL. Store its parent in the map, then traverse the left and right subtree.
• Now assume that the given node is the root of the tree. In such a case, we can simply run a breadth-first search from the root, and track the current level of the tree. When the level = ‘K...read more
Answered Anonymously
Add your answer
Q3. Number of Islands
You have been given a non-empty grid consisting of only 0s and 1s. You have to find the number of islands in the given grid.
An island is a group of 1s (representing land) connected hor...read more
Ans. DFS
The problem boils down to find the number of connected components in the grid. 
 
If we are on a land cell and explore every cell connected to it 8-directionally (and recursively cells connected to those cells, and so on), then the total number of cells with land explored will be one island.
 
To ensure we don't count cells in the island more than once, we will mark 1(land) as 0 during the recursion call...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

12:30pm – 1:30pm (IST). SQL questions What are Aggregate and Scalar functions? What is a Stored Procedure?

Q1. Next Greater Element
For a given array/list of integers of size N, print the Next Greater Element(NGE) for every element. The Next Greater Element for an element X is the first element on the right side of...read more
Ans. Brute Force
For every element in the array, we will run a loop on its right side. As soon as we find an element on its right side which is greater than it, we will break the loop, assign it as the NGE of this element, move forward, and do the same for the next element.
Space Complexity: O(1)Explanation:
O(1)
 
No extra space is used.
Time Complexity: O(n^2)Explanation:
O(N ^ 2),  Where N is the number of elements ...read more
Answered Anonymously
Add your answer
Q2. Container With Most Water
Given a sequence of ‘N’ space-separated non-negative integers A[1],A[2],A[3],......A[i]…...A[n]. Where each number of the sequence represents the height of the line drawn at poin...read more
Ans. Brute Force Approach
Since we need to find the container with most water, let us try to find all possible containers and choose the one which has the maximum area.
So how can we find the area of all possible containers?
We can, for each line with the position ‘i’ find another line ‘j’ such that ‘j’ > ‘i’ and find the amount of water contained i.e (‘j’-’i’)*min('A[i]', ‘A[j]’) where ‘A[i]’ and ‘A[j]’ represents the heig...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

5pm – 6pm (IST)

Q1. It was lld question to design a cab booking system.
Add your answer
Q2. Tell me about yourself
Add your answer

Q1. Maximum Sum Subarray
Add your answer
Q2. Insert node in binary search tree
Ans. 
To insert a node in a binary search tree, compare the value of the node to be inserted with the current node and traverse left or right accordingly.
• Start at the root node and compare the value of the node to be inserted with the current node.

• If the value is less than the current node, move to the left child node. If it is greater, move to the right child node.

• Repeat this process until reaching a leaf node, then insert ...read more
Answered by AI
Add your answer

DSA + JAVA + Spring boot

LLD (bookmyshow) + DSA

Q1. Implement an immutable class.
Ans. 
An immutable class is a class whose instances cannot be modified after creation.
• Use final keyword for class declaration to prevent inheritance

• Make all fields private and final to prevent modification

• Do not provide setter methods, only getter methods should be used
Answered by AI
Add your answer
Q2. Implement a springboot service that intercepts http requests.
Ans. 
Implement a Springboot service to intercept HTTP requests.
• Create a Springboot application with necessary dependencies.

• Implement a custom interceptor by extending HandlerInterceptorAdapter.

• Override preHandle and postHandle methods to intercept requests and responses.

• Register the interceptor in the WebMvcConfigurerAdapter configuration class.
Answered by AI
Add your answer