AlgoStreak

  • Home

  • Interview

    • Online Assessment Question
    • Easy Interview Question
    • Medium Interview Question
    • Hard Interview Question
    • Amazon Interview Questions
    • Google Interview Questions
    • Microsoft Interview Questions
  • CP & Algo

    • Ladder I
    • Ladder II
    • Ladder III
  • Article

  • Discuss

  • More

    Use tab to navigate through the menu items.
    • All Posts
    • Adobe
    • Amazon
    • Facebook
    • Google
    • Microsoft
    • Goldman Sachs
    • Directi
    • Array
    • Interviewbit
    • JP Morgan
    • LinkedIn
    • Math
    • Oracle
    • Paypal
    • VMWare
    • Yahoo
    • Binary Search
    • String
    • Bit Manipulation
    • Two Pointers
    • Flipkart
    • Amazon
    Search

    Single Number II - InterviewBit Solution

    Given an array of integers, every element appears thrice except for one which occurs once. Find that element which does not appear thrice.

    Single Number - InterviewBit Solution

    Given an array of integers A, every element appears twice except for one. Find that single one. NOTE: Your algorithm should have a linear

    XOR-ing the Subarrays! - InterviewBit Solution

    Given an integer array A of size N. You need to find the value obtained by XOR-ing the contiguous subarrays, followed by XOR-ing the values

    Palindromic Binary Representation InterviewBit Solution

    Given an integer A find the Ath number whose binary representation is a palindrome. NOTE: Consider the 1st number whose binary representat

    Count Total Set Bits - InterviewBit Solution

    Given a positive integer A, the task is to count the total number of set bits in the binary representation of all the numbers from 1 to A.

    Min XOR value - InterviewBit Solution

    Given an integer array A of N integers, find the pair of integers in the array which have minimum XOR value. Report the minimum XOR value.

    Different Bits Sum Pairwise - InterviewBit Solution

    We define f(X, Y) as number of different corresponding bits in binary representation of X and Y. For example, f(2, 7) = 2,

    Divide Integers InterviewBit Solution

    Divide two integers without using multiplication, division and mod operator. Return the floor of the result of the division.

    Reverse Bits InterviewBit Solution

    Reverse the bits of a 32-bit unsigned integer A. To solve this problem first find the positions of set bits in the original number then

    Number of 1 Bits - InterviewBit Solution

    Given a number, count the number of set bits.

    Contact us: 

    support@algostreak.com

    Terms of Service | Privacy Policy

    Copyright © 2020 AlgoStreak