HackerRank Solutions
7.73K subscribers
17 photos
1 file
100 links
All HackerRank practice problem tutorials in java
Download Telegram
Hello Coding Lover,
Just Learn this Amazing technique which is discussed in this tutorial and you will be able to solve more than 10 questions on leetcode.

In this video, I have explained two pointer technique which is the optimal way to solve problems related to arrays, strings and linked list in O(N) 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
๐Ÿ”ด DONT CLICK THIS: https://bit.ly/2G4cEuc
#JAVAAID #slidingwindowtechnique #leetcode #javaAidTutorials #programming #dataStructures #algorithms #coding #competitiveprogramming #google #java #codinginterview #problemsolving #kanahaiyaGupta #google #facebook #amazon #oracle #linkedin
Hello Coding Lover,

In this video tutorial, I have explained the beautiful problem-solving technique called ๐—ฅ๐—ฒ๐—ฐ๐˜‚๐—ฟ๐˜€๐—ถ๐—ผ๐—ป and its applications.

If you can visualize this 2D image in 3D then probably you would have heard of ๐—ฅ๐—ฒ๐—ฐ๐˜‚๐—ฟ๐˜€๐—ถ๐—ผ๐—ป.

๐‘บ๐’๐’Ž๐’† ๐’•๐’Š๐’Ž๐’†๐’” ๐’Ž๐’‚๐’Œ๐’Š๐’๐’ˆ ๐’‚ ๐’•๐’‰๐’–๐’Ž๐’ƒ๐’๐’‚๐’Š๐’ ๐’˜๐’Š๐’๐’ ๐’•๐’‚๐’Œ๐’† ๐’Ž๐’๐’“๐’† ๐’•๐’Š๐’Ž๐’† ๐’•๐’‰๐’‚๐’ ๐’•๐’–๐’•๐’๐’“๐’Š๐’‚๐’ :)

๐—ก๐—ผ๐˜๐—ฒ: if you find it useful, please do not forget to like and share your feedback in comments.

https://youtu.be/Sf-LR7OI-Ww

#JAVAAID #recursion #leetcode #javaAidTutorials #programming #dataStructures #algorithms #coding #competitiveprogramming #google #java #codinginterview #problemsolving #kanahaiyaGupta #google #facebook #amazon #oracle #linkedin
Have you ever thought of how ๐—ฟ๐—ฒ๐—ฐ๐˜‚๐—ฟ๐˜€๐—ถ๐—ผ๐—ป ๐˜„๐—ผ๐—ฟ๐—ธ๐˜€ ๐—ถ๐—ป๐˜๐—ฒ๐—ฟ๐—ป๐—ฎ๐—น๐—น๐˜†?
if not, watch this video to know the ๐—ถ๐—ป๐˜๐—ฒ๐—ฟ๐—ป๐—ฎ๐—น๐˜€ ๐—ผ๐—ณ ๐—ฟ๐—ฒ๐—ฐ๐˜‚๐—ฟ๐˜€๐—ถ๐—ผ๐—ป.

In this video, I have ๐—บ๐—ผ๐—ฑ๐—ถ๐—ณ๐—ถ๐—ฒ๐—ฑ ๐—ฎ ๐—ฝ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ ๐—ถ๐—ป ๐˜€๐˜‚๐—ฐ๐—ต ๐—ฎ ๐˜„๐—ฎ๐˜† that it will ๐˜๐—ฒ๐—ฎ๐—ฐ๐—ต ๐˜†๐—ผ๐˜‚ ๐—ฎ๐—ฏ๐—ผ๐˜‚๐˜ ๐—ฟ๐—ฒ๐—ฐ๐˜‚๐—ฟ๐˜€๐—ถ๐—ผ๐—ป ๐—ถ๐—ป๐˜๐—ฒ๐—ฟ๐—ป๐—ฎ๐—น which will help you in ๐˜ƒ๐—ถ๐˜€๐˜‚๐—ฎ๐—น๐—ถ๐˜‡๐—ถ๐—ป๐—ด ๐—ฟ๐—ฒ๐—ฐ๐˜‚๐—ฟ๐˜€๐—ถ๐˜ƒ๐—ฒ ๐—ฎ๐—น๐—ด๐—ผ๐—ฟ๐—ถ๐˜๐—ต๐—บ๐˜€.

