JAVAAID
731 subscribers
15 photos
1 file
100 links
It helps students and working professionals in interview preparation
Download Telegram
Forwarded from VMware Workstation Pro (KGupta)
Hello friends,
In this video, I have explained the 4 different ways to solve Longest Common Subsequence problem.

Here is the complete video tutorial which explains a generic algorithm with complexity analysis.
๐Ÿ”ด DONT CLICK THIS: https://bit.ly/2G4cEuc

outline:-
1 ) Longest common subsequence using recursion
2) Longest common subsequence recursion with memorization or top-down approach
3) Longest common Subsequence using bottom-up approach using the 2-D array
4) Longest common subsequence using a bottom-up approach using the 1-D array

https://youtu.be/DuikFLPt8WQ
Forwarded from HackerRank Solutions
Today JAVAAID has hit 10,000 subscribers. Which I have never thought of. I want to thank each and every one of you for subscribing โค๏ธ.

Now we are 10K family now
Forwarded from HackerRank Solutions
Interviewer: Do you know Dynamic Programming?
Me: Yes, a little bit.

Interviewer: Not prepared well, it seems, hmm?
Me: No issues, you can ask problem, will try to solve.

Interviewer: Suppose you are in electronics shop and owner went for lunch.
As no one is there in the shop and you thought of stealing the electronics item from his shop.
But you have only one bag which has capacity of 4lbs and you can put the item into your bag to hide.
But due to bag constraint you can only focus small item which are-
Phone having weight 1 lbs and price 150$
Laptop having weight 4 lbs and price 300$
Tablet having weight 3 lbs and price 200$


Write an algorithm to calculate the maximum profit which you can get without caught.
Me: smiled a bit, as all the given values seem familiar to me ๐Ÿ™‚

For those who want to know how I answered for this problem here is the link-
https://youtu.be/aL6cU5dWmWM

Moral: Not only candidate even Interviewer also watches tutorials to judge the candidate. ๐Ÿ˜€
Forwarded from HackerRank Solutions
This tutorial ranked number 1 on Google and YouTube.so thought of sharing with you all.

If you are a competitive programmer or preparing for competitive programming or solve coding problems online then you would have come across one algorithm called prefix sum.
But most of people do know the benefit of this algorithm.

Here is the tutorial which explains why you must know prefix-sum algorithm.

https://youtu.be/scD312I7kkE
#tutorial #coding #programming #learntocode #algorithm #prefixsum #competitiveprogramming
Forwarded from HackerRank Solutions
This tutorial also ๐—ฟ๐—ฎ๐—ป๐—ธ๐—ฒ๐—ฑ ๐—ป๐˜‚๐—บ๐—ฏ๐—ฒ๐—ฟ ๐Ÿญ on ๐—š๐—ผ๐—ผ๐—ด๐—น๐—ฒ and ๐—ฌ๐—ผ๐˜‚๐—ง๐˜‚๐—ฏ๐—ฒ.so thought of sharing ๐—ฃ๐—ฎ๐—ฟ๐˜-๐Ÿฎ with you all.

If you are a ๐—ฐ๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฝ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ฒ๐—ฟ or preparing for ๐—ฐ๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฝ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ด or solve coding problems online then you would have come across one algorithm called ๐—ฝ๐—ฟ๐—ฒ๐—ณ๐—ถ๐˜… ๐˜€๐˜‚๐—บ.

Here is the ๐—ฃ๐—ฎ๐—ฟ๐˜-๐Ÿฎ of my previous tutorial which explains what is ๐—ฝ๐—ฟ๐—ฒ๐—ณ๐—ถ๐˜… ๐˜€๐˜‚๐—บ ๐—ฎ๐—น๐—ด๐—ผ๐—ฟ๐—ถ๐˜๐—ต๐—บ and how it works?
https://www.youtube.com/watch?v=pVS3yhlzrlQ
Forwarded from HackerRank Solutions
How many of you thought that I have solved the problem in an interview but still did not ๐—ด๐—ฒ๐˜ ๐˜๐—ต๐—ฒ ๐—ผ๐—ณ๐—ณ๐—ฒ๐—ฟ or did not get what I expected?

If this has happened to you then this tutorial will be going to an eye-opener for you.

Generally, the candidate solves the problem with a brute force approach but ignore the optimize solution.
If you know this technique you can ๐—ฑ๐—ฟ๐—ฎ๐˜€๐˜๐—ถ๐—ฐ๐—ฎ๐—น๐—น๐˜† ๐—ฟ๐—ฒ๐—ฑ๐˜‚๐—ฐ๐—ฒ ๐˜๐—ต๐—ฒ ๐˜๐—ถ๐—บ๐—ฒ ๐—ฐ๐—ผ๐—บ๐—ฝ๐—น๐—ฒ๐˜…๐—ถ๐˜๐˜† ๐—ผ๐—ณ ๐˜†๐—ผ๐˜‚๐—ฟ ๐˜€๐—ผ๐—น๐˜‚๐˜๐—ถ๐—ผ๐—ป ๐—ณ๐—ฟ๐—ผ๐—บ ๐—ข(๐—ปยฒ) ๐˜๐—ผ ๐—ข(๐—ป) and you can get a slight advantage in your interview.


