LeetCode

[@TechWithKomal]

To be honest... This is first KZbin channel for me... From which I learnt a lot regarding coding at leetcode platform

[@KnowledgeCenter]

Great to hear that.

[@GauravSingh-ku5xy]

Very good explanation. Thanks.

[@KnowledgeCenter]

Thanks.

[@soumyadeeproy6611]

Thanks for creating such good content videos. I am learning a lot from your channels.Please keep the good work going on

[@shreyasjain7191]

sir help us with coding questions given on geeks for product based companies

[@supremoluminary]

When you write: 1: [2,4] 2: [1,3] 3: [2,4] 4: [1:3] Is that like the data represented as arrays `[[2,4],[1,3],[2,4],[1,3]]` but 1 indexed?

[@ambersinghrok]

Sir can you make a backtracking playlist ..there are no resources on youtube for backtracking

[@KnowledgeCenter]

Sure. Will do, once I am done with a few ongoing topics.

[@TechWithKomal]

Thanks a lot... For providing such optimised solutions... But why have you stopped making videos for leetcode daily challenge...

[@KnowledgeCenter]

Thanks a lot. A bit busy these days. New Job & Marriage scheduled. all at once. I will start making videos almost daily soon.

[@TechWithKomal]

@@KnowledgeCenter Congratulations for both life events :)

[@KnowledgeCenter]

Thanks.

[@kailashraturi1079]

what if node's value is repeating :

[@rickzhi5498]

Nice

[@KnowledgeCenter]

Thanks

[@Mandeepsingh-jo5cf]

good explanation.

[@prodiptamondal1758]

Thanks

[@KnowledgeCenter]

Welcome

[@JamesHalpert8555]

I tried in Java but it's showing TLE :( Can you kindly help?? code: class Solution { public Node cloneGraph(Node node) { if(node==null) return null; Map visited = new HashMap(); return cloneNode(node,visited); } public Node cloneNode(Node node,Map visited){ Node new_node = new Node(node.val); visited.put(new_node,node.val); for(Node n:node.neighbors){ if(!visited.containsKey(n)){ Node cn = cloneNode(n,visited); new_node.neighbors.add(cn); } else new_node.neighbors.add(n); } return new_node; } }