---
title: "Abhi (@lietcode) | Hashnode"
description: "Let's crack the interviews. Read the latest articles by Abhi on Hashnode."
url: "https://hashnode.com/@lietcode"
---

@lietcode

# Abhi

@lietcode · Joined May 2024

Let's crack the interviews

### [Dynamic Programming](https://lietnode.hashnode.dev/dynamic-programming?utm_source=hashnode&utm_medium=feed)

I will create a detailed markdown document covering all major Dynamic Programming (DP) patterns. Each pattern will include: A brief summary explaining its significance and when to use it. Common techniques and tricks to solve problems under this pa...

84 min read · [lietnode.hashnode.dev](https://lietnode.hashnode.dev/dynamic-programming?utm_source=hashnode&utm_medium=feed)

[Mar 20, 2025](https://hashnode.com/posts/dynamic-programming/67dca4aac74aa576210c19db)

### [Climbing Stairs](https://lietcode.hashnode.dev/climbing-stairs?utm_source=hashnode&utm_medium=feed)

1\. Introduction to Dynamic Programming Dynamic Programming (DP) is a problem-solving technique that involves breaking a complex problem into simpler overlapping subproblems and solving each subproblem only once. In other words, DP trades redundant co...

84 min read · [lietcode.hashnode.dev](https://lietcode.hashnode.dev/climbing-stairs?utm_source=hashnode&utm_medium=feed)

[Mar 20, 2025](https://hashnode.com/posts/climbing-stairs/67db61fa9a1cd1fbfa05ea0d)

### [Minimum Operations to Make a Subsequence](https://logiclab.hashnode.dev/minimum-operations-to-make-a-subsequence?utm_source=hashnode&utm_medium=feed)

HARD

4 min read · [logiclab.hashnode.dev](https://logiclab.hashnode.dev/minimum-operations-to-make-a-subsequence?utm_source=hashnode&utm_medium=feed)

[Mar 8, 2025](https://hashnode.com/posts/minimum-operations-to-make-a-subsequence/67cca18a7a9f5909983949e9)

### [Evaluate Division - BFS](https://lietcode.hashnode.dev/evaluate-division-bfs?utm_source=hashnode&utm_medium=feed)

You are given an array of variable pairs equations and an array of real numbers values, where equations\[i\] = \[A<sub>i</sub>, B<sub>i</sub>\] and values\[i\] represent the equation A<sub>i</sub> / B<sub>i</sub> = values\[i\]. Each A<sub>i</sub> or B<sub>i<...

4 min read · [lietcode.hashnode.dev](https://lietcode.hashnode.dev/evaluate-division-bfs?utm_source=hashnode&utm_medium=feed)

[Jun 30, 2024](https://hashnode.com/posts/evaluate-division-bfs/66813631959f274f89f223dc)

### [Word Ladder II - BFS](https://lietcode.hashnode.dev/word-ladder-ii-bfs?utm_source=hashnode&utm_medium=feed)

A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s<sub>1</sub> -> s<sub>2</sub> -> ... -> s<sub>k</sub> such that: Every adjacent pair of words differs by a single letter. ...

4 min read · [lietcode.hashnode.dev](https://lietcode.hashnode.dev/word-ladder-ii-bfs?utm_source=hashnode&utm_medium=feed)

[Jun 30, 2024](https://hashnode.com/posts/word-ladder-ii-bfs/66812d1578801460e25f2f2b)
