---
title: "Amit Kumar (@dev-Amit) | Hashnode"
description: "Sharing my insights about dsa,java,tech news, interview prepration. Read the latest articles by Amit Kumar on Hashnode."
url: "https://hashnode.com/@dev-Amit"
---

@dev-Amit

# Amit Kumar

@dev-Amit · India · Joined November 2025

Sharing my insights about dsa,java,tech news, interview prepration

### [DSA DAY#5 : Contains Most Water](https://amit01.hashnode.dev/dsa-day5-contains-most-water?utm_source=hashnode&utm_medium=feed)

#Problem statment:You are given an integer array heights where heights\[i\] represents the height of the ithith bar. You may choose any two bars to form a container. Return the maximum amount of water a container can store. # Clarify Requirement: Can ...

1 min read · [amit01.hashnode.dev](https://amit01.hashnode.dev/dsa-day5-contains-most-water?utm_source=hashnode&utm_medium=feed)

[Nov 11, 2025](https://hashnode.com/posts/dsa-day5-contains-most-water/69136c3267f6ae2d96376eca)

### [DSA Day#4:Encoding & Deconding Strings](https://amit01.hashnode.dev/dsa-day4encoding-and-deconding-strings?utm_source=hashnode&utm_medium=feed)

#Problem: Encoding and decoding of Strings #Problem statement: Design an algorithm to encode a list of strings to a single string. The encoded string is then decoded back to the original list of strings. Please implement encode and decode # Clarify R...

1 min read · [amit01.hashnode.dev](https://amit01.hashnode.dev/dsa-day4encoding-and-deconding-strings?utm_source=hashnode&utm_medium=feed)

[Nov 6, 2025](https://hashnode.com/posts/dsa-day4encoding-and-deconding-strings/690cdd2e9ff9d2df1d44d19c)

### [DSA Day#3: Top k frequent elements, MinHeap Approach explained](https://amit01.hashnode.dev/dsa-day3-top-k-frequent-elements-minheap-approach-explained?utm_source=hashnode&utm_medium=feed)

#Problem : Top k freqeuent element #Problem statement: Given an integer array nums and an integer k, return the k most frequent elements within the array. #Clarify Requirement: Is the input array empty? Can k be greater than the array length? uniq...

2 min read · [amit01.hashnode.dev](https://amit01.hashnode.dev/dsa-day3-top-k-frequent-elements-minheap-approach-explained?utm_source=hashnode&utm_medium=feed)

[Nov 4, 2025](https://hashnode.com/posts/dsa-day3-top-k-frequent-elements-minheap-approach-explained/69095a31abaee98eda180937)

### [Dsa Day#2: Grouping Anagarams Of A String Together-hash Map Approach Explained](https://amit01.hashnode.dev/dsa-day2-grouping-anagarams-of-a-string-together-hash-map-approach-explained?utm_source=hashnode&utm_medium=feed)

\# Problem: GROUPING ANAGARAMS #Problem statement: Given an array of strings strs, group all anagrams together into sublists. You may return the output in any order. An anagram is a string that contains the same characters as another string, but the o...

2 min read · [amit01.hashnode.dev](https://amit01.hashnode.dev/dsa-day2-grouping-anagarams-of-a-string-together-hash-map-approach-explained?utm_source=hashnode&utm_medium=feed)

[Nov 3, 2025](https://hashnode.com/posts/dsa-day2-grouping-anagarams-of-a-string-together-hash-map-approach-explained/69081168387fd0722374a89c)

### [DSA Day #1: Two Sum – HashMap Approach Explained](https://amit01.hashnode.dev/dsa-day-1-two-sum-hashmap-approach-explained?utm_source=hashnode&utm_medium=feed)

\# Problem: Two Sum # Problem statement: Given an array of integers nums and an integer target, return the indices i and j such that nums\[i\] + nums\[j\] == target and i != j. You may assume that every input has exactly one pair of indices i and j that s...

1 min read · [amit01.hashnode.dev](https://amit01.hashnode.dev/dsa-day-1-two-sum-hashmap-approach-explained?utm_source=hashnode&utm_medium=feed)

[Nov 1, 2025](https://hashnode.com/posts/dsa-day-1-two-sum-hashmap-approach-explained/6905731362d0bbd03d127483)
