Leetcode 2392. Build A Matrix With Conditions | Weekly Contest 308.

[@probabilitycodingisfunis1]

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()

[@maharshiagola3998]

Awesome video ma'am! Thanks for the great explanation, owe my career to you

[@iammiban]

Thankyou so much! This literally cleared so many doubts not only regarding the question but also regarding writing clean codes with c++

[@rakeshnaidu1998]

Leetcode POTD. Good explanation. Thank you.

[@zishan53]

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

[@samarth2915]

actually pretty good Explanation !

[@sayyadazeem8781]

Awesome explanation
U made hard prblm easy by ur explanation.
Thank u so much. Please Keep making videos for upcoming contests also

[@probabilitycodingisfunis1]

Thank you so much Azeem, will surely try to upload :)

[@himu1901]

Thanks for such nice explanation!

[@probabilitycodingisfunis1]

Thank you so much Himadri!

[@raushankumar6993]

thanks

[@pranaynagpure2804]

great solution, i was thinking of calculating all topo sorts and then matching row and column conditions , also canyou please mention complexity of algo

[@probabilitycodingisfunis1]

Had mentioned, O(k2)

[@probabilitycodingisfunis1]

Thanks Pranay!

[@vinodhkumar5329]

addicted to this channel.Thank you so much mam

[@Hunting996]

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

[@systemflaws]

It would be beneficial if you also mentioned time and space complexity. Also, many thanks for your clear explanation!

[@probabilitycodingisfunis1]

Have mentioned, it is O(k2)

[@systemflaws]

@@probabilitycodingisfunis1 Maybe I skipped that part. Thank you!

[@surajitroy_roll-5023]

Mind Blowing

[@aryangrover7475]

Amazing Explanation

[@zishan53]

Maam Please aaap Leetcode contest ka discussion krriye Ma'am

[@Sanyamjain77]

The explanation was very good.
Thanks for this solution video.

[@probabilitycodingisfunis1]

Thank you so much Sanyam!

[@Rahulkumar-op9lu]

nice explanation you made it easy problem .looking forward to learn lot from you

[@probabilitycodingisfunis1]

Thanks Rahul!

[@syedarfath9298]

Amazing explanation.
How did you deduced this problem is a graph problem. Is it because of ordering of numbers, leading to topological sort?

[@probabilitycodingisfunis1]

Thanks Syed, yes!

[@kwakukusi4094]

i love this channel

[@prithvijitbasak]

God level explanation. 🔥🔥

[@sahilanand30]

Nicely explained
Can you please share some good resource to learn graph

[@probabilitycodingisfunis1]

@Sahil Anand, would recommend GeeksforGeeks / Abdul Bari's CZcams Channel / Prateek Narang course on Graphs on Udemy

[@gmgrhythm2284]

code n code graph series

[@reshmaparveen6679]

Tqs ali i m yr big fan 🎉🎉

[@AmanSharma-vb5jl]

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

[@madhukarkumar2668]

HEY YOU soft LIKE AI AND TNice tutorialS VID SO HELPFUL

[@sefou519]

Sa here bro

[@MGtvMusic]

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()

[@tanaymalik4778]

di ab toh apka placement ho gaya, phir kyun practice kar rahe?