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

@abhikommen

# Abhi

@abhikommen · Joined March 2025

### [Odd Even Jump (Hard)](https://dynamicprogramming.hashnode.dev/odd-even-jump-hard?utm_source=hashnode&utm_medium=feed)

You are given an integer array arr. From some starting index, you can make a series of jumps. The (1st, 3rd, 5th, ...) jumps in the series are called odd-numbered jumps, and the (2nd, 4th, 6th, ...) jumps in the series are called even-numbered jumps....

6 min read · [dynamicprogramming.hashnode.dev](https://dynamicprogramming.hashnode.dev/odd-even-jump-hard?utm_source=hashnode&utm_medium=feed)

[Apr 13, 2025](https://hashnode.com/posts/odd-even-jump-hard/67fc07bcf25d0b1005a227e3)

### [Remove K Digits](https://dynamicprogramming.hashnode.dev/remove-k-digits?utm_source=hashnode&utm_medium=feed)

Given string num representing a non-negative integer num, and an integer k, return the smallest possible integer after removing k digits from num. Example 1: Input: num = "1432219", k = 3 Output: "1219" Explanation: Remove the three digits 4, 3, and...

3 min read · [dynamicprogramming.hashnode.dev](https://dynamicprogramming.hashnode.dev/remove-k-digits?utm_source=hashnode&utm_medium=feed)

[Apr 13, 2025](https://hashnode.com/posts/remove-k-digits/67fc05f7d662fdce15cce04c)

### [Minimum Safe Transformations Between Two Strings](https://dynamicprogramming.hashnode.dev/minimum-safe-transformations-between-two-strings?utm_source=hashnode&utm_medium=feed)

Description: You're given two strings str1 and str2, both of equal length, made up of only the characters 'x', 'y', and 'z'. Your task is to transform str1 into str2 using the minimum number of character replacements, with one constraint: ➡️ At no po...

3 min read · [dynamicprogramming.hashnode.dev](https://dynamicprogramming.hashnode.dev/minimum-safe-transformations-between-two-strings?utm_source=hashnode&utm_medium=feed)

[Apr 13, 2025](https://hashnode.com/posts/minimum-safe-transformations-between-two-strings/67fc0173941f1a20f9aa5bbb)

### [Sentence Screen Fitting](https://dynamicprogramming.hashnode.dev/sentence-screen-fitting?utm_source=hashnode&utm_medium=feed)

Given a rows x cols screen and a sentence represented by a list of non-empty words, find how many times the given sentence can be fitted on the screen. Note: A word cannot be split into two lines. The order of words in the sentence must remain unch...

4 min read · [dynamicprogramming.hashnode.dev](https://dynamicprogramming.hashnode.dev/sentence-screen-fitting?utm_source=hashnode&utm_medium=feed)

[Apr 12, 2025](https://hashnode.com/posts/sentence-screen-fitting/67faee0ae97e8ff603bb2125)

### [Number of Islands II](https://dynamicprogramming.hashnode.dev/number-of-islands-ii?utm_source=hashnode&utm_medium=feed)

A 2d grid map of m rows and n columns is initially filled with water. We may perform an addLand operation which turns the water at position (row, col) into a land. Given a list of positions to operate, count the number of islands after each addLand o...

5 min read · [dynamicprogramming.hashnode.dev](https://dynamicprogramming.hashnode.dev/number-of-islands-ii?utm_source=hashnode&utm_medium=feed)

[Apr 12, 2025](https://hashnode.com/posts/number-of-islands-ii/67faea8e88967e8771f02fac)
