# Print m * n matrix diagonally

# Generate Random Tree Based on max integer

# Next greater element in an array

# Detect a loop in a linked list and how it works

# Find a peak element in an array

# Create a balanced Binary Search Tree (BST) from an array

# Lowest Common Ancestor

# Find all possible paths in matrix

This is to find all possible paths starting from left top corner of matrix to right bottom corner But we have constrain on this. You can only move Right or bottom and we also have blocking, Here blocking means 0 and path means 1. You can move to particular right or bottom if we have… Read more