5,321
edits
Interview Algorithms: Difference between revisions
→Finding duplicates in an array
| Line 14: | Line 14: | ||
then you count the number of times each bit appears and take it mod <math>n</math>.<br> | then you count the number of times each bit appears and take it mod <math>n</math>.<br> | ||
The remaining bits will remain <math>m \mod n</math> times.<br> | The remaining bits will remain <math>m \mod n</math> times.<br> | ||
* [https://leetcode.com/problems/single-number/ single-number] | |||
* [https://leetcode.com/problems/single-number-ii/ single-number-ii] | |||
* [https://leetcode.com/problems/single-number-iii/ single-number-iii] | |||