commit 30591a83bd4bb06879d9f490faa0cff6dd77c206
parent 03bad970a40db6fc1224f8dcaa251ee2c70132ef
Author: Jack Sangdahl <jack@pngu.org>
Date: Sat, 21 Feb 2026 08:48:18 -0700
Update readme.md following moving notes to site
Diffstat:
| M | readme.md | | | 86 | +------------------------------------------------------------------------------ |
1 file changed, 1 insertion(+), 85 deletions(-)
diff --git a/readme.md b/readme.md
@@ -2,88 +2,4 @@
This repository contains my Leetcode solutions for [user 0x6A73](https://leetcode.com/u/0x6A73). Generally, the daily challenge is solved in both C and Python3.
-## Notes
-
-### C Utilities
-The [`leetcode.h`](leetcode.h) header file contains various includes, standard Leetcode structs (`ListNode`, `TreeNode`), and some helpful macros, like calculating the size of a array using `builtin` functions.
-```c
-#define IS_ARRAY(value) \
- (!__builtin_types_compatible_p(typeof((value)), typeof(&(value)[0])))
-
-#define ARRAY_SIZE(array) \
- (__builtin_choose_expr(IS_ARRAY((array)), \
- sizeof((array)) / sizeof((array)[0]), (void)0))
-
-// foo.c
-int arr[] = {1, 2, 3};
-int foo = func(arr, ARRAY_SIZE(arr));
-```
-
-The [`leetcode.c`](leetcode.c) file has helpful functions to fill `ListNode` and `TreeNode` data structures with provided data, and also print data returned by such functions. For examples, see the following `main` functions.
-
-#### `ListNode` data type
-
-
-
-```c
-int main() {
- int input[] = {0, 3, 1, 0, 4, 5, 2, 0};
- struct ListNode *head = listnode_build(input, ARRAY_SIZE(input));
- listnode_print(head);
- listnode_free(head);
-}
-```
-
-#### `TreeNode` data type
-
-
-
-```c
-int main() {
- int input[] = {3, 9, 20, -1, -1, 15, 7};
- // note: -1 denotes a 'null' leaf. if a problem's input depends on
- // this value, use treenode_create() to individually create each node
- struct TreeNode *root = treenode_build(input, ARRAY_SIZE(input));
- treenode_print(root);
- treenode_free(root);
-}
-```
-
-#### 2D Array Helpers
-
-```c
-int func(int **edges, int edgesSize, int *edgesColSize);
-
-int main() {
- // edges = [[0,1],[0,2],[1,3],[1,4],[2,5],[2,6]]
- int edges_input[6][2] = {{0, 1}, {0, 2}, {1, 3}, {1, 4}, {2, 5}, {2, 6}};
- struct two_d_arr *edges = two_d_arr_init(ARRAY_SIZE(edges_input), ARRAY_SIZE(edges_input[0]), edges_input);
- int res = func(edges.arr, edges.row_size, edges.col_size);
- two_d_arr_free(edges);
-}
-```
-
-### Python Utilities
-
-Similar to the above, [`leetcode.py`](leetcode.py) contains helpers to work with Leetcode data structures.
-
-#### `ListNode` data type
-
-```python
-from leetcode import ListNode, listnode_build, listnode_print
-
-if __name__ == "__main__":
- head = listnode_build(vals=[0, 3, 1, 0, 4, 5, 2, 0])
- listnode_print(head)
-```
-
-#### `TreeNode` data type
-
-```python
-from leetcode import TreeNode, treenode_build, treenode_print
-
-if __name__ == "__main__":
- root = treenode_build(vals=[3, 9, 20, None, None, 15, 7])
- # note: None denotes a 'null' leaf
- treenode_print(root)
-```
+For more, see [here](https://pngu.org/leetcode.html)
