Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

"Kind of DnC" - using partitioning as a way to avoid brute-force enumeration #15

Open
sanjarcode opened this issue Jul 7, 2022 · 0 comments
Assignees

Comments

@sanjarcode
Copy link
Member

There are times in DnC when we use partitioning of problems just for the sake of avoiding brute force enumeration, and we may not combine solutions to subproblems at all.

Maybe this is not DnC, but it's an alternative to brute-force enumeration.

Here's a problem that I solved using this "kind of DnC" approach: https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k/

@sanjarcode sanjarcode self-assigned this Jul 7, 2022
@sanjarcode sanjarcode changed the title "Kind of DnC", we use paritioning as a way to avoid brute-force enumeration "Kind of DnC" - using paritioning as a way to avoid brute-force enumeration Jul 7, 2022
@sanjarcode sanjarcode changed the title "Kind of DnC" - using paritioning as a way to avoid brute-force enumeration "Kind of DnC" - using partitioning as a way to avoid brute-force enumeration Jul 7, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant