Boolean Parenthesization Dynamic Programming | Explained with Code
Вставка
- Опубліковано 12 вер 2024
- Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.
NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. Here you will learn about Boolean Parenthesization. In this question :
1. You are given a boolean expression with symbols T,F, and operators &,|,^ , where
T represents True
F represents False
& represents boolean AND
| represents boolean OR
^ represents boolean XOR.
2. You have to find the number of ways in which the expression can be parenthesized so that the value of expression evaluates to true.
To attempt and submit this question, click here: www.pepcoding....
For a better experience and more exercises, VISIT: www.pepcoding....
#dynamicprogramming #interview #questions
Have a look at our result: www.pepcoding....
Follow us on our FB page: / pepcoding
Follow us on Instagram: / pepcoding
Follow us on LinkedIn: / pepcoding-education
After looking at various contents over youtube , can say you have best variety and explanation .I have 8 years of experience and already working in BIG MNC (Expedia) but there is so much to learn in your content .Have shared your content with my siblings and they are loving it .Keep up the good work .
I am glad. Your kind words are the kind of motivation that truly help me in making more and more content. Especially, these days, not everybody is generous with motivating anybody either. It means a lot.
Keep sharing and keep loving Pepcoding😊
This channel is a hidden gem.
Probably the most difficult coding question to explain, but you just nailed it. You are a true teacher.
Thanks!
Wow great!!! I am ready to pay for these type of quality content. Really great. When I read this problem I thought how tough it is. But after watching your video I can code it even after 10 year. Thanks man.
Certainly the best explanation on this question. Thanks a lot sir
Thankyou beta!
I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem.
If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
however we thank you and this channel, it will never be enough sir. Such topics so smoothly and now I have started binge watching these videos. You are the bestestestest!!! And I believe that your channel will become one of the most successful ones in future.
So nice of you keep motivating, keep learning and keep loving Pepcoding😊
question tough hai but aapse smjne k baad khudse sb draw krke dekha toh sb smj aaya or m code b khud likh paya bina dekhe ... Thank you so much :)
Every question becomes very easy after watching your video.
sir i have watched your two videos on this topic and have solved this question on my own . But i have not found your gap strategy video, i learned gap strategy just by seeing you implementing. Could u please share the title or the link of gap strategy video . And thanks for the amazing content
count palindromic substrings in level 1 dp playlist
@@ojasdighe991 Thanks brother
@ojas Dighe Thanks bro. Your comment should be on the top btw :)
Amazing content, best on youtube so far!
sir dil khush ho gaya ye sawal ko karke. Thank u for all the efforts u have been pouring to teach so beautifully and the fact that we already know : "east or west sumeet sir is the best"
Glad to know that you liked the content and thank you for appreciating.
The love and respect which I get from you people keep me highly motivated and the same I am able to forward It to you people through my videos.
So, keep motivating, keep learning and keep loving Pepcoding😊
khudse sochne me bs itna hi hwaa lgi thi ke gap strategy 2 use hogi kese pta ni . or 2 dp bnegi ye ni socha gya
fr video dekh ke bhot mzaa aaya saare doubt cover hogye
Great beta.
Sir , one day I'll pay the full course fees to you. Your explanation and approach is perfectly valuable.
Thankyou beta!
Bs aap dil lgaa k pdo aur aachi jga place ho kr apne ghrvalo k sath sath Pepcoding ka naam bhi roshan kro, bus utna kaafi h mere liye🙏🏼
And keep learning and keep loving Pepcoding😊
@@Pepcoding yes sir love and kindness is a highest standard for being a human in life.❤️ Thanks for kind words.
@@Pepcoding No sir , thats not enough !
Such a great content free of cost is really a great deal to pay !
As soon as I will get placed , I will surely give credits and gifts too you along with payment of this well deserving course !
Next Level explanation sir ❤️❤️❤️
I'm thinking now if this question comes in my interview I can explain them so well
I am glad you liked it. I also hope that you are watching till end and trying to understand the what, how and especially why of the problem.
If you like our efforts, we request a review
g.page/Pepcoding/review?rc
You can subscribe to our channel here
ua-cam.com/users/Pepcodingabout?view_as=subscriber
@@Pepcoding already subscribed sir❤
With 🔔
Also reviewed now
Keep creating valuable content 🔥🔥
learning becoming intresting with pepcoding....💡💡🔥🔥
Glad to hear that!
Keep learning.
And for better experience, visit nados.io, where you will get well curated content and career opportunities.
GREAT EXPLAINATION
sir,your knowledge and teaching skills are amazing
Glad you liked it!
Keep learning.
And for better experience, visit nados.io, where you will get well curated content and career opportunities.
Mza aagya sir! Bas sir rukna mt kabhi.. Apki vjh se hi muje coding me mze aane lage h aajkl
ji beta.
Great Explanation
Bohot Bohot shukriya Sir !
Great teaching !
Than you so much !
I think line number 35 to 42 .. it is dpt[][] + = (lfc..).. + sign should be there
Thanks sir for giving underlying algo of this peoblem.
Such a quality content on youtube
Maaza aa gya. Amazing Explanation.
poori dekhi?
@@Pepcoding yes sir bahut mst
Kudos ❤️
excellent bro. nicely explained
Sir can it be done by recursion, with managing "trues" AND "falses" array - side by side ?
Bhari swaal 💥💥
For much better experience check out nados.pepcoding.com
All your doubts will be solved there itself
Can we really expect such level of questions to be asked in interviews ?
are gap strategy vaali video hai konsi ye to btado
ua-cam.com/video/XmSOWnL6T_I/v-deo.html
Hahaha
Thank you sir.!!
Most welcome, for better experience and well organised content sign up on nados.io and start learning.
Backtracking + greedy ke ek live class ly loo sir basic to advanced
ji beta.
how to tell the time complexity of recursive dp solution
Best :)
I am glad you liked it. I also hope that you are watching till end and trying to understand the what, how and especially why of the problem.
If you like our efforts, we request a review
g.page/Pepcoding/review?rc
You can subscribe to our channel here
ua-cam.com/users/Pepcodingabout?view_as=subscriber
Sir cap strategy wala kahapar hai , not able to find on UA-cam
What is the name of the video sir ?
gap strategy : ua-cam.com/video/lvRdFCMD_Ew/v-deo.html
@@schwarzenneger9240 thanks mate 👍👍
sir plz optimise time to O(N*N)
ye question koi kyun poochega interview mein
baccho ki jaan nikaal dega ye to
btw great explanation
Beta isse bhi khatarnaak questions phuche jate h, btw thanks for appreciating. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem.
Sir time complexity to increase ho jayegi is case mein. O(n^2) nahi hogi
Beta, I regret to inform you that, I won't be able to answer/solve the personal doubts of each and every student over here. For clearing your doubts, you can join our community on telegram - t.me/pepcoding.
Real Guru*
Glad to know that you liked the content and thank you for appreciating.
The love and respect which I get from you people keep me highly motivated and the same I am able to forward It to you people through my videos.
So, keep motivating, keep learning and keep loving Pepcoding😊
25/79 Done
Keep going
SIR PLS TEACH SYSTEM DESIGN BCS I SEARCHED EVERYWHERE IN UA-cam BUT NO ONE EXPLAINED IT CLEARLY . pLZ MAKE VIDEOS ON SYSTEM DESIGN
👏
❤️❤️
gap strategy ka video bhatao koi tho
Concept of Number of subscribers, views, likes are too short to measure your contribution....
Bhai maine toh hag diya
Giving wrong answer on Gfg FOR :
17
T|F^F&T|F^F^T^F|T
Sir's soln is correct. In GFG, the values of ouputs are in range of long type. It is mentioned to take modulo 1003 while generating output. Use long dp instead of int dp's and do a 1003 modulo everytime you insert a value in dpt[i][j] or dpf[i][j]. The code will work.