Here are the outlines for easy navigation:-
๐Ÿ‘‰ Recursion Flow Chart
๐Ÿ‘‰ Recursion Execution Flow
๐Ÿ‘‰ Tree Visualization
๐Ÿ‘‰ Memory Visualization
๐Ÿ‘‰ Demo

๐—ก๐—ผ๐˜๐—ฒ: if you find it useful, please do not forget to like and share your feedback in comments.

https://lnkd.in/fnEEdKs

#JAVAAID #recursion-visualization #leetcode #javaAidTutorials #programming #recurion-basics #recursion-tutorial #algorithms #coding #competitiveprogramming #google #java #codinginterview #problemsolving #kanahaiyaGupta #google #facebook #amazon #oracle #linkedin
Hey Coding Lover,

This is the next tutorial in our recursion series. So far, we have learnt how ๐—ฟ๐—ฒ๐—ฐ๐˜‚๐—ฟ๐˜€๐—ถ๐—ผ๐—ป ๐˜„๐—ผ๐—ฟ๐—ธ๐˜€ ๐—ถ๐—ป๐˜๐—ฒ๐—ฟ๐—ป๐—ฎ๐—น๐—น๐˜†?

Now it is time to dig deeper and understand ๐—ฟ๐—ฒ๐—ฐ๐˜‚๐—ฟ๐˜€๐—ถ๐—ผ๐—ป ๐˜๐˜†๐—ฝ๐—ฒ๐˜€ ๐—ฎ๐—ป๐—ฑ ๐—ฑ๐—ถ๐—ณ๐—ณ๐—ฒ๐—ฟ๐—ฒ๐—ป๐—ฐ๐—ฒ ๐—ฏ๐—ฒ๐˜๐˜„๐—ฒ๐—ฒ๐—ป ๐—ถ๐˜.

In this video, I have tried my best to explain the ๐—ต๐—ฒ๐—ฎ๐—ฑ ๐—ฎ๐—ป๐—ฑ ๐˜๐—ฎ๐—ถ๐—น ๐—ฟ๐—ฒ๐—ฐ๐˜‚๐—ฟ๐˜€๐—ถ๐—ผ๐—ป ๐—ฎ๐—ป๐—ฑ ๐˜๐—ต๐—ฒ ๐—ฑ๐—ถ๐—ณ๐—ณ๐—ฒ๐—ฟ๐—ฒ๐—ป๐—ฐ๐—ฒ ๐—ฏ๐—ฒ๐˜๐˜„๐—ฒ๐—ฒ๐—ป ๐—ถ๐˜, ๐˜ƒ๐—ถ๐—ฎ ๐—ฎ๐—ป๐—ถ๐—บ๐—ฎ๐˜๐—ถ๐—ผ๐—ป.
which will help you in ๐˜ƒ๐—ถ๐˜€๐˜‚๐—ฎ๐—น๐—ถ๐˜‡๐—ถ๐—ป๐—ด ๐—ฟ๐—ฒ๐—ฐ๐˜‚๐—ฟ๐˜€๐—ถ๐˜ƒ๐—ฒ ๐—ฎ๐—น๐—ด๐—ผ๐—ฟ๐—ถ๐˜๐—ต๐—บ๐˜€.
Here are the outlines for easy navigation:-

