String - 15: Max sub-string length with same letters if max 'K' characters can be replaced | Java

Показать описание

Solution:
- We iterate each character one by one & add into map & increase the frequency by one
- We also maintain maxFrequency for any letter
- We update maxLength as end - start + 1
- Now at every iteration, we check if end - start + 1 - maxFrequency is greater than k, then we need to remove it from map so we decrease the frequency by 1
- At last, we return maxLength

Time Complexity: O(n), where n is number of characters in String
Space Complexity: O(1)

CHECK OUT CODING SIMPLIFIED

★☆★ VIEW THE BLOG POST: ★☆★

I started my YouTube channel, Coding Simplified, during Dec of 2015.
Since then, I've published over 500+ videos.

★☆★ SUBSCRIBE TO ME ON YOUTUBE: ★☆★

★☆★ Send us mail at: ★☆★

Рекомендации по теме

Комментарии

Very nicely explained. I watched many videos but no one could explain it well... You did a great job👍

KaranjitKaur

Thank you for this. My problem was why we don't reduce maxFreq, it is that if we already have a length from the maxFreq we cannot do better length until our freq increases. So if we ignore if it reduces it will not affect our final answer. Thanks again.

Megabushbuck

Greatest explanation ever of this problem. ✌️

biswajitsingh

You made this tricky problem so easier man. Thanks!

shradheytripathi

Very nicely explained, Sir, thank you so much :)

gokulnaathb

We need to remove " k<=0 "in base case because s="AAAA" and k=0 input its give -1 output but actual answer is 4.

jaykava

what if the if condition: if(end-start+1 - maxFrequency > k) is till not valid after you move the start++? I so i think you might need another for loop to keep move the start to it's right until that if condition matches?

po-shengwang

Thank you man.Could you make videos on Sets Data Structure please? Love from Bangladesh

Selim_Hasan_Raj

can u make a video on how the *.conains()* method works in a hash set in O(1) time??

mohammedsadiq

String - 15: Max sub-string length with same letters if max 'K' characters can be replaced | Java

String - 15: Max sub-string length with same letters if max 'K' characters can be replaced...

Longest Repeating Character Replacement - Leetcode 424 - Python

split a string into the max number of unique substrings leetcode

Leetcode 3. Longest Substring Without Repeating Characters

Maximum Sub-String after at most K changes| Easiest Solution💥😃Problem of the Day #geeksforgeeks...

Longest Substring Without Repeating Characters | Amazon

Length of longest substring without repeating characters | LeetCode problem number 3

Solar String sizing for the inverter | Solar Energy System Design | edX Series

Creating your own Cron Job Scheduler

LeetCode 1156 | Swap For Longest Repeated Character Substring

To Search Frequency of a Substring in a given String

LeetCode 459. Repeated Substring Pattern (Algorithm Explained)

Longest palindromic substring | Dynamic programming

Kobalt 40V 15in String Trimmer: How to replace string

Victor thruster F enhanced edition withVBS66 string@victor@badminton #victor #racketgame #badminton

#leetcode 3 length of longest substring without repeating chars #code #programming #algorithms

DeWalt’s New 60v MAX [DCST972] Cordless Brushless String Trimmer Multi-Tool (Multiple ATTACHMENTS)

DEWALT's New 60V MAX* 17 in. Brushless Attachment-Capable String Trimmer

05 - Longest Substring with same letters after Replacement || Sliding Window || Interview Prep

Know the Difference: Subarray vs Substring vs Subsequence vs Subset

How to replace reload string on Dewalt trimmer - 20V or 60V

Longest Substring Without Repeating Characters | Leetcode 3 | Sliding window

Longest substring without repeating characters | leetcode | python | leetcode 3 | Amazon

Longest Substring No Duplicates -Javascript