Skip to main content

Number Complement


Number Complement For Positive Integer

For a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.
Solution 

To solve above problem we need to generate the binary representation of a number and go through the bits to find the complement of the bit. 

To get the complement a simple logic can we do the XOR the bit with 1 which will give its complement 
i.e. 
1 ^ 1 = 0
0 ^ 1 = 1

Sample Code 

Labels:

Comments

  1. AnonymousFebruary 2, 2022 at 12:48 PM

    Casino Site Review: Lucky Club Casino - Las Vegas - LuckyClub
    Check out our comprehensive review of Lucky Club Casino. Find out which slot games are available and how they are developed and which are luckyclub.live safe.

    ReplyDelete
  2. AnonymousNovember 22, 2022 at 6:21 PM

    Welcome 카지노 bonuses apply to new players adding cash to their account for the first time. Making a bigger preliminary deposit is in your greatest interest since these are normally the largest and most tasty promotions. We hope our take a look at|have a look at} the highest on line casino bonus codes helped you determine which one holds the best worth for you. Also, the net on line casino additionally has a deposit bonus for returning players, so you all the time have a reason to play at this enjoyable and quirky playing web site.

    ReplyDelete

Post a Comment

Popular posts from this blog

First Unique Character in a String

Problem Find the first non-repeating character in a given String and return it's index. If it doesn't exist, return -1. Solution We can execute the logic in two steps Find the frequencies of every letter how many times they appear in the string Using those frequencies find the the first letter which has value as 1 We need to use a Map to keep track of the first index of a letter and separate storage to maintain the frequency count. Example code is as below:
1 comment
Read more

Find the Town Judge

Problem In a town, there are 'n' people labelled from 1 to 'n'. There is a rumor that one of these people is secretly the town judge. If the town judge exists, then: The town judge trusts nobody. Everybody (except for the town judge) trusts the town judge. There is exactly one person that satisfies properties 1 and 2. The given input is an array of pairs trust[i] = [a, b] representing that the person labelled 'a' trusts the person labelled 'b'. If the town judge exists and can be identified, return the label of the town judge.  Otherwise, return '-1'. Solution To solve the problem we can use a simple array of size N+1 (we will use N+1 to avoid maintaining numbers as arrays starts with index 0 and we have people numbered from 1). Every index starting one represent a member of the town. We can use following logic to solve the problem. Lets go through the entire list of trust values and do following things For every &#
Post a Comment
Read more