SDE - 1

You have been given a Binary Search Tree of 'N' nodes, where exactly two nodes of the same tree were swapped by mistake.

Your task is to restore or fix the BST, without changing its structure and return the root of the corrected BST.

Note:

Given BST will not contain duplicates.

Example

A Binary Search Tree (BST) whose 2 nodes have been swapped is shown below.  

After swapping the incorrect nodes: 

Follow Up

Can you do this without using any extra space? 

There is an array 'JUMP' of size 'N' which is 1-indexed and you are currently at index 1. Your goal is to reach index 'N' (end).

When you are at index 'i', you can jump a maximum length of 'JUMP[i]' which means you can make a jump of size 1 to JUMP[i]. Return true if you can reach the end otherwise false.

Example:-

N = 5
JUMP = [1,2,3,4,5]

ANSWER:- The answer should be YES as you can jump from 1st index to 2nd index, from 2nd index to 4th index, and from 4th index to 5th index.

You were given the variables : 
Total money 
Price of a chocolate 
number of wrappers to be returned for an extra chocolate 

and then maximize it.

First a verbal answer then a pseudo code and then code it in the desired language.

Had to guess the number of traffic lights in the city of Chandigarh since it's based on a grid pattern, and tell them the approach towards it .

You are given a Singly Linked List of integers. You need to reverse the Linked List by changing the links between nodes.

Note :

You do not need to print anything, just return the head of the reversed linked list. 

You have been given a Binary Tree of 'n' nodes, where the nodes have integer values. Your task is to return the In-Order traversal of the given binary tree.

For example :

For the given binary tree:

The Inorder traversal will be [5, 3, 2, 1, 7, 4, 6].

You are 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 Target.

Note:

We cannot use the element at a given index twice.

Follow Up:

Try to do this problem in O(N) time complexity. 

You are given heights, a 2D array of size 'rows' x 'columns', where heights[row][col] represents the height of a cell (which would contain a row and column).

You are a Ninja training for an upcoming battle. You are situated in the top-left cell, (0, 0), and you hope to travel to the bottom-right cell, (rows-1, columns-1) (i.e., 0-indexed).

You can move up, down, left, or right, and you wish to find a route that requires the minimum time. A route's time is the maximum absolute difference in heights between two consecutive cells of the route.

You must return the minimum time required to travel from the top-left cell to the bottom-right cell.

For Example:

Input: 'heights' = [[1, 8, 8],[3, 8, 9],[5,3,5]]
Output: 2

Explanation: The route of [1,3,5,3,5] has a maximum absolute difference of 2 in consecutive cells.

I was told to write sql queries for inner join and otuer join .

Explaing 1 Nf 2Nf

What is redis and what is it core functionalities since i had mentioned redis in my resume

Normal every day being what I like my hobbies and a pleasant chat was what happened in this round no serious questions was very laid back and more than a selection round it was a round to know you more