LeetCode
Question
·
Jul 2020
·
India
Goldman Sachs OA | Intern | India
1,147 views
2 replies
Question Details
You are given a binary string s of length n. Compute the sum of pairwise Hamming distances between all subsequences of string s with length exactly k for all k...
Full Details
🔒
Unlock all Goldman Sachs questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →About This Question
This is a reported interview question from a goldman sachs interview for a swe role (intern level) during the oa round reported in 2020.
It covers the following topics: Dynamic Programming, Strings .