My Learning Blog

Posts

Notebook in React

7/22/2024

Best practices and good tips

Recursive component in React

7/21/2024

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

Tricks in tailwindCss

7/18/2024

One day maybe save your life

Tailwinds css layout practise

7/15/2024

using different way to great a grid layout

JS and React interview questions

6/27/2024

you are your own worst critic

notebook when learning next.js

6/25/2024

Key points for review

React Router

6/17/2024

React Router enables client side routing

Node.js Tutorial

6/16/2024

node built-in modules

Disjoint Set Union - 721

6/6/2024

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

Topological sorting(Kahn's Algorithm) -207

6/4/2024

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

LRU Cache-146

5/26/2024

design a LRU

Interval-56,57

5/25/2024

merge and insert intervals are two kind of classic aglo problems

graid75-53,542,49,271,383,409,994,133,155,102,127

5/22/2024

this is kind of classic aglo problems

climbing stairs dp-70.746,139,91

5/20/2024

this is kind of a classic dp problems

backtracking with pruning-131,93

5/1/2024

add valid function to prun

Implement a class with a check contain method

4/30/2024

use different ways

Classic algo on linked list-203,82,83,19,206,92,25,707,142,143

4/27/2024

linked list

classic DP on Palindrome Algo-647,5,516

4/8/2024

palindrome Substring and Subsequence

classic DP Algo-64,322,518,377,1143,300,674,368

3/16/2024

different kinds of dp

Binary Tree Right Side View

3/6/2024

DFS and BFS

Backtracking solve perputation and subsequences with duplication - 47,491

3/4/2024

use set or array to mark used element

React Hook

2/28/2024

About some tips about useful hook

DP-122,309,188

2/26/2024

Best time to buy and sell stock

DP-1143

2/25/2024

use dfs with memo and dp table

Use prefix sum to deal with sums related within an array-523

2/22/2024

prefix Sum VS sliding widows

sliding Window Algorithm-3,438,239,159,76

2/21/2024

make use of map,set and stack

Two Pointers-283,239,11,543,2461,209

2/19/2024

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

Using array destructuring to swap elements-733

2/18/2024

using array method on string

Use DFS and BFS on Graph-695

2/15/2024

mark visited node is important

Use DFS on Graph-733,200,695

2/14/2024

dfs pay more atttention on visited node

Dynamic program solving template

2/12/2024

Using five steps to get it

Template for finding shortest steps to exit in maze-1926

2/9/2024

BFS may be the best way

fill() in js

2/7/2024

more details about the method

Backtracking solve subsets and subsequences - 78,90,491

2/6/2024

basic and conditonal problems

Find median using two heaps -295

2/2/2024

minheap and maxheap

Markdown cheetsheet

2/1/2024

How to learn md quickly

Algorithm-about heap-23,378

1/30/2024

Implement a Minheap

Algorithm-about heap-973

1/26/2024

Implement a Minheap

Algorithm-39,40

1/24/2024

Combination Sum

Algorithm-70,322

1/21/2024

Backtracking with memo

Algorithm-257,988,112,113,437,139,46

1/18/2024

Backtracking with additional states

Algorithm-297

1/16/2024

DFS-Serialize and Deserialize

Algorithm-104,110,543,701,235,91

1/8/2024

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

Algorithm-680

12/5/2023

two pointers in string

Algorithm-007

12/4/2023

two pointers in sorted array

Algorithm-88

12/4/2023

two pointers in sorted array

Algorithm-34,540,729,852

11/28/2023

only can ben used in sorted array

Algorithm-75

11/27/2023

base on bubble sorting in array

Algorithm on hash-01,349,232

11/27/2023

use map,set,array to solve hash problems

How to deal with height in tailwindCss

11/15/2023

Height Algorithms

Border in tailwindCss

11/14/2023

some details about border in tailwindCss

Border in tailwindCss

11/14/2023

some details about border in tailwindCss mdx

Pseudo classes and elements in tailwindCss

11/12/2023

Tailwind includes modifiers to deal with pseudo