---
title: "Chetan Datta (@chetan77) | Hashnode"
description: "Software Engineer. Read the latest articles by Chetan Datta on Hashnode."
url: "https://hashnode.com/@chetan77"
---

@chetan77

# Chetan Datta

@chetan77 · Hyderabad, India · Joined August 2023

Software Engineer

[Website](https://linktr.ee/chetandatta)

### [Number of Substrings Containing All Three Characters](https://chetan77.hashnode.dev/number-of-substrings-containing-all-three-characters?utm_source=hashnode&utm_medium=feed)

Problem Given a string s consisting only of characters a, b and c. Return the number of substrings containing at least one occurrence of all these characters a, b and c. link Example 1: Input: s = "ab

5 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/number-of-substrings-containing-all-three-characters?utm_source=hashnode&utm_medium=feed)

[Nov 9](https://hashnode.com/posts/number-of-substrings-containing-all-three-characters/6af19249f2a16b5b3eb0da23)

### [Minimum Window Subsequence](https://chetan77.hashnode.dev/minimum-window-subsequence?utm_source=hashnode&utm_medium=feed)

Problem You are given two strings, s1 and s2. Your task is to find the smallest substring in s1 such that s2 appears as a subsequence within that substring. The characters of s2 must appear in the sa

4 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/minimum-window-subsequence?utm_source=hashnode&utm_medium=feed)

[Nov 5](https://hashnode.com/posts/minimum-window-subsequence/6aecb07b83f0cac08ddb2a3c)

### [Minimum Window Substring](https://chetan77.hashnode.dev/minimum-window-substring?utm_source=hashnode&utm_medium=feed)

Problem Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is

4 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/minimum-window-substring?utm_source=hashnode&utm_medium=feed)

[Nov 5](https://hashnode.com/posts/minimum-window-substring/6aec4910d9d60d49bf62a3ce)

### [Longest Repeating Character Replacement](https://chetan77.hashnode.dev/longest-repeating-character-replacement?utm_source=hashnode&utm_medium=feed)

Problem You are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform this operation at most k times. Re

5 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/longest-repeating-character-replacement?utm_source=hashnode&utm_medium=feed)

[Nov 3](https://hashnode.com/posts/longest-repeating-character-replacement/6ae9e60b548f244d0a07bf0f)

### [Longest Substring with At Most K Distinct Characters](https://chetan77.hashnode.dev/longest-substring-with-at-most-k-distinct-characters?utm_source=hashnode&utm_medium=feed)

Problem Given a string str and an integer K, return the length of the longest substring containing at most K distinct characters. A substring is a continuous part of the string. You cannot skip chara

4 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/longest-substring-with-at-most-k-distinct-characters?utm_source=hashnode&utm_medium=feed)

[Nov 2](https://hashnode.com/posts/longest-substring-with-at-most-k-distinct-characters/6ae85e35ccf2d2a916990ccb)