And this technique is known as ๐—ฆ๐—น๐—ถ๐—ฑ๐—ถ๐—ป๐—ด ๐—ช๐—ถ๐—ป๐—ฑ๐—ผ๐˜„ ๐—ง๐—ฒ๐—ฐ๐—ต๐—ป๐—ถ๐—พ๐˜‚๐—ฒ which is useful for solving problems related to ๐—ฎ๐—ฟ๐—ฟ๐—ฎ๐˜†๐˜€ ๐—ผ๐—ฟ ๐˜€๐˜๐—ฟ๐—ถ๐—ป๐—ด๐˜€.

https://youtu.be/__guhvzO540

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

#slidingwindow #technique #algorithms #code #programming #coding #slidingwindowalgorithm
Forwarded from VMware Workstation Pro (KGupta)
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
Forwarded from VMware Workstation Pro (KGupta)
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
Forwarded from HackerRank Solutions
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
Forwarded from HackerRank Solutions
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
Forwarded from VMware Workstation Pro (KGupta)
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
Forwarded from HackerRank Solutions
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
Forwarded from HackerRank Solutions
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
Forwarded from VMware Workstation Pro (KGupta)
๐——๐—ข ๐—ฌ๐—ข๐—จ ๐—ž๐—ก๐—ข๐—ช ๐—ง๐—›๐—œ๐—ฆ ๐—ง๐—ฅ๐—œ๐—–๐—ž?

How too avoid time limit exceed error in computer programming?
If you are preparing for competitive programming then this tutorial is very important for you.

This video will help you to understand-
๐Ÿ‘‰ ๐—ช๐—ต๐—ฎ๐˜ ๐—ถ๐˜€ ๐—ง๐—Ÿ๐—˜?
๐Ÿ‘‰ ๐—ช๐—ต๐˜† ๐—ง๐—Ÿ๐—˜ ๐—ผ๐—ฐ๐—ฐ๐˜‚๐—ฟ๐˜€?
๐Ÿ‘‰ ๐—›๐—ผ๐˜„ ๐˜๐—ผ ๐—ผ๐˜ƒ๐—ฒ๐—ฟ๐—ฐ๐—ผ๐—บ๐—ฒ ๐—ง๐—Ÿ๐—˜?

https://youtu.be/S8V444xdNvM
๐—ง๐—ฟ๐—ถ๐—ฐ๐—ธ ๐—ง๐—ผ ๐—ฃ๐—ฎ๐˜€๐˜€ ๐—”๐—น๐—น ๐—ง๐—ฒ๐˜€๐˜ ๐—–๐—ฎ๐˜€๐—ฒ๐˜€ ๐—œ๐—ป ๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ด
Forwarded from VMware Workstation Pro (KGupta)
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
Hi,
In this video, I have explained ๐— ๐—ฒ๐—ฟ๐—ด๐—ฒ ๐—ฆ๐—ผ๐—ฟ๐˜ ๐—”๐—น๐—ด๐—ผ๐—ฟ๐—ถ๐˜๐—ต๐—บ ๐—ถ๐—ป ๐—ฑ๐—ฒ๐˜๐—ฎ๐—ถ๐—น ๐˜„๐—ต๐—ถ๐—ฐ๐—ต ๐—ถ๐˜€ ๐—ผ๐—ป๐—ฒ ๐—ผ๐—ณ ๐˜๐—ต๐—ฒ ๐—บ๐—ผ๐˜€๐˜ ๐—ฒ๐—ณ๐—ณ๐—ถ๐—ฐ๐—ถ๐—ฒ๐—ป๐˜ ๐˜€๐—ผ๐—ฟ๐˜๐—ถ๐—ป๐—ด ๐—ฎ๐—น๐—ด๐—ผ๐—ฟ๐—ถ๐˜๐—ต๐—บ๐˜€

I will dry run the merge sort algorithm step by step by taking a diagram example to understand the flow of the algorithm at every step. ๐—œ ๐˜„๐—ถ๐—น๐—น ๐˜€๐—ต๐—ผ๐˜„ ๐˜†๐—ผ๐˜‚ ๐˜๐—ต๐—ฒ ๐˜€๐—ต๐—ผ๐—ฟ๐˜๐—ฒ๐˜€๐˜ ๐—ฐ๐—ผ๐—ฑ๐—ฒ ๐—ฒ๐˜ƒ๐—ฒ๐—ฟ ๐—ณ๐—ผ๐—ฟ ๐—บ๐—ฒ๐—ฟ๐—ด๐—ฒ ๐˜€๐—ผ๐—ฟ๐˜
Here you will learn the basics of merge sort and understand the merge sort sorting algorithm working with a simple example along with visual diagrams.

