Leetcode 91. Decode Ways

preview_player
Показать описание
Leetcode 91. Decode Ways

My contact details

You can practice for coding interview from here

I am Mohammad Fraz , a final year Engineer at DTU and I create content for Coding and technical interviews for FAANG. I explain the intuition to solve Data Structure and Algorithm Questions from leetcode and other platforms. I also cover interview experiences for FAANG and other tech giants. You will also find lectures on the frequently asked interview questions.
  1. Fraz
  2. Leetcode
  3. CodingInterviews
  4. LeetcodeSolutions
  5. LeetcodeContests
  6. Algorithms
Рекомендации по теме
Decode Ways - 0:15:25

Decode Ways - Dynamic Programming - Leetcode 91 - Python

91. Decode Ways 0:09:40

91. Decode Ways - LeetCode Python Solution

Decode Ways 0:07:31

Decode Ways

Total Ways To 0:11:58

Total Ways To Decode A String - Recursive Dynamic Programming Approach ('Decode Ways' on L...

Decode Ways (LeetCode 0:23:11

Decode Ways (LeetCode 91) | Full Solution with visuals | Recursion to Dynamic Programming

Leetcode 91. Decode 0:18:46

Leetcode 91. Decode Ways

LeetCode 91. Decode 0:12:25

LeetCode 91. Decode Ways

Meta Interview Question 0:05:26

Meta Interview Question - Decode Ways - LeetCode 91

Leetcode 91 - 0:08:43

Leetcode 91 - Decode Ways (JAVA Solution Explained!)

Decode Ways | 0:11:57

Decode Ways | Live Coding with Explanation | Leetcode #91

91. Decode Ways 0:09:52

91. Decode Ways | LEETCODE MEDIUM | DYNAMIC PROGRAMMING | CODE EXPLAINER

Leetcode 91: Decode 0:30:27

Leetcode 91: Decode Ways

91. Decode Ways 0:27:30

91. Decode Ways | 3 Ways

Decode Ways - 0:12:12

Decode Ways - LeetCode 91 - Python

Decode Ways | 0:22:22

Decode Ways | LeetCode 91 | C++, Java, Python

Разбор задачи 91 0:28:32

Разбор задачи 91 leetcode.com Decode Ways. Решение на C++

[Java] Leetcode 91. 0:28:28

[Java] Leetcode 91. Decode Ways [DP Distinct Ways #6]

91. Decode Ways 0:08:25

91. Decode Ways - Day 1/31 Leetcode October Challenge

Decode Ways - 0:15:36

Decode Ways - Leetcode 91 - Blind 75 Explained - Dynamic Programming - Python

Leetcode 91 - 0:08:22

Leetcode 91 - Decode Ways (DFS / Dynamic Programming)

[Leetcode 91] Decode 0:15:24

[Leetcode 91] Decode Ways [Recursion][Dynamic Programming]

Leetcode - Decode 0:09:30

Leetcode - Decode Ways (Python)

LeetCode #91: Decode 0:13:16

LeetCode #91: Decode Ways | Facebook Coding Interview

Decode Ways | 0:13:06

Decode Ways | Leetcode 91 | Live coding session | LC December 24

Комментарии
Автор

This is the best explanation of decode ways available..Thanks

ruhinapatel
Автор

Without using any DP array (SPACE OPTIMIZED) : using two variables for two states !

class Solution {
public:
int numDecodings(string s) {
int n = s.size();
int a = 1;
int b = 1;
for(int i=n-1; i>=0; i--)
{
int op1 = s[i] - '0';
int op2 = 0;
int cur = 0;
if(i<n-1) op2 = op1*10 + s[i+1] - '0';
if(op1 > 0)
{
cur+=b;
if(op2 > 0 and op2 <= 26) cur+=a;
}
a = b;
b = cur;
}
return b;
}
};

yagniktalaviya
Автор

thank you so much! Took some 3 hours to figure it out the recurrence relation by myself, but this was so better

sanjayagamamidi
Автор

Instead of if(op1&&op2>0&&op2<=26) we can also use if(way2>=10&&way2<=26)

nehaafreen
Автор

@Fraz: Did the same thing is Java but the test case "10" fails as the code gives output as 0 instead of 1.

rajrajeshwarsinghrathore
Автор

Are there some problems where memoization doesnt works or gives TLE and we need to compulsorily do with bottom up dp? And even i==s.size() will work.

palakkotwani
Автор

Hi, I just heard about The Myntra Hackathon for girls. Can you guys please do a video about that in detail?

vaishnavigupta
Автор

I dont have any projects can u tell me easy way to make a good project within 2 weeks for internships in August (i am in 2 year NSUT)

tarun_