๐Ÿ‘‰ [๐Ÿฌ๐Ÿฌ:๐Ÿฐ๐Ÿญ] ๐—›๐—ฒ๐—ฎ๐—ฑ ๐—ฅ๐—ฒ๐—ฐ๐˜‚๐—ฟ๐˜€๐—ถ๐—ผ๐—ป
๐Ÿ‘‰ [๐Ÿฌ๐Ÿฒ:๐Ÿญ๐Ÿฐ] ๐—ง๐—ฎ๐—ถ๐—น ๐—ฅ๐—ฒ๐—ฐ๐˜‚๐—ฟ๐˜€๐—ถ๐—ผ๐—ป
๐Ÿ‘‰ [๐Ÿญ๐Ÿญ:๐Ÿฎ๐Ÿฏ] ๐—›๐—ฒ๐—ฎ๐—ฑ ๐—ฉ๐—ฆ ๐—ง๐—ฎ๐—ถ๐—น ๐—ฅ๐—ฒ๐—ฐ๐˜‚๐—ฟ๐˜€๐—ถ๐—ผ๐—ป
๐Ÿ‘‰ [๐Ÿญ๐Ÿฑ:๐Ÿฌ๐Ÿฎ] ๐——๐—ฒ๐—บ๐—ผ
๐Ÿ‘‰ [๐Ÿญ๐Ÿด:๐Ÿฌ๐Ÿฒ] ๐—ค๐˜‚๐—ถ๐—ฐ๐—ธ ๐—ค๐˜‚๐—ถ๐˜‡?

๐—ก๐—ผ๐˜๐—ฒ: if you find it useful, please do not forget to like and share your feedback in comments.
https://youtu.be/lG6HxO7cDRw
#JAVAAID #headrecursion #tailrecursion #headvstailrecursion #leetcode #javaAidTutorials #programming #recursion-basics #recursion-tutorial #algorithms #coding #competitiveprogramming #google #java #problemsolving #kanahaiyaGupta
Hi Coding Lover,

Here is one more tutorial which will ๐—ฒ๐—ป๐—ต๐—ฎ๐—ป๐—ฐ๐—ฒ ๐˜†๐—ผ๐˜‚๐—ฟ ๐—ฑ๐—ฒ๐—ฏ๐˜‚๐—ด๐—ด๐—ถ๐—ป๐—ด ๐˜€๐—ธ๐—ถ๐—น๐—น๐˜€.

Today, I have explained how to ๐˜ƒ๐—ถ๐˜€๐˜‚๐—ฎ๐—น๐—ถ๐˜‡๐—ฒ ๐˜†๐—ผ๐˜‚๐—ฟ ๐—ฐ๐—ผ๐—ฑ๐—ฒ ๐—ฒ๐˜…๐—ฒ๐—ฐ๐˜‚๐˜๐—ถ๐—ผ๐—ป ๐—ณ๐—น๐—ผ๐˜„ and get help from others if you stuck.

It supports most of the language like ๐—–, ๐—–++, ๐—๐—ฎ๐˜ƒ๐—ฎ, ๐—๐—ฎ๐˜ƒ๐—ฎ๐—ฆ๐—ฐ๐—ฟ๐—ถ๐—ฝ๐˜, ๐—ง๐˜†๐—ฝ๐—ฒ๐—ฆ๐—ฐ๐—ฟ๐—ถ๐—ฝ๐˜, ๐—ฅ๐˜‚๐—ฏ๐˜† etc.

๐—ก๐—ผ๐˜๐—ฒ: if you find it useful, please do not forget to like and share your feedback in comments.

https://youtu.be/TRMKJucB3B8

#JAVAAID #leetcode #javaAidTutorials #programming #recursion-basics #recursion-tutorial #algorithms #coding #competitiveprogramming #google #java #problemsolving #kanahaiyaGupta #pythontutor #execution
Hi Coding Lover,

In this tutorial, I have covered the most common dynamic programming interview question ๐—Ÿ๐—ผ๐—ป๐—ด๐—ฒ๐˜€๐˜ ๐—–๐—ผ๐—บ๐—บ๐—ผ๐—ป ๐—ฆ๐˜‚๐—ฏ๐˜€๐˜๐—ฟ๐—ถ๐—ป๐—ด which is usually asked in product-based MNC's.

