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 Continue Reading »
Home / Interview Questions and Answers / Technical Interview Questions and Answers / Archive by Category "Algorithm"
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 Continue Reading »
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 Continue Reading »
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 Continue Reading »
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 Continue Reading »
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 Continue Reading »
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 Continue Reading »
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 Continue Reading »
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 Continue Reading »