---
title: "Bruce Lin (@lalalala0620) | Hashnode"
description: "Bruce Lin (@lalalala0620) writes on Hashnode. Read their latest articles and follow their work."
url: "https://hashnode.com/@lalalala0620"
---

@lalalala0620

# Bruce Lin

@lalalala0620 · Joined June 2025

### [LeetCode 153. Find Minimum in Rotated Sorted Array](https://blog.brucelinweb.com/leetcode-153-find-minimum-in-rotated-sorted-array?utm_source=hashnode&utm_medium=feed)

Question Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = \[0,1,2,4,5,6,7\] might become: \[4,5,6,7,0,1,2\] if it was rotated 4 times. \[0,1,2,4,5,6,7\] if it was rotated 7 times. No...

4 min read · [blog.brucelinweb.com](https://blog.brucelinweb.com/leetcode-153-find-minimum-in-rotated-sorted-array?utm_source=hashnode&utm_medium=feed)

[Jun 29, 2025](https://hashnode.com/posts/leetcode-153-find-minimum-in-rotated-sorted-array/6860f587ebdbfcfd3df6cb04)

### [LeetCode 268: Missing Number](https://blog.brucelinweb.com/leetcode-268-missing-number?utm_source=hashnode&utm_medium=feed)

class Solution { public: int missingNumber(vector<int>& nums) { int result = nums.size(); for (int i = 0; i < nums.size(); i++) { result ^= i ^ nums\[i\]; } return result; } }; Question Given an ar...

2 min read · [blog.brucelinweb.com](https://blog.brucelinweb.com/leetcode-268-missing-number?utm_source=hashnode&utm_medium=feed)

[Jun 27, 2025](https://hashnode.com/posts/leetcode-268-missing-number/685e4ee1e9eeb54f904f9f96)

### [LeetCode 338: Counting Bits](https://blog.brucelinweb.com/leetcode-338-counting-bits?utm_source=hashnode&utm_medium=feed)

Problem Overview Given an integer n, return an array ans of length n + 1 where ans\[i\] is the number of set bits in the binary representation of i. Example: n = 5 → Output: \[0, 1, 1, 2, 1, 2\] Constraints: 0 <= n <= 10^5 Solution 1: Brute Force Thi...

2 min read · [blog.brucelinweb.com](https://blog.brucelinweb.com/leetcode-338-counting-bits?utm_source=hashnode&utm_medium=feed)

[Jun 26, 2025](https://hashnode.com/posts/leetcode-338-counting-bits/685cb3b564a9eda5ecd8603f)

### [LeetCode 191. Number of 1 Bits](https://blog.brucelinweb.com/leetcode-191-number-of-1-bits?utm_source=hashnode&utm_medium=feed)

Problem Overview The goal is to write a function that takes an unsigned integer and returns the number of ‘1’ bits it has in its binary representation. This value is also known as Hamming weight. This is the classic bit manipulation problem. Solution...

2 min read · [blog.brucelinweb.com](https://blog.brucelinweb.com/leetcode-191-number-of-1-bits?utm_source=hashnode&utm_medium=feed)

[Jun 12, 2025](https://hashnode.com/posts/leetcode-191-number-of-1-bits/684b095fa4b4b014d8f91667)