Two numbers given as input and we have to print greatest common divisor. Euclid's algorithm used for better time complexity.
We will consider the problem to find the N-th Fibonacci number and solve it through recursion and then by using dynamic programming in two different ways(Memoization and Tabulation)
We will make a web page using basic Html and CSS. Used javascript in the backend for our game to work. Very basic and simple code to understand(not available on the internet)
We will be given a binary tree as an input and its root node, than we should examine whether it is a binary search tree (BST) or not in the C ++ programming language.