Mam please aap bhot dino se active nhi hai contest review nhi de rhi hai ...Aap ka content bhot hi acha hota hai please post video on Leetcode contests
great solution, i was thinking of calculating all topo sorts and then matching row and column conditions , also canyou please mention complexity of algo
Hey Alisha, Interview me DP me "top down with memorization" approach se batane se kam chal jata h kya ya phir interviewer ko "bottom up iterative" bhi chahiye hota h
vector buildMatrix(int k, vector& rowConditions, vector& colConditions) {
vectorrow_order = kahn(rowConditions, k+1); //[1,4,3,2]
vectorcol_order = kahn(colConditions, k+1); // [1,4,2,3]
// map -> {1 :0, 4:1, 2:2, 3:3}
unordered_mapm;
if(row_order.size()
Awesome video ma'am! Thanks for the great explanation, owe my career to you
Thankyou so much! This literally cleared so many doubts not only regarding the question but also regarding writing clean codes with c++
Leetcode POTD. Good explanation. Thank you.
Mam please aap bhot dino se active nhi hai contest review nhi de rhi hai ...Aap ka content bhot hi acha hota hai please post video on Leetcode contests
actually pretty good Explanation !
Awesome explanation
U made hard prblm easy by ur explanation.
Thank u so much. Please Keep making videos for upcoming contests also
Thank you so much Azeem, will surely try to upload :)
Thanks for such nice explanation!
Thank you so much Himadri!
thanks
great solution, i was thinking of calculating all topo sorts and then matching row and column conditions , also canyou please mention complexity of algo
Had mentioned, O(k2)
Thanks Pranay!
addicted to this channel.Thank you so much mam
I'll probably not get an answer but still, when I opened my soft Roll I couldn't place the "notes" or however you call them that finely, by
It would be beneficial if you also mentioned time and space complexity. Also, many thanks for your clear explanation!
Have mentioned, it is O(k2)
@@probabilitycodingisfunis1 Maybe I skipped that part. Thank you!
Mind Blowing
Amazing Explanation
Maam Please aaap Leetcode contest ka discussion krriye Ma'am
The explanation was very good.
Thanks for this solution video.
Thank you so much Sanyam!
nice explanation you made it easy problem .looking forward to learn lot from you
Thanks Rahul!
Amazing explanation.
How did you deduced this problem is a graph problem. Is it because of ordering of numbers, leading to topological sort?
Thanks Syed, yes!
i love this channel
God level explanation. 🔥🔥
Nicely explained
Can you please share some good resource to learn graph
@Sahil Anand, would recommend GeeksforGeeks / Abdul Bari's CZcams Channel / Prateek Narang course on Graphs on Udemy
code n code graph series
Tqs ali i m yr big fan 🎉🎉
Hey Alisha, Interview me DP me "top down with memorization" approach se batane se kam chal jata h kya ya phir interviewer ko "bottom up iterative" bhi chahiye hota h
HEY YOU soft LIKE AI AND TNice tutorialS VID SO HELPFUL
Sa here bro
Java solution
class Solution {
public int[][] buildMatrix(int k, int[][] rowConditions, int[][] colConditions) {
List rowOrder = topoSort(rowConditions,k);
List colOrder = topoSort(colConditions,k);
if(rowOrder.size()
di ab toh apka placement ho gaya, phir kyun practice kar rahe?