21. Describe divide and conquer paradigm. When a problem is solved using a divide and conquer algorithm, it is subdivided into one or more subproblems which are all similar to the original problem in such a way that each of…

11. How to find median of a BST? Find the no. of elements on the left side. If it is n-1 the root is the median. If it is more than n-1, then it has already been found in the…

1. Define the concept of an algorithm. An algorithm is any well-defined computational procedure that takes some value (or set of values) as input and produces some value (or set of values) as output. In short, it can be seen…

## Algorithm Technical Interview Questions and Answers For Freshers Part-3

21. Describe divide and conquer paradigm. When a problem is solved using a divide and conquer algorithm, it is subdivided into one or more subproblems which are all similar to the original problem in such a way that each of…

## Algorithm Technical Interview Questions and Answers For Freshers Part-2

11. How to find median of a BST? Find the no. of elements on the left side. If it is n-1 the root is the median. If it is more than n-1, then it has already been found in the…

## Algorithm Technical Interview Questions and Answers For Freshers Part-1

1. Define the concept of an algorithm. An algorithm is any well-defined computational procedure that takes some value (or set of values) as input and produces some value (or set of values) as output. In short, it can be seen…

## Algorithm Interview Questions and Answers For Freshers Part-3

21. Describe divide and conquer paradigm. When a problem is solved using a divide and conquer algorithm, it is subdivided into one or more subproblems which are all similar to the original problem in such a way that each of…