Tag: Bit Manipulation

  1. Leetcode 137 Single Number II

    Problem 137 Single Number II Given an array of integers, every element appears three times except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory? If you have never seen this kind of problem, that would…

    on Leetcode Java Bit Manipulation

  2. Leetcode 136 Single Number

    Problem 136 Single Number Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory? First time when I saw this problem, I felt confusing, and the first…

    on Hash Table Bit Manipulation