In this post, I will put all iterative solution of traversals (preorder, inorder, postorder) together for better understanding.

Leetcode No.94 Binary Tree Inorder Traversal
Leetcode No.144 Binary Tree Preorder Traversal
Leetcode No.145 Binary Tree Postorder Traversal
Continue reading

Problem Description:

Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area.

Problem description:

Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.

You have the following 3 operations permitted on a word:
Insert a character
Delete a character
Replace a character

Problem description:

Given a 2D binary matrix filled with 0’s and 1’s, find the largest rectangle containing only 1’s and return its area.
Continue reading