This file contains hidden or 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: 515 Find Largest Value in Each Tree Row | |
| // https://leetcode.com/problems/find-largest-value-in-each-tree-row/editorial/?envType=daily-question&envId=2024-12-25 | |
| // = = = = = = = = = = = = = = | |
| // Accepted. | |
| // Thanks God, Jesus Christ! | |
| // = = = = = = = = = = = = = = | |
| // Runtime: 0 ms Beats 100.00% | |
| // Memory: 7.82 MB Beats 67.50% | |
| package main |
This file contains hidden or 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: 1422. Maximum Score After Splitting a String. | |
| // https://leetcode.com/problems/maximum-score-after-splitting-a-string/description/?envType=daily-question&envId=2025-01-01 | |
| // = = = = = = = = = = = = = = | |
| // Accpeted. | |
| // Thanks God, Jesus Christ! | |
| // = = = = = = = = = = = = = = | |
| // Runtime: 0 ms Beats 100.00% | |
| // Memory: 3.94 MB Beats 51.06% | |
| // 2025.01.01 Daily Challenge. |
This file contains hidden or 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: 2471. Minimum Number of Operations to Sort a Binary Tree by Level | |
| // https://leetcode.com/problems/minimum-number-of-operations-to-sort-a-binary-tree-by-level/editorial/?envType=daily-question&envId=2024-12-23 | |
| // = = = = = = = = = = = = = = | |
| // Accepted. | |
| // Thanks God, Jesus Christ! | |
| // = = = = = = = = = = = = = = | |
| // Runtime: 105 ms Beats 43.83% | |
| // Memory: 23.21 MB Beats 52.77% | |
| // 2024.12.23 Daily Challenge. | |
| // 2024.12.31 Implemented. |
This file contains hidden or 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: 2940. Find Building Where Alice and Bob Can Meet | |
| // https://leetcode.com/problems/find-building-where-alice-and-bob-can-meet/editorial/?envType=daily-question&envId=2024-12-22 | |
| // = = = = = = = = = = = = = = | |
| // Accepted. | |
| // Thanks God, Jesus Christ! | |
| // = = = = = = = = = = = = = = | |
| // 65 ms Beats 53.13% | |
| // 2024.12.22 Daily Challenge. | |
| // 2024.12.31 implemented. | |
| // Translation of the Leetcode solution from Pyhon to Golang. |
This file contains hidden or 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: 2872. Maximum Number of K-Divisible Components | |
| // https://leetcode.com/problems/maximum-number-of-k-divisible-components/ | |
| // = = = = = = = = = = = = = = | |
| // Accepted. | |
| // Thanks God, Jesus Christ! | |
| // = = = = = = = = = = = = = = | |
| // Runtime: 43 ms, faster than 11.11% of Go online submissions for Maximum | |
| // Number of K-Divisible Components. | |
| // Memory Usage: 23.7 MB, less than 22.22% of Go online submissions for | |
| // Maximum Number of K-Divisible Components. |
This file contains hidden or 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: 2415. Reverse Odd Levels of Binary Tree | |
| // https://leetcode.com/problems/reverse-odd-levels-of-binary-tree/ | |
| // = = = = = = = = = = = = = = | |
| // Accepted. | |
| // Thanks God, Jesus Christ! | |
| // = = = = = = = = = = = = = = | |
| // Runtime: 63 ms, faster than 6.67% of Go online submissions for Reverse Odd | |
| // Levels of Binary Tree. | |
| // Memory Usage: 10.7 MB, less than 6.67% of Go online submissions for Reverse | |
| // Odd Levels of Binary Tree. |
This file contains hidden or 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: 769. Max Chunks To Make Sorted | |
| // https://leetcode.com/problems/max-chunks-to-make-sorted/ | |
| // = = = = = = = = = = = = = = | |
| // Accepted. | |
| // Thanks God, Jesus Christ! | |
| // = = = = = = = = = = = = = = | |
| // Runtime: 0 ms, faster than 100.00% of Go online submissions for Max Chunks | |
| // To Make Sorted. | |
| // Memory Usage: 3.9 MB, less than 6.25% of Go online submissions for Max | |
| // Chunks To Make Sorted. |
This file contains hidden or 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: 1475. Final Prices With a Special Discount in a Shop | |
| // https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/ | |
| // = = = = = = = = = = = = = = | |
| // Accepted. | |
| // Thanks God, Jesus Christ! | |
| // = = = = = = = = = = = = = = | |
| // Runtime: 0 ms, faster than 100.00% of Go online submissions for Final | |
| // Prices With a Special Discount in a Shop. | |
| // Memory Usage: 4.7 MB, less than 24.24% of Go online submissions for Final | |
| // Prices With a Special Discount in a Shop. |
This file contains hidden or 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: 2182. Construct String With Repeat Limit | |
| // https://leetcode.com/problems/construct-string-with-repeat-limit/ | |
| // = = = = = = = = = = = = = = | |
| // Accepted. | |
| // Thanks God, Jesus Christ! | |
| // = = = = = = = = = = = = = = | |
| // Runtime: 73 ms, faster than 22.22% of Go online submissions for Construct | |
| // String With Repeat Limit. | |
| // Memory Usage: 9.1 MB, less than 60.00% of Go online submissions for | |
| // Construct String With Repeat Limit. |
This file contains hidden or 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: 3264. Final Array State After K Multiplication Operations I | |
| // https://leetcode.com/problems/final-array-state-after-k-multiplication-operations-i/ | |
| // = = = = = = = = = = = = = = | |
| // Accepted. | |
| // Thanks God, Jesus Christ! | |
| // = = = = = = = = = = = = = = | |
| // Runtime: 0 ms, faster than 100.00% of Go online submissions for Final Array | |
| // State After K Multiplication Operations I. | |
| // Memory Usage: 6.3 MB, less than 12.07% of Go online submissions for Final | |
| // Array State After K Multiplication Operations I. |