Data structures and algorithms
Single Number
Single Number: Given a non-empty array of integers nums, every element appears twice except for one.
read more
Data structures and algorithms
Missing Number
Missing Number: Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.
read more
Data structures and algorithms
Counting Bits
Counting Bits: Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i.
read moreAbout Me
After investing countless hours in courses, books, and guides, as well as honing my skills on LeetCode, we came to the realization that interview preparation can be an incredibly time-consuming process, not to mention the stress of actually passing the interviews.
Know More