Here I have explained the ๐—ณ๐—ผ๐˜‚๐—ฟ ๐—ฑ๐—ถ๐—ณ๐—ณ๐—ฒ๐—ฟ๐—ฒ๐—ป๐˜ ๐˜„๐—ฎ๐˜†๐˜€ ๐˜๐—ผ ๐˜€๐—ผ๐—น๐˜ƒ๐—ฒ ๐˜๐—ต๐—ถ๐˜€ ๐—ฝ๐—ฟ๐—ผ๐—ฏ๐—น๐—ฒ๐—บ and below are the outlines-

๐—ง๐—ฎ๐—ฏ๐—น๐—ฒ ๐—ผ๐—ณ ๐—–๐—ผ๐—ป๐˜๐—ฒ๐—ป๐˜:
๐Ÿ‘‰[00:15] Problem statement
๐Ÿ‘‰[02:17] Longest common substring
๐Ÿ‘‰[03:00] Algorithm
๐Ÿ‘‰[06:54] Recurrence relation
๐Ÿ‘‰[08:00] Recursive solution
๐Ÿ‘‰[09:42] Recurrence tree
๐Ÿ‘‰[11:52] Top-down approach with memoization
๐Ÿ‘‰[13:30] Bottom-up approach/ DP solution
๐Ÿ‘‰[19:20] Demo

๐—ก๐—ผ๐˜๐—ฒ: if you find it useful, please do not forget to like and share your feedback in comments.

https://lnkd.in/faC5uGu

#JAVAAID #lcs #longestcommonsubstring #leetcode #javaAidTutorials #programming #algorithms #coding #competitiveprogramming #google #java #problemsolving #kanahaiyaGupta
Hi Coding Lover,
In this tutorial, I have covered one more common dynamic programming interview question ๐—Ÿ๐—ผ๐—ป๐—ด๐—ฒ๐˜€๐˜ ๐—–๐—ผ๐—บ๐—บ๐—ผ๐—ป ๐—ฆ๐˜‚๐—ฏ๐˜€๐—ฒ๐—พ๐˜‚๐—ฒ๐—ป๐—ฐ๐—ฒ which is also asked in a lot of product-based MNC's.

Here I have explained the ๐—ณ๐—ผ๐˜‚๐—ฟ ๐—ฑ๐—ถ๐—ณ๐—ณ๐—ฒ๐—ฟ๐—ฒ๐—ป๐˜ ๐˜„๐—ฎ๐˜†๐˜€ ๐˜๐—ผ ๐˜€๐—ผ๐—น๐˜ƒ๐—ฒ ๐˜๐—ต๐—ถ๐˜€ ๐—ฝ๐—ฟ๐—ผ๐—ฏ๐—น๐—ฒ๐—บ and below are the outlines-

๐—ง๐—ฎ๐—ฏ๐—น๐—ฒ ๐—ผ๐—ณ ๐—–๐—ผ๐—ป๐˜๐—ฒ๐—ป๐˜:
๐Ÿ‘‰[00:10] Problem statement
๐Ÿ‘‰[02:44] Longest common Subsequence
๐Ÿ‘‰[03:39] Algorithm
๐Ÿ‘‰[07:06] Recurrence relation
๐Ÿ‘‰[09:35] Recursive solution
๐Ÿ‘‰[09:42] Recurrence tree
๐Ÿ‘‰[13:22] Top-down approach with memoization
๐Ÿ‘‰[14:51] Bottom-up approach/ DP solution (using 2-D array)
๐Ÿ‘‰[25:10] Bottom-up approach/ DP solution (using 1-D array)
๐Ÿ‘‰[30:11] Demo

๐—ก๐—ผ๐˜๐—ฒ: if you find it useful, please do not forget to like and share your feedback in comments.

https://lnkd.in/fNveH-Y

#JAVAAID #lcs #longestcommonsubsequence #leetcode #javaAidTutorials #programming #algorithms #coding #competitiveprogramming #google #java #problemsolving #kanahaiyaGupta
Hey Coding Lover,

