Posts

automation tool for Devops

VM vs docker

Linux can help you understand digital world better after you understading it

main functionalities

two pointers implementation and when to use a dummy node

think about it before git commit

to calculate the result of a basic arithmetic expression represented as a string. It uses a stack to handle the operations and correctly respects operator precedence

The term client has a wider scope and can refer to different things depending on the context

In this learning note, I want to delved into the critical aspects of recursion, specifically focusing on how to manage return values and state within recursive functions. Using the example of finding the k-th smallest element in a Binary Search Tree (BST)

Best practices and good tips

Can be particularly useful for rendering hierarchical data structures like trees.

One day maybe save your life

using different way to great a grid layout

you are your own worst critic

Key points for review

React Router enables client side routing

node built-in modules and related framework

Disjoint Set Union is also called Union Find because of its two operations - union and find.

A topological order (or topological sorting) of a directed graph is a linear ordering

design a LRU

merge and insert intervals are two kind of classic aglo problems

this is kind of classic aglo problems

this is kind of a classic dp problems

add valid function to prun

use different ways

linked list

palindrome Substring and Subsequence

different kinds of dp

DFS and BFS

use set or array to mark used element

About some tips about useful hook

Best time to buy and sell stock

use dfs with memo and dp table

prefix Sum VS sliding widows

make use of map,set and stack

can convert O(n**2) to O(n)

using array method on string

mark visited node is important

dfs pay more atttention on visited node

Using five steps to get it

BFS may be the best way

more details about the method

basic and conditonal problems

minheap and maxheap

How to learn md quickly

Implement a Minheap

Implement a Minheap

Combination Sum

Backtracking with memo

Backtracking with additional states

DFS-Serialize and Deserialize

DFS-divide and conquer(return value) vs fire and go(global varible)

two pointers in string

two pointers in sorted array

two pointers in sorted array

only can ben used in sorted array

base on bubble sorting in array

use map,set,array to solve hash problems

Height Algorithms

some details about border in tailwindCss

Tailwind includes modifiers to deal with pseudo