Two Pointers and sliding Window | Part 29 | DSA in java in telugu | Engineering Animuthyam

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

[@vinayvatsavai6152]

Macha pdf lo video lo unna problems e kakunda similar problems Koda one or two ivvu macha interest unnavallu try chestharu ga

[@yamuna_murali]

Chala bagundhi macha😊
Give more problem in the description, then we can partice them.

[@heymister3040]

Thank you so much Macha 🤝

[@bezawadakarthik7675]

Please Increase the length of the video at least to 45Mins we are waiting whole day for video and it is 20mins not good bro please increase.

[@WORK-HARD-jm4cg]

video starting lo cheppav ga macha hint dhanitho chesesa
class Solution(object):
def arrayPairSum(self, nums):
nums.sort()
lis=[]
for i in range(0,len(nums)-1,2):
lis.append(min(nums[i:i+2]))

return sum(lis)

[@WORK-HARD-jm4cg]

sadhinchesa macha
class Solution(object):
def minimumCost(self, cost):
cost.sort()
n=len(cost)
x=n%3
v1=0
v2=0

for i in range(x,n,3):
v1=v1+cost[i]
for i in range(len(cost)):
v2=v2+cost[i]
return v2-v1

[@engineeringanimuthyam]

Ewwwwww thop 🔥

[@lavan1119]

bro increase videos length i mean no.of problems

[@Chintapakdamdam-e3d]

class Solution {
public int arrayPairSum(int[] nums) {
Arrays.sort(nums);
int ans=0;
for(int r=0;r

[@WORK-HARD-jm4cg]

after solution
class Solution(object):
def arrayPairSum(self, nums):
nums.sort()
sum=0
for i in range(0,len(nums)-1,2):
sum=sum+nums[i]

return sum

[@theoverthinker8320]

Did 1st one on my own..due to you bro.
class Solution {
public int arrayPairSum(int[] nums) {
int max =Integer.MIN_VALUE;
int l=0;
int sum=0;
Arrays.sort(nums);
for(int r=1;r

[@b.s.n.murthy8798]

thanks macha , chesesa

[@Chintapakdamdam-e3d]

Causal gane chappandi bro

[@bezawadakarthik7675]

Array Partition
class Solution {
public int arrayPairSum(int[] nums) {
Arrays.sort(nums);
int ans=0;
for(int i=0; i

[@theoverthinker8320]

broo 2nd dhi kuda nene chesa
class Solution {
public int minimumCost(int[] cost) {
Arrays.sort(cost);
int sum=0;
int temp=cost.length;
for(int i=cost.length-1;i>=0;i--){
if(i==temp-3){
temp=i;
continue;
}
sum+=cost[i];
}
return sum;
}
}

[@TarunKumarTadala]

class Solution {
public int arrayPairSum(int[] nums) {
Arrays.sort(nums);
int temp = 1;
int ans = 0;
for(int i=0; i

[@satyateja-ls7pk]

Array Partition:-
class Solution {
public int arrayPairSum(int[] nums) {
int l =0;
int sum =0;
Arrays.sort(nums);
for(int r =0;r

[@bezawadakarthik7675]

class Solution {
public int minimumCost(int[] cost) {
Arrays.sort(cost);
int n=cost.length;
int ans=0;
int d=0;
int c=0;
for(int i=n-1; i>=0; i--){
if(c

[@okvkrishna8512]

class Solution {
public int arrayPairSum(int[] nums) {
Arrays.sort(nums);
int sum=0;
for(int i=0;i