Variable size sliding window | Part 34 | DSA in java in telugu | Engineering Animuthyam
ฝัง
- เผยแพร่เมื่อ 30 ก.ย. 2024
- Free Java dsa course in Telugu | Engineering Animuthyam
Free Java dsa course in Telugu
Website link:
vigneshreddyjulakanti.in
Insta:
Engineering Animuthyam
Dsa in telugu
from scratch
easy
hd
simple
telugu engineering
dsa
coding
programming
engineering
engineering animuthyam.
jobs
high paying jobs
road maps
Dsa in telugu
Mern stack
Python
Java
M1
Daa
Placements
Btech
IIt
Nit
Eamcet
#coding #telugu #job #python #telugumemes #trendingreels #btech #college #java #javacoding #iit
#nit #jee #eamcet #dsa
Macha java or python okate cheppu macha . Please gap vachesthundhi. Memu ardham chesukogalam neku full time job and other works so oka language full pledged ga complete chey macha . Tharavatha vere language ki vellu please.
bro, please increase the time. At least oka pani chey bro, ippudu sliding window chpthunnav kadha inthakmundu already array list,arrays,strings meedha chesam kadha.. vaati meedha cover chesina topics varaku leetcode lo qns home work laga ivvu.. so that videos late aina time thakkuva chesina videos vi we can still practice dsa and consistent ga undagalgutham. Ee oka help they macha.. 'coz time thakkuva ayyesariki consistency pothundhemo anipistundi
Anna emindhi anna emina problem aa ?? 2 days nunchi lectures raledhu daily cheydanki try chey anna pls
Linked list is very important but you should teach before hash concept right?
Macha Part 35?
Hi anna Resume ela Cheyalo Free Templetes and Ne Resume tho explain chesi oka Video Chey bro ATS Resume.
Macha video radha ?
nv cheppinadhi problem solved by myself bro....tq so much
bro same logic ee kada before problem lane....adhi try chesa vacindhi successful ga, but logic matram meru cheppakane inka clear ga ardamayindhi
solved it myself!!
without sliding window
class Solution(object):
def findMaxConsecutiveOnes(self, nums):
temp=0
ans=0
for i in nums:
if i==1:
temp=temp+1
if i!=1:
temp=0
ans=max(ans,temp)
return ans
Idhi vere question. Easy level question
macha koncham video length increase chey and topics kocham fast ga complete chey
class Solution {
public int longestOnes(int[] nums, int k) {
int maxNoOfOnes=0;
int l=0;
int countOfZeroes=0;
for(int r=0;rk){
if(nums[l]==0){
countOfZeroes--;
}
l++;
}
maxNoOfOnes=Math.max(r-l+1,maxNoOfOnes);
}
return maxNoOfOnes;
}
}
bro increase the duration,really its too good. waiting for next lecture
Ha macha I understood.
Problem em ante I am getting very little time to do youtube videos. Chala other works unai full time job and others. But mi kosam consistent ga videos tedaniki try chestha macha.
always waiting for you classes
@@engineeringanimuthyam hii I'm studying MCA 2nd year ...my graduation will complete on 2024 October...now i would like to learn DSA from beginner...so if I learn this it will take around 1 year to learn..so the company's hire me or not..(and I'm tier 3 MCA college... Could you give me response...how much time to take Learn DSA From beginng....and I know python,html,css, javascript,sql learning...
@@engineeringanimuthyam
@engineeringanimuthyam hii I'm studying MCA 2nd year ...my graduation will complete on 2025 October...now i would like to learn DSA from beginner...so if I learn this it will take around 1 year to learn..so the company's hire me or not..(and I'm tier 3 MCA college... Could you give me response...how much time to take Learn DSA From beginng....and I know python,html,css, javascript,sql learning
vere level bro teaching excellent
done with if as well as while loop
class Solution(object):
def longestOnes(self, nums, k):
l=0
count=0
temp=0
ans=0
for r in range(len(nums)):
if nums[r]==0:
count=count+1
if count>k:
if nums[l]==0:
count=count-1
l=l+1
if count
class Solution {
public int longestOnes(int[] nums, int k) {
int n = nums.length;
int left = 0;
int max = 0;
int count = 0;
for(int r = 0; r k){
if(nums[left] == 0){
count--;
}
left++;
}
max = Math.max(max,r-left+1);
}
return max;
}
}
class Solution {
public int longestOnes(int[] nums, int k) {
int n = nums.length;
int l = 0;
int ans = 0;
int count =0;
for(int r = 0; r< n; r++){
if(nums[r] == 0){
count++;
}
while(count > k){
if(nums[l] == 0 ){
count--;
}
l++;
}
ans = Math.max(ans, (r-l+1));
}
return ans;
}
}
goooooooooooooooooooooooooooooooood
Macha emaindhi?
class Solution {
public int longestOnes(int[] nums, int k) {
int l=0;
int temp=0;
int ans=0;
for(int r=0;rk)
{
if(nums[l]==0)
{
temp--;
}
l++;
}
ans=Math.max(ans,r-l+1);
}
return ans;
}
}
Macha nee explanation tho ee problem ni just ala oka 10 mins lo chsesa nice macha keep going
class Solution {
public int longestOnes(int[] arr, int k) {
int l = 0;
int count_ones = 0;
int count_zero = 0;
int ans = 0;
for(int r = 0; rk) {
if(arr[l]==1) count_ones--;
if(arr[l]==0) count_zero--;
l++;
}
ans = Math.max(ans, count_ones+count_zero);
}
return ans;
}
}
20 mins alochinchamanv kada edi chesa 17 mins lo chesa taruvata video chusa navvu kunna solution munde rasa ani
Anna add more problems. Chala intresting undhi. Your teaching is like a pro. One more request anna do more lectures every day
Ha macha I understood.
Problem em ante I am getting very little time to do youtube videos. Chala other works unai full time job and others. But mi kosam consistent ga videos tedaniki try chestha macha.
bro pls increase the duration so that we can solve more problems in short period of time
Ha macha I understood.
Problem em ante I am getting very little time to do youtube videos. Chala other works unai full time job and others. But mi kosam consistent ga videos tedaniki try chestha macha.
❤❤❤❤❤