41 docs tagged with "Bit Manipulation"

This is a solution to the 1-bit and 2-bit Characters problem on LeetCode.

This is a solution to the 2220. Minimum Bit Flips to Convert Number.

This is a solution to the 3211. Generate Binary Strings Without Adjacent Zeros.

solution to the leetcode problem beautiful arrrangement.

This is a solution to the Binary Number with Alternating Bits problem on LeetCode.

This is a solution to the Binary Prefix Divisible By 5 problem on LeetCode.

This is a solution to the Binary Watch problem on LeetCode.

This document explains how to convert A to B using bit manipulation.

This document provides a solution where we return the bitwise AND of all numbers in a given range.

This is a solution to the Complement of Base 10 Integer problem on LeetCode.

This is a solution to the Convert a Number to Hexadecimal problem on LeetCode.

This document provides solutions for finding the maximum total reward using dynamic programming and bit manipulation, implemented in C++, Java, and Python.

This document provides solutions for Count-Alternating-subarrays solution of leetcode questions

This is a solution to the Counting Bits problem on LeetCode.

This document covers methods to find the position of the set bit in a number in various programming languages.

This description is for the solution of Find Subarray With Bitwise OR Closest to K

Given an array of N + 1 size, where each element is between 1 and N. Assuming there is only one duplicate number, your task is to find the duplicate number.

This document explores different approaches to solving the Gray to Binary Equivalent problem, including brute force, bit manipulation, and optimization techniques, in various programming languages.

This document provides a solution where we Return the $k^th$ smallest amount that can be made using these coins.

This is a solution to the Maximize the Number of Partitions After Operations problem on LeetCode.

This document provides solutions for finding the maximum total reward using dynamic programming and bit manipulation, implemented in C++, Java, and Python.

This is a solution to the maximum xor of two numbers in an array problem on LeetCode.

Solve the problem of finding the maximum bitwise XOR of an element with given elements that do not exceed a specified value using trie and bit manipulation.

This document provides solutions for Minimize Manhattan Distances using dynamic implemented in C++, Java, and Python.

This document provides a solution where we return the minimum cost to connect the two groups.

This page explains the problem of finding non-negative integers without consecutive ones.

This is a solution to the number complement problem on LeetCode.

This document covers methods to determine if a number is sparse or not in various programming languages.

Write a function that takes the binary representation of a positive integer and returns the number of set bits it has (also known as the Hamming weight).

This tutorial covers the solution to the Power of 2 problem from the GeeksforGeeks.

This is a solution to the Power of Four problem on LeetCode.

Problem Description

This is a solution to pyramid-transition-matrix problem on LeetCode.

Problem Description

This document covers methods to set the kth bit of a number to 1 in various programming languages.

Given an integer array `nums`, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once. You can return the answer in any order.

This is a solution to the Subsets problem on LeetCode.

This is a solution to the total hamming distance problem on LeetCode.

This is a solution to the Two Repeated Elements problem.

This document provides solutions for Water-bottles-II solution of leetcode questions

This is the solution for XOR Queries Of A Subarray in leetcode.