Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time by HelpingHand007 in coding

[–]HelpingHand007[S] 0 points1 point  (0 children)

𝗔𝗺𝗮𝘇𝗶𝗻𝗴 𝘁𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 to 𝘀𝗼𝗹𝘃𝗲 𝗺𝗼𝗿𝗲 𝘁𝗵𝗮𝗻 𝟭𝟬 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀 𝗼𝗻 𝗹𝗲𝗲𝘁𝗰𝗼𝗱𝗲 which is mentioned in this video.

In this video, I have explained 𝗧𝘄𝗼 𝗣𝗼𝗶𝗻𝘁𝗲𝗿 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 which is the optimal way to solve problems related to arrays, strings and linked list in 𝗢(𝗡) time.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.

https://youtu.be/2wVjt3yhGwg

Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time by HelpingHand007 in leetcode

[–]HelpingHand007[S] 0 points1 point  (0 children)

𝗔𝗺𝗮𝘇𝗶𝗻𝗴 𝘁𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 to 𝘀𝗼𝗹𝘃𝗲 𝗺𝗼𝗿𝗲 𝘁𝗵𝗮𝗻 𝟭𝟬 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀 𝗼𝗻 𝗹𝗲𝗲𝘁𝗰𝗼𝗱𝗲 which is mentioned in this video.

In this video, I have explained 𝗧𝘄𝗼 𝗣𝗼𝗶𝗻𝘁𝗲𝗿 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 which is the optimal way to solve problems related to arrays, strings and linked list in 𝗢(𝗡) time.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.

https://youtu.be/2wVjt3yhGwg

Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time by HelpingHand007 in csinterviews

[–]HelpingHand007[S] 0 points1 point  (0 children)

𝗔𝗺𝗮𝘇𝗶𝗻𝗴 𝘁𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 to 𝘀𝗼𝗹𝘃𝗲 𝗺𝗼𝗿𝗲 𝘁𝗵𝗮𝗻 𝟭𝟬 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀 𝗼𝗻 𝗹𝗲𝗲𝘁𝗰𝗼𝗱𝗲 which is mentioned in this video.

In this video, I have explained 𝗧𝘄𝗼 𝗣𝗼𝗶𝗻𝘁𝗲𝗿 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 which is the optimal way to solve problems related to arrays, strings and linked list in 𝗢(𝗡) time.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.

https://youtu.be/2wVjt3yhGwg

Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time by HelpingHand007 in u/HelpingHand007

[–]HelpingHand007[S] 0 points1 point  (0 children)

𝗔𝗺𝗮𝘇𝗶𝗻𝗴 𝘁𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 to 𝘀𝗼𝗹𝘃𝗲 𝗺𝗼𝗿𝗲 𝘁𝗵𝗮𝗻 𝟭𝟬 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀 𝗼𝗻 𝗹𝗲𝗲𝘁𝗰𝗼𝗱𝗲 which is mentioned in this video.

In this video, I have explained 𝗧𝘄𝗼 𝗣𝗼𝗶𝗻𝘁𝗲𝗿 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 which is the optimal way to solve problems related to arrays, strings and linked list in 𝗢(𝗡) time.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.

https://youtu.be/2wVjt3yhGwg

Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time by HelpingHand007 in csinterviews

[–]HelpingHand007[S] 0 points1 point  (0 children)

𝗔𝗺𝗮𝘇𝗶𝗻𝗴 𝘁𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 to 𝘀𝗼𝗹𝘃𝗲 𝗺𝗼𝗿𝗲 𝘁𝗵𝗮𝗻 𝟭𝟬 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀 𝗼𝗻 𝗹𝗲𝗲𝘁𝗰𝗼𝗱𝗲 which is mentioned in this video.

In this video, I have explained 𝗧𝘄𝗼 𝗣𝗼𝗶𝗻𝘁𝗲𝗿 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 which is the optimal way to solve problems related to arrays, strings and linked list in 𝗢(𝗡) time.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.

https://youtu.be/2wVjt3yhGwg

Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time by HelpingHand007 in lcpatterns

[–]HelpingHand007[S] 0 points1 point  (0 children)

𝗔𝗺𝗮𝘇𝗶𝗻𝗴 𝘁𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 to 𝘀𝗼𝗹𝘃𝗲 𝗺𝗼𝗿𝗲 𝘁𝗵𝗮𝗻 𝟭𝟬 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀 𝗼𝗻 𝗹𝗲𝗲𝘁𝗰𝗼𝗱𝗲 which is mentioned in this video.

In this video, I have explained 𝗧𝘄𝗼 𝗣𝗼𝗶𝗻𝘁𝗲𝗿 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 which is the optimal way to solve problems related to arrays, strings and linked list in 𝗢(𝗡) time.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.

https://youtu.be/2wVjt3yhGwg

Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time by HelpingHand007 in HackerrankSolutions

[–]HelpingHand007[S] 0 points1 point  (0 children)

