SYShohei Yoshidainsyohex.hashnode.dev·Mar 30 · 1 min readLeetCode 2840. Check if Strings Can be Made Equal With Operations II in F#URL Check if Strings Can be Made Equal With Operations II - LeetCode Code https://github.com/syohex/dotnet-study/tree/main/fsharp/leetcode/challenge/202603/check_if_strings_can_be_made_equal_with_oper00
SYShohei Yoshidainsyohex.hashnode.dev·Feb 12 · 1 min readLeetCode 3713. Longest Balanced Substring I in F#URL https://leetcode.com/problems/longest-balanced-substring-i/description/?envType=daily-question&envId=2026-02-12 Code https://github.com/syohex/dotnet-study/blob/main/fsharp/leetcode/challenge/202602/longest_balanced_substring1/main.fsx let longes...00
SYShohei Yoshidainsyohex.hashnode.dev·Feb 6 · 1 min readLeetCode 3634. Minimum Removals to Balance Array in F#URL Minimum Removals to Balance Array - LeetCode Code dotnet-study/fsharp/leetcode/challenge/202602/minimum_removals_to_balance_array/main.fsx at main · syohex/dotnet-study let minRemoval (nums: int list) (k: int) : int = let k = int64 k let...00
SYShohei Yoshidainsyohex.hashnode.dev·Jan 27 · 2 min readLeetCode 3650. Minimum Cost Path with Edge Reversals in F#URL Minimum Cost Path with Edge Reversals - LeetCode Code dotnet-study/fsharp/leetcode/challenge/202601/minimum_cost_path_with_edge_reversals/main.fsx at main · syohex/dotnet-study type Edge = { node: int; cost: int } let toGraph (edges: (int * int ...00
SYShohei Yoshidainsyohex.hashnode.dev·Jan 21 · 1 min read3315. Construct the Minimum Bitwise Array II in F#URL Construct the Minimum Bitwise Array II - LeetCode Code https://github.com/syohex/dotnet-study/tree/main/fsharp/leetcode/challenge/202601/construct_the_minimum_bitwise_array2/main.fsx let minBitwiseArray (nums: int list) : int list = let rec f...00