VMware Workstation Pro
12.7K subscribers
19 photos
2 files
105 links
It contains data structures & algorithmic problem solutions.
Download Telegram
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