This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Leetcode: 1137. N-th Tribonacci Number. | |
// https://leetcode.com/problems/n-th-tribonacci-number/ | |
// = = = = = = = = = = = = = = | |
// Accepted. | |
// Thanks God, Jesus Christ! | |
// = = = = = = = = = = = = = = | |
// Runtime: 1 ms, faster than 78.71% of Go online submissions for N-th | |
// Tribonacci Number. | |
// Memory Usage: 2.1 MB, less than 68.56% of Go online submissions for N-th | |
// Tribonacci Number. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Leetcode: 310. Minimum Height Trees. | |
// https://leetcode.com/problems/minimum-height-trees/ | |
// = = = = = = = = = = = = = = | |
// Accepted. | |
// Thanks God, Jesus Christ! | |
// = = = = = = = = = = = = = = | |
// Runtime: 104 ms, faster than 38.61% of Go online submissions for Minimum | |
// Height Trees. | |
// Memory Usage: 18.5 MB, less than 5.94% of Go online submissions for Minimum | |
// Height Trees. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Leetcode: 752. Open the Lock. | |
# https://leetcode.com/problems/open-the-lock/ | |
# = = = = = = = = = = = = = = | |
# Accepted. | |
# Thanks God, Jesus Christ! | |
# = = = = = = = = = = = = = = | |
# Runtime: 292 ms, faster than 90.77% of Python3 online submissions for Open | |
# the Lock. | |
# Memory Usage: 18 MB, less than 50.54% of Python3 online submissions for Open | |
# the Lock. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Leetcode: 1971. Find if Path Exists in Graph. | |
// https://leetcode.com/problems/find-if-path-exists-in-graph/ | |
// = = = = = = = = = = = = = = | |
// Accepted. | |
// Thanks God, Jesus Christ! | |
// = = = = = = = = = = = = = = | |
// Runtime: 299 ms, faster than 55.81% of Go online submissions for Find if | |
// Path Exists in Graph. | |
// Memory Usage: 55.9 MB, less than 58.43% of Go online submissions for Find | |
// if Path Exists in Graph. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Leetcode: 463. Island Perimeter. | |
// https://leetcode.com/problems/island-perimeter/ | |
// = = = = = = = = = = = = = = | |
// Accepted. | |
// Thanks God, Jesus Christ! | |
// = = = = = = = = = = = = = = | |
// Runtime: 45 ms, faster than 61.37% of Go online submissions for Island | |
// Perimeter. | |
// Memory Usage: 8.1 MB, less than 6.51% of Go online submissions for Island | |
// Perimeter. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Leetcode: 1992. Find All Groups of Farmland. | |
// https://leetcode.com/problems/find-all-groups-of-farmland/ | |
// = = = = = = = = = = = = = = | |
// Accepted. | |
// Thanks God, Jesus Christ! | |
// = = = = = = = = = = = = = = | |
// Runtime: 134 ms, faster than 30.00% of Go online submissions for Find All | |
// Groups of Farmland. | |
// Memory Usage: 25.7 MB, less than 20.00% of Go online submissions for Find | |
// All Groups of Farmland. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Leetcode: 200. Number of Islands. | |
// https://leetcode.com/problems/number-of-islands/ | |
// = = = = = = = = = = = = = = | |
// Accepted. | |
// Thanks God, Jesus Christ! | |
// = = = = = = = = = = = = = = | |
// Runtime: 4 ms, faster than 76.52% of Go online submissions for Number of | |
// Islands. | |
// Memory Usage: 6.1 MB, less than 28.58% of Go online submissions for Number | |
// of Islands. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Leetcode: 988. Smallest String Starting From Leaf. | |
# https://leetcode.com/problems/smallest-string-starting-from-leaf/ | |
# = = = = = = = = = = = = = = | |
# Accepted. | |
# Thanks God, Jesus Christ! | |
# = = = = = = = = = = = = = = | |
# Runtime: 39 ms, faster than 79.79% of Python3 online submissions for | |
# Smallest String Starting From Leaf. | |
# Memory Usage: 17.7 MB, less than 88.96% of Python3 online submissions for | |
# Smallest String Starting From Leaf. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Leetcode: 623. Add One Row to Tree. | |
// https://leetcode.com/problems/add-one-row-to-tree/ | |
package main | |
/** | |
* Definition for a binary tree node. | |
* type TreeNode struct { | |
* Val int | |
* Left *TreeNode |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Leetcode: 129. Sum Root to Leaf Numbers. | |
// https://leetcode.com/problems/sum-root-to-leaf-numbers/ | |
// = = = = = = = = = = = = = = | |
// Accepted. | |
// Thanks God, Jesus Christ! | |
// = = = = = = = = = = = = = = | |
// Runtime: 0 ms, faster than 100.00% of Go online submissions for Sum Root to | |
// Leaf Numbers. | |
// Memory Usage: 2.4 MB, less than 6.15% of Go online submissions for Sum Root | |
// to Leaf Numbers. |