๐—ง๐—ผ๐—ฝ๐—ถ๐—ฐ๐˜€ ๐—–๐—ผ๐˜ƒ๐—ฒ๐—ฟ๐—ฒ๐—ฑ: -
๐Ÿ‘‰ [00:52] ๐—ช๐—ต๐—ฎ๐˜ ๐—ถ๐˜€ ๐—บ๐—ฒ๐—ฟ๐—ด๐—ฒ ๐˜€๐—ผ๐—ฟ๐˜?
๐Ÿ‘‰ [01:19] ๐—ช๐—ต๐˜† ๐˜„๐—ฒ ๐˜€๐—ต๐—ผ๐˜‚๐—น๐—ฑ ๐˜€๐˜๐˜‚๐—ฑ๐˜† ๐—บ๐—ฒ๐—ฟ๐—ด๐—ฒ ๐˜€๐—ผ๐—ฟ๐˜?
๐Ÿ‘‰ [01:51] ๐— ๐—ฒ๐—ฟ๐—ด๐—ฒ ๐˜€๐—ผ๐—ฟ๐˜ ๐—ฎ๐—น๐—ด๐—ผ๐—ฟ๐—ถ๐˜๐—ต๐—บ
๐Ÿ‘‰ [06:16] ๐—›๐—ผ๐˜„ ๐—บ๐—ฒ๐—ฟ๐—ด๐—ฒ ๐—ผ๐—ฝ๐—ฒ๐—ฟ๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐˜„๐—ผ๐—ฟ๐—ธ๐˜€?
๐Ÿ‘‰ [14:54] ๐—ช๐—ต๐˜† ๐—บ๐—ฒ๐—ฟ๐—ด๐—ฒ ๐˜€๐—ผ๐—ฟ๐˜ ๐—ถ๐˜€ ๐˜€๐˜๐—ฎ๐—ฏ๐—น๐—ฒ?
๐Ÿ‘‰ [16:56] ๐—–๐—ผ๐—บ๐—ฝ๐—น๐—ฒ๐˜…๐—ถ๐˜๐˜† ๐—ผ๐—ณ ๐—บ๐—ฒ๐—ฟ๐—ด๐—ฒ ๐˜€๐—ผ๐—ฟ๐˜
๐Ÿ‘‰ [17:20] ๐—”๐—ฝ๐—ฝ๐—น๐—ถ๐—ฐ๐—ฎ๐˜๐—ถ๐—ผ๐—ป๐˜€ ๐—ผ๐—ณ ๐—บ๐—ฒ๐—ฟ๐—ด๐—ฒ ๐˜€๐—ผ๐—ฟ๐˜
๐Ÿ‘‰ [17:55] ๐—ž๐—ฒ๐˜† ๐—ป๐—ผ๐˜๐—ฒ๐˜€


https://youtu.be/XPc45qfcSWw

Would really appreciate your feedback like dislike, comment, etc. on my video.
Forwarded from VMware Workstation Pro (KGupta)
Hey Coding Lover,

I bet most of you would have come across this one of the very important interview question to ๐—ฐ๐—ต๐—ฒ๐—ฐ๐—ธ ๐˜„๐—ต๐—ฒ๐˜๐—ต๐—ฒ๐—ฟ ๐˜๐˜„๐—ผ ๐˜€๐˜๐—ฟ๐—ถ๐—ป๐—ด๐˜€ ๐—ฎ๐—ฟ๐—ฒ ๐—ฎ๐—ป ๐—ฎ๐—ป๐—ฎ๐—ด๐—ฟ๐—ฎ๐—บ ๐—ผ๐—ณ ๐—ฒ๐—ฎ๐—ฐ๐—ต ๐—ผ๐˜๐—ต๐—ฒ๐—ฟ?
But there are few who know the best answer for this problem.

In this video, we have explained the ๐—บ๐—ผ๐˜€๐˜ ๐—ฒ๐—ณ๐—ณ๐—ถ๐—ฐ๐—ถ๐—ฒ๐—ป๐˜ ๐˜„๐—ฎ๐˜† ๐˜๐—ผ ๐—ฐ๐—ต๐—ฒ๐—ฐ๐—ธ ๐—ถ๐—ณ ๐˜๐˜„๐—ผ ๐˜€๐˜๐—ฟ๐—ถ๐—ป๐—ด๐˜€ ๐—ฎ๐—ฟ๐—ฒ ๐—ฎ๐—ป๐—ฎ๐—ด๐—ฟ๐—ฎ๐—บ๐˜€

https://youtu.be/VuDduk6BRfk

Would really appreciate your feedback like dislike, comment, etc. on my video.