Smallest subarray with sum greater than x | Hindi | GFG | Problem Solving | FAANG | Shashwat
Vložit
- čas přidán 17. 07. 2021
- Java Plus DSA Complete Placement Course:
• Java and DSA Course Pl...
Problem Statement:
Given an array of integers (A[]) and a number x, find the smallest subarray with sum greater than the given value.
Note: The answer always exists. It is guaranteed that x doesn't exceed the summation of a[i] (from 1 to N).
Problem Link:
practice.geeksforgeeks.org/pr...
Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe
Instagram Handle: (@shashwat_tiwari_st)
shashwattiwari.page.link/shas...
#ShashwatTiwari #coding #problemsolving #leetcode #hackerrank #hackerearth #codechef #codesignal #algorithms #javaprogramming #sde #placement #programming
This is a very old video, for better sound and camera quality DSA videos, learn from the below playlist!
Java Plus DSA ( Java + DSA + Problem Solving )
czcams.com/play/PLQ7ZAf76c0ZPVdhV1bAjFv0bQc1xHURzE.html
Very well explained.
Also, Code is not working for all test cases. Please update with new solution.
Checked, it's working!
code is in description, can you try that once. Gfg one.
Very nicely explained keep it up.....
Share & Support!!
agr hum array ko sort krde or last se add kre to 19+54>x ho rha to ye min length h pr ye ans kyu nhi h
Sort krne ke baad subarrays change ho jaenge na!
can someone please explain me the concept behid the MAX_VALUE function
Integer.MAX_VALUE gives the maximum possible value of range of integers in java. You can follow below playlist, it is more structured, first video of this playlist has list of topics as well. you skip the topics that you already know. czcams.com/play/PLQ7ZAf76c0ZPVdhV1bAjFv0bQc1xHURzE.html
bhai intro hata de 30 sec waster hore har baar