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, I have explained a general approach to solve climbing staircase problem which is based on fibonacci pattern.

how to identify the pattern and apply the same to solve such DP problems.

Here I have explained, four different ways to solve this problem.

Recursive Solution
Top-down with memoization
Bottom-up
Efficient solution
https://youtu.be/ftpbBbtyxdE

🔴 DONT CLICK THIS: https://bit.ly/2G4cEuc

#JAVAAID #staircase #leetcode #javaAidTutorials #programming #dataStructures #algorithms #coding #competitiveprogramming #google #java #codinginterview #problemsolving #kanahaiyaGupta #google #facebook #amazon #oracle #gs #walmart

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

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

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