𝗗𝗢 𝗬𝗢𝗨 𝗞𝗡𝗢𝗪 𝗧𝗛𝗜𝗦 𝗧𝗥𝗜𝗖𝗞?

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
𝗧𝗿𝗶𝗰𝗸 𝗧𝗼 𝗣𝗮𝘀𝘀 𝗔𝗹𝗹 𝗧𝗲𝘀𝘁 𝗖𝗮𝘀𝗲𝘀 𝗜𝗻 𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴

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.

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.

Wishing you and your family a 🔥HAPPY DIWALI 🔥
I wish you all will get your dream job soon.
Till then keep learning, keep coding 😁

Hello Coding Lover,
In this video, I have explained how to solve house robber dynamic programming problem which is based on maximum sum subsequence non-adjacent pattern.

I have used FAST method to solve this DP problem.


https://youtu.be/ge_Fv2ZQAaE

#JAVAAID #houserobber #maxsumnonadjacent #leetcode #javaAidTutorials #programming #dataStructures #algorithms #codinginterview #coding

Let's see how many people know the correct answer?

What will be the complexity to find the Length Of The Longest Consecutive 1s In Binary representation of a number?

a) O(n) b) O(logn)
c) O(K) where K is no. of zeros d) None of these.

First comment your option below and then watch the video to know whether you are right or wrong?

https://youtu.be/bc7cxeDy308

𝗧𝗼𝗽 𝟱 𝗔𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀 𝗘𝘃𝗲𝗿𝘆 𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗲𝗿 𝗠𝘂𝘀𝘁 𝗞𝗻𝗼𝘄
𝗟𝗶𝗻𝗸: https://www.youtube.com/watch?v=S8V444xdNvM&list=PLSIpQf0NbcCmpERN24EDswwdAnOKNVF_9&ab_channel=JAVAAID-CodingInterviewPreparation

Merry Christmas 🎅 🎄

𝗠𝗮𝘀𝘁𝗲𝗿 𝘁𝗵𝗲 𝗮𝗿𝘁 𝗼𝗳 𝗿𝗲𝗰𝘂𝗿𝘀𝗶𝗼𝗻 𝗷𝘂𝘀𝘁 𝗶𝗻 𝗮𝗻 𝗵𝗼𝘂𝗿.
A simple and practical approach with examples to master recursion.

𝗽𝗹𝗮𝘆𝗹𝗶𝘀𝘁:- https://www.youtube.com/watch?v=Sf-LR7OI-Ww&list=PLSIpQf0NbcCk4be21WNhPHrHMSxFndZtB&ab_channel=JAVAAID-CodingInterviewPreparation

#datastructures #algorithms #codinginterview #programming #codinginterview #competitiveprogramming #codechef #coding #problemsolving #recursion

🔥 Happy New Year 2021 Everyone 🔥

Master the 𝗗𝘆𝗻𝗮𝗺𝗶𝗰 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴 Skills by solving most common 𝗗𝘆𝗻𝗮𝗺𝗶𝗰 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴 𝗶𝗻𝘁𝗲𝗿𝘃𝗶𝗲𝘄 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀.

Once you practice these problems, you will be able to solve most of the 𝗱𝗽 𝗽𝗿𝗼𝗯𝗹𝗲𝗺𝘀 𝘄𝗵𝗶𝗰𝗵 𝗳𝗼𝗹𝗹𝗼𝘄𝘀 𝘁𝗵𝗲 𝘀𝗶𝗺𝗶𝗹𝗮𝗿 𝗽𝗮𝘁𝘁𝗲𝗿𝗻.

𝗣𝗹𝗮𝘆𝗹𝗶𝘀𝘁 : https://www.youtube.com/playlist?list=PLSIpQf0NbcClDpWE58Y-oSJro_W3LO8Nb

𝗟𝗲𝗮𝗿𝗻 𝘁𝗵𝗲 𝗺𝗼𝘀𝘁 𝗲𝗮𝘀𝗶𝗲𝘀𝘁 𝘄𝗮𝘆 𝗮𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺 𝘁𝗼 𝗶𝗺𝗽𝗹𝗲𝗺𝗲𝗻𝘁 𝗺𝗲𝗿𝗴𝗲 𝘀𝗼𝗿𝘁
https://youtu.be/XPc45qfcSWw

𝗔𝗺𝗮𝘇𝗶𝗻𝗴 𝘁𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 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

(Re-post)
Hi guys,

If you have not watched this tutorial just because it,s long ,you are missing alot.

In this tutorial, i have explained each and every thing which you need to know to deal with knapsack algorithm.

I have covered five different algorithms to solve this problem with proof.
https://youtu.be/aL6cU5dWmWM