You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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.
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
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
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/
The text was updated successfully, but these errors were encountered: