How To Remove Duplicates From Sorted Array ( LeetCode 26 ) | FREE DSA Course in JAVA | Lecture 65

preview_player
Показать описание
We are going to solve a Leetcode problem number 26 in which you have to write a program to remove duplicates from a sorted array.

So for a given sorted array like 2,3,3,4,4,6,6 you have to remove the duplicate elements and return the array in the form 2,3,4,6.

Now there is a simple brute-force approach to this program where you can use two variables and check linearly the duplicates.

But as a student of coding who is learning DSA, you must always look for an optimal solution that consumes the least time.

Let's see how we can more efficiently solve this program of removing duplicates from an array.

or call us at 8884881203

#java #array #programming #arrayjava #dsa #dsaplaylist #dsacourse #programmer #job #placementtraining
Рекомендации по теме
Комментарии
Автор

I HAVE NEVER SEEN ANYONE EXPLAIN LIKE THIS.❤

Ratan_tata_jii
Автор

this is man is the best teacher. i never see before. my God bless you and your family aamiin

abdihaashin
Автор

Brother thank you so much for taking your time to explain the logic, lots of you-tubers rush through to make their video short . Please upload more videos like this and explain it slowly. Thanks again, and GOD BLESS

ahsankazi
Автор

Simply Awesome brother ---- My suggestion is Could you please teach with Real-life Examples taking Eggs, or any items to Explain Clearly for Better Understanding to students ... Thank you for your Teaching Style

MohammedSameer-rxrz
Автор

I have never come across such wonderful explanation video. Thankyou so much bro for the video 😊.

ManishJaiswal-shjm
Автор

Solution without temporary array is amazing!

shubhammanecr
Автор

Love your way of teaching model specially virually representation

ANNJEBA
Автор

I rarely comment on youtube videos, but I must say this video is superb and well explained. You made it really simple, most especially when you mentioned you needed two persons to go through the you

zainabalayande
Автор

Very nice explanation: This whole world of teaching is sucks.. and f ks.. naming variables with i and j 's but your naming variable's in meaningful manner which really helps alot for junior to senior. I bow you . Please keep doing many more. I will share my friends what's groups

srin
Автор

no one is explain like this thank you so much sir

naidulipsa
Автор

Just amazing explanation ❤ thanks alot

ankithareddy
Автор

Sir please tell me where you mention, that first element will be same as of previous array's first element in main code. Please tell me 😢

Space_Wonderland
Автор

Thank you bro you explanation is super

shanmukhasridharreddypittu
Автор

sir please upload more videos of dsa topics

KHEMCHAND-lm
Автор

sir 169ms runtime, is it good or bad ?

ashutosh_code
Автор

This will work for unsorted array??
And we can use hashmap for unsorted array

dipakbadgujar
Автор

LeetCode must put your solutions in their Editorial section. Credit must be given to you.

pragmaticcoder
Автор

The duplicate elements are continuosly placed one another so only its working but if the duplicate elements are placed randomly means it will not work properly so please checkout this problem and correct code

vishalsmart
Автор

Sir can we also provide Python code at the same time....concepts are clear but understaing the Java is bit difficult

sachinChaudhary-ok
Автор

What is time complexity of this algorithm?

ryanafzal
welcome to shbcf.ru