Bit Manipulation Interview Questions

LeetCode #2433: Find The Original Array of Prefix Xor. Difficulty: Medium. Topics: Array, Bit Manipulation. Asked at Nvidia in the last 6 months.

LeetCode #2680: Maximum OR. Difficulty: Medium. Topics: Array, Greedy, Bit Manipulation, Prefix Sum. Asked at Point72 in the last 6 months.

Status : 2023 grad, IIT/NIT/IIIT Position : Software Engineer Location : Bangalore/Hyderabad/Chennai/Noida Date : July 2022 Round 1: Online Round (Platform \u2013 HirePro) \u2022\tQuantitative Aptitude (20 Questions, 30 minutes) \u2022\tProgramming MCQ (20 Questions, 30 minutes) \u2022\tTechnical Section...

LeetCode #1009: Complement of Base 10 Integer. Difficulty: Easy. Topics: Bit Manipulation. Asked at Bloomberg in the last 6 months.

LeetCode #2595: Number of Even and Odd Bits. Difficulty: Easy. Topics: Bit Manipulation. Asked at Google in the last 6 months.

LeetCode #868: Binary Gap. Difficulty: Easy. Topics: Bit Manipulation. Asked at Microsoft in the last 6 months.

Position: Software Engineer Summer Intern 2020 Question 1: https://leetcode.com/problems/single-number/ I gave hashmap solution quickly. Implemented and discussed about the time and space complexity. Follow Up: Memory constraint in adding to the hashmap (Solution should be...

LeetCode #2220: Minimum Bit Flips to Convert Number. Difficulty: Easy. Topics: Bit Manipulation. Asked at Meta in the last 6 months.

You are given an integer array arr. For 0 <= i < arr.length, 0 <= j < arr.length and i != j return the maximum sum of xor(arr[i], arr[j]) and...

There was a question in my tiktok oa which was of this sort - Find the number of subarrays of length atleast 3 such that the bitwise XOR of the...

Given a string s, can you compose exactly K non-empty palindromes using all leters of s? Note that you can use only letters from s. Each letter from s that you...

I was asked this question in recent ByteDance OA Q) An array of n integers, arr, is given. Pick any index then calculate the XOR of the array from that...

Write a C function which receives two signed integers and computes the multiplication of those integers. The first two arguments say p and q represents the multiplicand and multiplier, respectively. Though...