---
title: "Shohei Yoshida (@syohex) | Hashnode"
description: "A Software Developer. Read the latest articles by Shohei Yoshida on Hashnode."
url: "https://hashnode.com/@syohex"
---

@syohex

# Shohei Yoshida

@syohex · Tokyo, Japan · Joined October 2021

A Software Developer

[Website](https://syohex.org/)

### [LeetCode 2840. Check if Strings Can be Made Equal With Operations II in F#](https://syohex.hashnode.dev/leetcode-2840-check-if-strings-can-be-made-equal-with-operations-ii-in-f?utm_source=hashnode&utm_medium=feed)

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\_oper

1 min read · [syohex.hashnode.dev](https://syohex.hashnode.dev/leetcode-2840-check-if-strings-can-be-made-equal-with-operations-ii-in-f?utm_source=hashnode&utm_medium=feed)

[Mar 30](https://hashnode.com/posts/leetcode-2840-check-if-strings-can-be-made-equal-with-operations-ii-in-f/69c9d0615282e6ac9c18150c)

### [LeetCode 3713. Longest Balanced Substring I in F#](https://syohex.hashnode.dev/leetcode-3713-longest-balanced-substring-i-in-f?utm_source=hashnode&utm_medium=feed)

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...

1 min read · [syohex.hashnode.dev](https://syohex.hashnode.dev/leetcode-3713-longest-balanced-substring-i-in-f?utm_source=hashnode&utm_medium=feed)

[Feb 12](https://hashnode.com/posts/leetcode-3713-longest-balanced-substring-i-in-f/698d62a3b93fb278dff72f34)

### [LeetCode 3634. Minimum Removals to Balance Array in F#](https://syohex.hashnode.dev/leetcode-3634-minimum-removals-to-balance-array-in-f?utm_source=hashnode&utm_medium=feed)

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...

1 min read · [syohex.hashnode.dev](https://syohex.hashnode.dev/leetcode-3634-minimum-removals-to-balance-array-in-f?utm_source=hashnode&utm_medium=feed)

[Feb 6](https://hashnode.com/posts/leetcode-3634-minimum-removals-to-balance-array-in-f/698556d934b15e4b5f241295)

### [LeetCode 3650. Minimum Cost Path with Edge Reversals in F#](https://syohex.hashnode.dev/leetcode-3650-minimum-cost-path-with-edge-reversals-in-f?utm_source=hashnode&utm_medium=feed)

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 ...

2 min read · [syohex.hashnode.dev](https://syohex.hashnode.dev/leetcode-3650-minimum-cost-path-with-edge-reversals-in-f?utm_source=hashnode&utm_medium=feed)

[Jan 27](https://hashnode.com/posts/leetcode-3650-minimum-cost-path-with-edge-reversals-in-f/69782581c26704a441b87fa1)

### [3315\. Construct the Minimum Bitwise Array II in F#](https://syohex.hashnode.dev/3315-construct-the-minimum-bitwise-array-ii-in-f?utm_source=hashnode&utm_medium=feed)

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...

1 min read · [syohex.hashnode.dev](https://syohex.hashnode.dev/3315-construct-the-minimum-bitwise-array-ii-in-f?utm_source=hashnode&utm_medium=feed)

[Jan 21](https://hashnode.com/posts/3315-construct-the-minimum-bitwise-array-ii-in-f/6970342acecd2e6e5872988b)
