Google Coding Interview Question | Leetcode 698 | Partition to K Equal Sum Subsets

In this video, we introduce how to solve the "Partition to K Equal Sum Subsets" question which is used by big tech companies like Google, Facebook, Amazon in coding interviews. We also cover how to behave during a coding interview, e.g. communication, testing, coding style, etc.

Please subscribe to this channel if you like this video. I will keep updating this channel with videos covering different topics in interviews from big tech companies.

[himanshuchhikara]

wow, amazing solution. super helpful thank you for making a video on it

[AlejandroRuiz-pdci]

Damn bro this solution is actually genius

[saicharanreddy]

Bro, where is dynamic programming in this. You haven't used any memorization or tabulation. It's just simple recursion and backtracking.