@dev-Amit

DSA DAY#5 : Contains Most Water

Nov 11, 2025 · 1 min read · #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 ...

DSA Day#4:Encoding & Deconding Strings

Nov 6, 2025 · 1 min read · #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...

DSA Day#3: Top k frequent elements, MinHeap Approach explained

Nov 4, 2025 · 2 min read · #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...

Dsa Day#2: Grouping Anagarams Of A String Together-hash Map Approach Explained

Nov 3, 2025 · 2 min read · # 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...

DSA Day #1: Two Sum – HashMap Approach Explained

Nov 1, 2025 · 1 min read · # 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...