Iterative In-Order Traversal
Problem Return the values of a binary tree using in-order traversal, iteratively. Input node: Has 3 properties .val: Integer value of the node .left: A pointer »
Buy and Sell Two Stocks
Problem Given an array of integers representing stock prices, with each index representing a different day, find the maximum profit by selling at most two stocks. »
Rotate a 2D Matrix
var jsav = new JSAV("set"); jsav.label("Before rotation").css({"color": "gray"}); var m = jsav.ds.matrix([[0, 1, 2], [3, 4, 5], [6, 7, 8] »
Symmetry in a Tree
var jsav = new JSAV("av-sym"); jsav.label("Symmetric tree"); var bt = jsav.ds.binarytree(); bt.root("5"); // set the value of the root bt.root().left( »
Primes
Let's discuss primes! A natural number is considered a prime if it is: Greater than 1 Its divisors are only 1 and itself Examples: \(5\) has »