freeCookie


freeCookie_🍪

HTML, CSS, and Javascript for Web Developers Week4

Javascript Basics 早该写没有写笔记,为了避免忘记了学过什么还是写一下笔记好了_(:з」∠)_其实我已经忘了(._.) Variables is always start with ‘var’ var msg = "hi"; Dynamically typed lan...

Leetcode - Populating Next Right Pointers in Each Node

LC116, LC117

LC116. Populating Next Right Pointers in Each Node Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *ri...

LC99. Recover Binary Search Tree

Recursion VS. Morris traversal

LC99. Recover Binary Search Tree Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structu...

LC333. Largest BST Subtree

LC333. Largest BST Subtree Given a binary tree, find the largest subtree which is a Binary Search Tree (BST), where largest means subtree with lar...

LC250. Count Univalue Subtrees

LC250. Count Univalue Subtrees Given a binary tree, count the number of uni-value subtrees. A Uni-value subtree means all nodes of the subtree ha...

LC145. Binary Tree Postorder Traversal

LC145. Binary Tree Postorder Traversal Given a binary tree, return the postorder traversal of its nodes’ values. For example: Given binary tree {...

LC124. Binary Tree Maximum Path Sum

Binary Tree problems

LC124. Binary Tree Maximum Path Sum Given a binary tree, find the maximum path sum. For this problem, a path is defined as any sequence of nodes ...

Leetcode - Arithmetic Slices

LC413, LC446

LC413. Arithmetic Slices A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two...