~/lc-grind

Determine if a given string of words perfectly mirrors a character pattern, ensuring a consistent, one-to-one mapping in both directions.

Determine if two strings are isomorphic by checking if you can replace every character in the first string with a unique character from the second while preserving the order.

Determine if you can write a ransom note using only the letters available from a magazine, where each magazine letter can be used just once.

Simulate the next state of Conway's Game of Life by applying its four classic rules simultaneously to every cell in an m x n grid, where each cell's fate is determined by the state of its eight neighbors.

Check if your partially filled Sudoku board follows the rules—ensuring no duplicate numbers appear in any row, column, or 3x3 sub-box—without needing to solve it.

Find the shortest contiguous subarray where the sum of its elements meets or exceeds a given target value.

Find all starting indices in a string where a concatenation of every permutation of a given array of equal-length words begins.

Leverage the sorted array property to find two numbers that sum to the target using an efficient two-pointer technique, returning their 1-based indices.

Master the classic subsequence check with a simple two-pointer approach, then level up for high-frequency queries using dynamic programming and binary search.

Master the art of perfectly formatting text by simulating a word processor's greedy line packing and precise space distribution to achieve full justification, with special handling for the final line.