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

    Implement StrStr Interviewbit Solution

    Implement strStr(). strstr - locate a substring ( needle ) in a string ( haystack ). Try not to use standard library string functions for

    Count And Say InterviewBit Solution

    The count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, ...

    Longest Common Prefix InterviewBit Solution

    Problem Description: Given the array of strings A, you need to find the longest string S which is the prefix of ALL the strings in the arra

    Palindrome String InterviewBit Solution

    Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.

    Median of Array InterviewBit Solution

    There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays ( The median of the array formed

    Rotated Sorted Array Search InterviewBit Solution

    Given an array of integers A of size N and an integer B. array A is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 mi

    Simple Queries InterviewBit Solution

    You are given an array A having N integers. You have to perform the following steps in a given order. generate all subarrays of A.

    Implement Power Function InterviewBit Solution

    Implement pow(x, n) % d. Note that remainders on division cannot be negative. In other words, make sure the answer you return is non-negati

    Sorted Insert Position InterviewBit Solution

    Given a sorted array A and a target value B, return the index if the target is found. If not, return the index where it would be if it were

    Search for a Range InterviewBit Solution

    Given a sorted array of integers A(0 based index) of size N, find the starting and ending position of a given integer B in array A. Your alg
    12
    3
    45

    Contact us: 

    support@algostreak.com

    Terms of Service | Privacy Policy

    Copyright © 2020 AlgoStreak