Видео

Finally dsa series is back

❤

nice explanation

in exam if our turing machine logic is correct and machine is correctly drawn but the effectiveness of the machine isnt the baest possible i.e. more number of states were used than minimum possible, will it be considered? and if yes will we get full marks for the answer?

very nice, can you provide notes pdf? please. tomorrow 10 am exam

Completely understood 😮

Bhai isse simple explanation main aaj tak nai dekha or samjh bhi Aya 😊

bro... you are best...!!!! respect!!!!!!!!!

Thanks✨

love you brother thanks a lot

Kuch bhi sikhata

thanks vhai

Bhai important questions bata do

Bhai imp de do

Sir please made video on urgent basis of question: Design a Turning Machine which replaces substring 110 by 101

feedback - jara dhire bolo while explaining you should explain rules first baki sb good he bhai best of luck

Sir please make video for this question Design a Turing machine to recognise an arbitrary string divisible by 4, given input(0,1,2)

bdiaa videos hai apki.... keep it up

How we would know that which characters we have to push, which have to skip and which have to pop?

aswm🤌

Hii, are you a college student? if yes, in which sem you are?

can we add this transition function: ( q1, b, b) = ( q1, epsilon)

thanks sir

Bhai playlist ko pls sequence se lagao Btw video acchi se samaj raha hai

Underatted channel....

thanks could u complete rest of series faster too pls?

how many videos will be there for unit 3 ?

Sir please upload unit ,6

very helpful

Best explanation

finally understood , thanks bro

bro kab tak complete hoga full syllabus or unit 4...

Thank you bhai for this video series ,plz upload all unit video sooner ..

try to explain in english

❤

for student like me this video is must helpful thankyou bhai keep going god bless you with lots of love & successes

If i want length of middle word, what syntax will run?

very nicely Explained bro..

Nice

🤩🤩 you really inspire me to code plz do upload videos daily ..

❤❤❤

👏🏼

class Solution { private: int h(int i, int j, vector<vector<int>>&dp){ if(i == 0 || j == 0) return 1; if(dp[i][j] != -1) return dp[i][j]; return dp[i][j] = h(i - 1, j, dp) + h(i, j - 1, dp); } public: int uniquePaths(int m, int n) { vector<vector<int>>dp(m + 1, vector<int>(n + 1, -1)); return h(m - 1, n - 1, dp); } }; OR class Solution { private: int h(int i, int j, int m, int n, vector<vector<int>>& dp) { if (i == m - 1 || j == n - 1) return 1; if (dp[i][j] != -1) return dp[i][j]; return dp[i][j] = h(i + 1, j, m, n, dp) + h(i, j + 1, m, n, dp); } public: int uniquePaths(int m, int n) { vector<vector<int>> dp(m + 1, vector<int>(n + 1, -1)); return h(0, 0, m, n, dp); } };

C++ : class Solution { public: bool rotateString(string s, string goal) { for(int i = 0;i < s.size();i++){ char c = s[0]; s.erase(0, 1); s.push_back(c); if(s == goal) return true; } return false; } }; JAVA : class Solution { public boolean rotateString(String s, String goal) { for (int i = 0; i < s.length(); i++) { char c = s.charAt(0); s = s.substring(1) + c; if (s.equals(goal)) { return true; } } return false; } } PYTHON : class Solution: def rotateString(self, s: str, goal: str) -> bool: for i in range(len(s)): s = s[1:] + s[0] if s == goal: return True return False

nicely explained bhai, do make more such videos

We need such videos❤❤

Bahut sahi bhai daily dalte raho

There is a lot of room for improvement Keep it up and thanks ye video dekh kar aache se concept samaj aagaya

❤‍🔥❤‍🔥❤‍🔥❤‍🔥