SDE - 1

Ninja loves playing with numbers. So one day, he wants to arrange a few numbers in the ‘N’ number of rows. The first row contains 1 number, the second row has two numbers, the third row ha...

You have been given a binary tree of integers with N number of nodes. Your task is to check if that input tree is a BST (Binary Search Tree) or not.

You are given an array of distinct elements, and you have to rearrange the array elements in a zig-zag fashion. In other words, for every odd posi...

You are given a linked list containing 'n' 'head' nodes, where every node in the linked list contains two pointers:

(1) ‘ne...

You are given a 2-dimensional array/list having N rows and M columns, which is filled with ones(1) and zeroes(0). 1 signifies land, and 0 signifies water.