String

Leetcode 76 Minimum Window Substring

by leetcode-solution.com
June 4, 2024June 4, 2024

The first thing comes into mind is sliding window since this is a substring related problem. The idea is pretty simple actually. javascript: Time Complexity:We looped through both t and s once, so the time complexity is O(m + n)… Read More »Leetcode 76 Minimum Window Substring

Leetcode 433 Minimum Genetic Mutation

by leetcode-solution.com
June 3, 2024June 3, 2024
2 Comments

To address this problem, we can use either Breadth-First Search (BFS) since it’s more suitable for finding the shortest path in an unweighted graph, similar to determining the minimum number of mutations required. The core idea is to represent each… Read More »Leetcode 433 Minimum Genetic Mutation