Count pairs with given sum | GFG, Leetcode | Easy Explanation and C++ Code | Jaldi click karo

preview_player
Показать описание
Hello, I am Neeraj Mahapatra,

Today, we will discuss a problem Count pairs with a given sum. It's basically an easy-level problem in gfg.

Timecodes
00:00 - Intro
00:42 - Question explanation(Count pairs with a given sum)
01:42 - Brute force approach
04:22 - O(N) approach
10:28 - O(N) Code

Hope you like this video...
Please SUBSCRIBE, LIKE AND COMMENT...
Share to show Support..

Support us !!!.....Thanks....❤
Рекомендации по теме
Комментарии
Автор

amazing explanation sir, but please improve video quality it is not good

ujjwalkumar
Автор

Thank you.. after 2 or 3 videos. finally, I understood it completely

triptitiwari
Автор

best explanation
you just got a subscriber

sourabh
Автор

I like the way of explaining Question and Answer. And the clip that you inserted between the video.Thank you Bhaiya for explaining .I have been watching your videos from last 2 month .Keep Improving🤞🤞

shivkumarshah
welcome to shbcf.ru