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

    3 Sum - InterviewBit Solution

    Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target.

    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

    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.

    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

    Power of 2 - InterviewBit Solution

    Find if the given number is a power of 2 or not. More specifically, find if the given number can be expressed as 2^k where k >= 1.

    Roman To Integer InterviewBit Solution

    Given a string A representing a roman numeral. Convert A into an integer. A is guaranteed to be within the range from 1 to 3999.

    Integer To Roman InterviewBit Solution

    Given an integer A, convert it to a roman numeral, and return a string corresponding to its roman numeral version.
    1
    2345

    Contact us: 

    support@algostreak.com

    Terms of Service | Privacy Policy

    Copyright © 2020 AlgoStreak