Java: Minimum Window Substring

Level : Intermediate
Mentor: Amit Kumar Ghosh
Type : GuidedLab
Points : 10
Duration : 00:30:00

Lab Details

Difficulty Level: HARD

Problem Statement:

Given two strings ‘s’ and ‘t’, return the minimum window in ‘s’ which will contain all the characters in `t`. If there is no such window in ‘s’ that covers all characters in ‘t’, return an empty string " ”.

Input:

nums = [1, 1, 1], k = 2

Output:

2 //The subarrays that sum up to 2 are [1, 1] and [1, 1]

Self-paced Membership
  • 24+ Video Courses
  • 825+ Hands-On Labs
  • 400+ Quick Notes
  • 125+ Skill Tests
  • 10+ Interview Q&A Courses
  • 10+ Real-world Projects
  • Career Coaching Sessions
  • Email Support
Upto 60% OFF
Know More
Still have some questions? Let's discuss.
CONTACT US
Accept cookies & close this