• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Two Pointer

LeetCode: Container With Most Water

October 29, 2019 by Arshdeep Singh

Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the … Read More

Filed Under: Amazon Interview Question, Array, Facebook, Google, LeetCode Tagged With: Array, Two Pointer

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

VMWare SDEII Interview

Maximum of all subarrays of size k

Adobe Interview Questions 8 month Exp

Knight Tour Problem (Graph – Breadth First Search)

Generate largest number arranging a no. of given non negative integer numbers

Find min element in Sorted Rotated Array (Without Duplicates)

Templates in C++

Maximum difference between two elements s.t larger element appears after the smaller number

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

BlueStone E-commerce Interview Experience

Add Sub Multiply very large number stored as string

C++ OOPs Part1

Find position of the only set bit

Level order traversal in Spiral form

Given a sorted array and a number x, find the pair in array whose sum is closest to x

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Generic Object Oriented Stack with Template

Subset Sum Problem Dynamic programming

HackeEarth Flipkart’s Drone

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

BFS (Breath First Search)

Printing each word reverse in string

Memory Efficient LinkedList

Edit Distance ( Dynamic Programming )

Get Minimum element in O(1) from input numbers or Stack

Count Possible Decodings of a given Digit Sequence

Reversal of LinkedList

Binary Tree in Java

Trie Dictionary

Copyright © 2026 · Genesis Framework · WordPress · Log in