• 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

Templates in C++

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

Printing Longest Common Subsequence

Binary Tree in Java

The greedy coins game Dynamic Programming

Add Sub Multiply very large number stored as string

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

System Design: Designing a LLD for Hotel Booking

K’th Largest Element in BST when modification to BST is not allowed

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

Difference between a LinkedList and a Binary Search Tree BST

Singly linked list

SAP Off Campus Hiring_ March 2015 Verbal Skills

CodeChef Code SGARDEN

Trie Dictionary

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

Print Power Set of a Set

Number of Islands BFS/DFS

Calculate price of parking from parking start end time prices

25 horses 5 tracks Find 3 fastest puzzle

Practo Hiring Experience

Maximum sum contiguous subarray of an Array

flattens 2 D linked list to a single sorted link list

Memory Efficient LinkedList

Subset Sum Problem Dynamic programming

Trapping Rain Water

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

Sort an array according to the order defined by another array

Client Server C program

Copyright © 2025 · Genesis Framework · WordPress · Log in