• 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

algorithm

Closed Parentheses checker

December 26, 2017 by Dhaval Dave

example explaining problem

‏Problem Statement:

You are given 3 types of parentheses (),{},[]. Now you are supposed to check whether a given string containing some parentheses is closed or not.

example depicting closed sequence… Read More

Filed Under: Amazon Interview Question, Interview Questions Tagged With: algorithm, backtracking

Knight Tour Problem (Graph – Breadth First Search)

December 22, 2017 by Dhaval Dave

Knight Tour Problem : Given a chess board of size n x n, initial position of knight and final position of knight. We need to find the minimum number of steps required to reach final … Read More

Filed Under: Algorithm, Amazon Interview Question, Flipkart Interview Questions, Graph, Microsoft Interview Questions Tagged With: algorithm, BFS, Graph

Find next greater number with same set of digits

July 20, 2014 by Dhaval Dave

Given a number n, find the smallest number that has same set of digits as n and is greater than n. If x is the greatest possible number with its set of digits, then print
… Read More

Filed Under: Amazon Interview Question, Interview Questions, problem Tagged With: algorithm, Mathematical

Implement a generic binary search algorithm for Integer Double String etc

March 20, 2014 by Dhaval Dave

A Simple Binary Search for Integers

BinarySearch(A[0..N-1], value) 
{
   low = 0
   high = N - 1
   while (low <= high) {
       mid = low + ((high - low) / 2)
       if (A[mid] > value)
           
… Read More

Filed Under: problem Tagged With: algorithm

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

Best Java Book | Top Java Programming Book for Beginners

Reversal of LinkedList

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

Binary Tree Isomorphic to each other

Microsoft BING Interview Experience

Convert number to words java

Cisco Hiring Event 21st – 22nd Feb 2015

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

Maximum occurred Smallest integer in n ranges

Flipkart Set 1 On Campus with Answers

Check if an array has duplicate numbers in O(n) time and O(1) space

Code Chef PRGIFT Solution

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

How Radix sort works

Find loop in Singly linked list

Print Power Set of a Set

Reverse a Linked List in groups of given size

Binary Tree in Java

Coin Collection Dynamic Programming

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

FizzBuzz Solution C C++

Fibonacci Hashing & Fastest Hashtable

Count Possible Decodings of a given Digit Sequence

Handle duplicates in Binary Search Tree

Max Sum in circularly situated Values

SAP Interview Questions

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

Daughter’s Age VeryGood Puzzle

LeetCode: Binary Tree Maximum Path Sum

Copyright © 2025 · Genesis Framework · WordPress · Log in