In this video, I have explained the ๐—ผ๐—ฝ๐˜๐—ถ๐—บ๐—ถ๐˜‡๐—ฒ๐—ฑ ๐˜„๐—ฎ๐˜† ๐˜๐—ผ ๐˜€๐—ผ๐—น๐˜ƒ๐—ฒ ๐˜‚๐˜๐—ผ๐—ฝ๐—ถ๐—ฎ๐—ป ๐˜๐—ฟ๐—ฒ๐—ฒ ๐—ต๐—ฎ๐—ฐ๐—ธ๐—ฒ๐—ฟ๐—ฟ๐—ฎ๐—ป๐—ธ ๐—ฝ๐—ฟ๐—ผ๐—ฏ๐—น๐—ฒ๐—บ ๐—ถ๐—ป ๐—ผ๐—ป๐—ฒ ๐—น๐—ถ๐—ป๐—ฒ.

This hackerrank problem is a part of Practice | Algorithms| Implementation | utopian tree hackerrank challenge.

๐—ก๐—ผ๐˜๐—ฒ: if you find it useful, please do not forget to like and share your feedback in comments.

https://youtu.be/C0YaIr8_mQU

#utopiantree #JAVAAID #HackerRankSolutions #implementation #HackerRank #JavaAidTutorials #programming #DataStructures #algorithms #coding #competitiveprogramming #java #codinginterview #problemsolving #KanahaiyaGupta #hackerrankchallenges
Hey Coding Lover,

In this video, I have solved hackerrank ๐—ฅ๐—ฒ๐—ฝ๐—ฒ๐—ฎ๐˜๐—ฒ๐—ฑ ๐—ฆ๐˜๐—ฟ๐—ถ๐—ป๐—ด ๐—ฝ๐—ฟ๐—ผ๐—ฏ๐—น๐—ฒ๐—บ ๐˜„๐—ถ๐˜๐—ต๐—ถ๐—ป ๐—ฎ ๐—ด๐—ถ๐˜ƒ๐—ฒ๐—ป ๐˜๐—ถ๐—บ๐—ฒ ๐—น๐—ถ๐—บ๐—ถ๐˜..

This hackerrank problem is a part of Practice | Algorithms| Implementation | Repeated String hackerrank challenge.

Note: if you find it useful, please do not forget to like and share your feedback in the comments.


https://youtu.be/d5xLkTvJDWY

#repeatedstring #JAVAAID #HackerRankSolutions #implementation #HackerRank #JavaAidTutorials #programming #DataStructures #algorithms #coding #competitiveprogramming #java #codinginterview #problemsolving #KanahaiyaGupta #hackerrankchallenges
Sharing my secrets in this video, ๐—ต๐—ผ๐˜„ ๐—œ ๐—ฟ๐—ฒ๐˜ƒ๐—ถ๐˜€๐—ฒ ๐—ฑ๐—ฎ๐˜๐—ฎ ๐˜€๐˜๐—ฟ๐˜‚๐—ฐ๐˜๐˜‚๐—ฟ๐—ฒ๐˜€ ๐—ฎ๐—ป๐—ฑ ๐—ฎ๐—น๐—ด๐—ผ๐—ฟ๐—ถ๐˜๐—ต๐—บ๐˜€ ๐—ท๐˜‚๐˜€๐˜ ๐—ถ๐—ป ๐Ÿฑ ๐—บ๐—ถ๐—ป๐˜‚๐˜๐—ฒ๐˜€ ๐—ฏ๐—ฒ๐—ณ๐—ผ๐—ฟ๐—ฒ ๐—บ๐˜† ๐—ฐ๐—ผ๐—ฑ๐—ถ๐—ป๐—ด ๐—œ๐—ป๐˜๐—ฒ๐—ฟ๐˜ƒ๐—ถ๐—ฒ๐˜„.

I hope it may help someone.

https://lnkd.in/dZyJnkq

If you find it useful, please like comment and share.

#mindmapsforcodinginterview #JAVAAID #JavaAidTutorials #programming #DataStructures #algorithms #coding #competitiveprogramming #java #codinginterview #problemsolving #KanahaiyaGupta