Backtracking Algorithm for Competitive Programming

Backtracking Algorithm for Competitive Programming

#coding #leetcode #programming #interview

[GregHogg]

Crack FAANG interviews for FREE at Algomap.io!

[TheRageCommenter]

For some reason you phrasing it like “after you go down the [recursion path] you gotta do this other path” unlocked an entirely new intuition for thinking about recursion for me. Thanks!

[davidgillies]

This is generating the power set of a set. You can enumerate from 0 to 2^(n - 1) and use the bitwise representation of the number as an inclusion map. Since you're never going to be given a set that is more than a few elements long this is not going to overflow a 32-bit integer (and probably not even a 16-bit integer).

[Only-ke]

All subsets are 2^n so we could just get the indexes using bits where we keep incrementing it by one and every increment gives us a new subset if we get the positions of 1s using bitwise operators

[amine_sahraoui_]

People who talk about bits mapping : THIS IS A BACKTRACKING VIDEO !!

[therealnotanerd_account]

And this is useless for real world problems. A lot of people memorise these tests and later are unnable to add another field to a table in a database.

[ismailalizade]

I have tried it and it is crazy.Nested functions, 3 recoursions?How can anyone keep this inside their heads? Am I missing something?

[shonif]

why does he append path.copy() instead of appending path directly like res.append(path)

[abhinavgarlapati]

Can I use python as my programming language rather than Java ?