You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardexpand all lines: apps/web/src/contents/1382-balance-a-binary-search-tree.md
+4-1
Original file line number
Diff line number
Diff line change
@@ -12,13 +12,16 @@ tags:
12
12
- Binary Search Tree
13
13
- Binary Tree
14
14
summary: 'Given the `root` of a binary search tree, return a balanced binary search tree with the same node values. If there is more than one answer, return any of them.'
alt: "LeetCode 1382. Balance a Binary Search Tree - Easy Solution | Go"
17
17
mathjax: true
18
18
---
19
19
20
20
Link 👉🏻 [1382. Balance a Binary Search Tree](https://leetcode.com/problems/balance-a-binary-search-tree/)
21
21
22
+

23
+
24
+
22
25
### Description
23
26
24
27
Given the `root` of a binary search tree, return a balanced binary search tree with the same node values. If there is more than one answer, return any of them.
Copy file name to clipboardexpand all lines: apps/web/src/contents/1791-find-center-of-star-graph.md
+3-1
Original file line number
Diff line number
Diff line change
@@ -6,13 +6,15 @@ tags:
6
6
- Graph
7
7
- Go
8
8
summary: 'In a star graph, the center node will appear in each of the edges which means every node will contain the center node. So, we just need to find the common node in the first two edges.'
alt: "[O(1) Time and Space] LeetCode 1791. Find Center of Star Graph - Easy Solution | Go"
11
11
mathjax: true
12
12
---
13
13
14
14
Link 👉🏻 [1791. Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph/)
15
15
16
+
![\[O(1) Time and Space\] LeetCode 1791. Find Center of Star Graph - Easy Solution | Go by Hugo](/images/banner/1791-find-center-of-star-graph.png)
17
+
16
18
### Description
17
19
18
20
There is an undirected star graph consisting of `n` nodes labeled from `1` to `n`. A star graph is a graph where there is one center node and exactly `n - 1` edges that connect the center node with every other node.
Copy file name to clipboardexpand all lines: apps/web/src/contents/2181-merge-nodes-in-between-zeros.md
+3-1
Original file line number
Diff line number
Diff line change
@@ -7,13 +7,15 @@ tags:
7
7
- Simulation
8
8
- Go
9
9
summary: "You are given the head of a linked list, which contains a series of integers separated by 0's. The beginning and end of the linked list will have Node.val == 0."
alt: "💯✅ LeetCode 2181. Merge Nodes in Between Zeros | Go"
12
12
mathjax: true
13
13
---
14
14
15
15
Link 👉🏻 [2181. Merge Nodes in Between Zeros](https://leetcode.com/problems/merge-nodes-in-between-zeros)
16
16
17
+

18
+
17
19
## Description
18
20
19
21
You are given the `head` of a linked list, which contains a series of integers separated by `0`'s. The beginning and end of the linked list will have `Node.val == 0`.
0 commit comments