Roger's Head: Big O! Big O! Big O! Big O! Big O! Big O! Big O! Big O! Big O! Big O! ... ... ... Big O notation is a simplified analysis on an algorithm's performance as the input size changes. A better quick cheat on what the complexity on some algorithms can be referred from BigO Cheat Sheet . Type of Complexity Time Space O(1) Constant Time In simple terms: As the input size changes, t..

I can be honest initially matrix, or any form of 2d problems seems very complicated for me usually. Trust me this question seems like ROCK CLIMB to me at first. After getting through explanation of how to tackle this question,IT SEEMS WAYYYYYYY easier than it actually looks. Leetcode Question explanation [`Write a program to solve a Sudoku puzzle by filling the empty cells. A sudoku solution mus..

102-Binary-Tree-Level-Order-Traversal binary-tree-level-order-traversal A breakdown to my understanding of how to traverse a binary search tree level orderly. What is Call Stack? In most ubiquitous way of solving binary trees it is either traversing Inorder(Left Root, Right) preOrderly ((Root, Left, Right) ) and PostOrderly((Left, Right, Root). In this case we want to traverse in the level order..

This arguement is the same as the largest Rectangle in a histogram. " Benjamin Franklin Young Man’s Best Companion, in which Franklin wrote, "Remember that time is money."[1]" This questions is simple requesting us to find the largest area in histogram with continues heights. arr = [8, 2, 6, 9, 7, 2] consider his arrays as the heights of the histogram: > if we traverse from left to right ->>> in..