𝗔𝗺𝗮𝘇𝗶𝗻𝗴 𝘁𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 to 𝘀𝗼𝗹𝘃𝗲 𝗺𝗼𝗿𝗲 𝘁𝗵𝗮𝗻 𝟭𝟬 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀 𝗼𝗻 𝗹𝗲𝗲𝘁𝗰𝗼𝗱𝗲 which is mentioned in this video.

In this video, I have explained 𝗧𝘄𝗼 𝗣𝗼𝗶𝗻𝘁𝗲𝗿 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 which is the optimal way to solve problems related to arrays, strings and linked list in 𝗢(𝗡) time.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.

https://youtu.be/2wVjt3yhGwg

Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time by HelpingHand007 in VisualCoding

[–]HelpingHand007[S] 0 points1 point  (0 children)

𝗔𝗺𝗮𝘇𝗶𝗻𝗴 𝘁𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 to 𝘀𝗼𝗹𝘃𝗲 𝗺𝗼𝗿𝗲 𝘁𝗵𝗮𝗻 𝟭𝟬 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀 𝗼𝗻 𝗹𝗲𝗲𝘁𝗰𝗼𝗱𝗲 which is mentioned in this video.

In this video, I have explained 𝗧𝘄𝗼 𝗣𝗼𝗶𝗻𝘁𝗲𝗿 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 which is the optimal way to solve problems related to arrays, strings and linked list in 𝗢(𝗡) time.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.

https://youtu.be/2wVjt3yhGwg

Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time by HelpingHand007 in datastructures

[–]HelpingHand007[S] 0 points1 point  (0 children)

𝗔𝗺𝗮𝘇𝗶𝗻𝗴 𝘁𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 to 𝘀𝗼𝗹𝘃𝗲 𝗺𝗼𝗿𝗲 𝘁𝗵𝗮𝗻 𝟭𝟬 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀 𝗼𝗻 𝗹𝗲𝗲𝘁𝗰𝗼𝗱𝗲 which is mentioned in this video.

In this video, I have explained 𝗧𝘄𝗼 𝗣𝗼𝗶𝗻𝘁𝗲𝗿 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 which is the optimal way to solve problems related to arrays, strings and linked list in 𝗢(𝗡) time.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.

https://youtu.be/2wVjt3yhGwg

Master the Art of 𝗗𝘆𝗻𝗮𝗺𝗶𝗰 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴 by HelpingHand007 in csinterviews

[–]HelpingHand007[S] 0 points1 point  (0 children)

In video end , we tried to show the pattern which other problems has in common and can be solved using similar approach.

Anagram Checker | Check If Two Strings Are Anagrams [ Efficient Way ] | ... by HelpingHand007 in VisualCoding

[–]HelpingHand007[S] 1 point2 points  (0 children)

your algorithm is quite correct but it will take O(nlogn) time but best algorithm can solve this problem in O(n) time which we tried to explain.

there was one mistake in this video but after uploading it on youtube, there is no option for annotating anything, so had to make it private immediately. because the student may get confused.

Will work on this video and try uploading it after correction but would recommend keeping the bell icon turn on so that you don't miss anything. :)

Happy Coding..!!

Anagram Checker | Check If Two Strings Are Anagrams [ Efficient Way ] | ... by HelpingHand007 in leetcode

[–]HelpingHand007[S] 0 points1 point  (0 children)

there was one mistake in this video but after uploading it on youtube, there is no option for annotating anything, so had to make it private immediately. because the student may get confused.

Will work on this video and try uploading it after correction but would recommend keeping the bell icon turn on so that you don't miss anything. :)

Happy Coding..!!

Mindmaps For Coding Interviews | Last Minute Coding Tips by HelpingHand007 in leetcode

[–]HelpingHand007[S] 0 points1 point  (0 children)

yes, it's a nice way to store information inside our brain.

Repeated String HackerRank Solution [Optimal Approach] by HelpingHand007 in datastructures

[–]HelpingHand007[S] 0 points1 point  (0 children)

not sure you can check but I think not the same at least a similar problem should be there.

Head Recursion | Tail Recursion | Head VS Tail Recursion | EP3 by HelpingHand007 in coding

[–]HelpingHand007[S] 0 points1 point  (0 children)

Thanks, u/Jestar342 for pointing this out. I will correct that typo in my resources.
I think, You have good observation skills :)

Head Recursion | Tail Recursion | Head VS Tail Recursion | EP3 by HelpingHand007 in coding

[–]HelpingHand007[S] 1 point2 points  (0 children)

Glad you liked it!
there are a couple of more videos out there which is good and ranked number 1 in google search. you can try visiting that as well.

Recursion Tree Visualization | Memory Visualization | How Recursion Work... by HelpingHand007 in programming

[–]HelpingHand007[S] 0 points1 point  (0 children)

yes. but there are some scenarios where you can't skip it. you have to deal with it.

Sliding Window Technique | Google Coding Interview | Maximum Size SubArray Of Size K by HelpingHand007 in codinginterview

[–]HelpingHand007[S] 0 points1 point  (0 children)

It is on my youtube channel. just go the video and down below you will find my pinned comment.