---
title: "tracelit (@tracelit) | Hashnode"
description: "tracelit (@tracelit) writes on Hashnode. Read their latest articles and follow their work."
url: "https://hashnode.com/@tracelit"
---

@tracelit

# tracelit

@tracelit · Joined April 2026

### [LeetCode 79: Word Search — Step-by-Step Visual Trace](https://blog.tracelit.dev/word-search-visualization?utm_source=hashnode&utm_medium=feed)

Given a 2D board of characters and a target word, determine if the word exists in the grid by connecting adjacent cells horizontally or vertically.

2 min read · [blog.tracelit.dev](https://blog.tracelit.dev/word-search-visualization?utm_source=hashnode&utm_medium=feed)

[Apr 9](https://hashnode.com/posts/word-search-visualization/69d7d2bf9c7868e2061133d7)

### [LeetCode 212: Word Search Ii — Step-by-Step Visual Trace](https://blog.tracelit.dev/word-search-ii-visualization?utm_source=hashnode&utm_medium=feed)

Given a 2D board of characters and a list of words, find all words from the list that can be formed by sequentially adjacent letters on the board, where each cell can only be used once per word.

3 min read · [blog.tracelit.dev](https://blog.tracelit.dev/word-search-ii-visualization?utm_source=hashnode&utm_medium=feed)

[Apr 9](https://hashnode.com/posts/word-search-ii-visualization/69d7d2be9c7868e2061133d5)

### [LeetCode 127: Word Ladder — Step-by-Step Visual Trace](https://blog.tracelit.dev/word-ladder-visualization?utm_source=hashnode&utm_medium=feed)

Find the length of the shortest transformation sequence from beginWord to endWord, where each transformation changes exactly one letter and each intermediate word must exist in the given wordList.

1 min read · [blog.tracelit.dev](https://blog.tracelit.dev/word-ladder-visualization?utm_source=hashnode&utm_medium=feed)

[Apr 9](https://hashnode.com/posts/word-ladder-visualization/69d7d2bc1cf15606b2600952)

### [LeetCode 139: Word Break — Step-by-Step Visual Trace](https://blog.tracelit.dev/word-break-visualization?utm_source=hashnode&utm_medium=feed)

Given a string s and a dictionary of words wordDict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.

1 min read · [blog.tracelit.dev](https://blog.tracelit.dev/word-break-visualization?utm_source=hashnode&utm_medium=feed)

[Apr 9](https://hashnode.com/posts/word-break-visualization/69d7d2bab3157a36ebc02700)

### [LeetCode 286: Walls And Gates — Step-by-Step Visual Trace](https://blog.tracelit.dev/walls-and-gates-visualization?utm_source=hashnode&utm_medium=feed)

Fill each empty room with the distance to its nearest gate, where rooms are represented by a 2D grid with gates (0), walls (-1), and empty rooms (INF).

2 min read · [blog.tracelit.dev](https://blog.tracelit.dev/walls-and-gates-visualization?utm_source=hashnode&utm_medium=feed)

[Apr 9](https://hashnode.com/posts/walls-and-gates-visualization/69d7d2b81cf15606b2600950)