• 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

Interview Experience

TicTacToe Game As Asked in Flipkart

August 17, 2014 by Dhaval Dave

Write a running code in any language to implement the famous tic-tac-toe game.
Decide which basic functions which would be required to implement the same. 
Then try to code it your self else basic code
… Read More

Filed Under: Flipkart Interview Questions, Interview Experience, problem Tagged With: 2d matrix

Flipkart Set 1 On Campus with Answers

August 5, 2014 by Dhaval Dave

Round 1(Online):
There were 2 questions time limit 90 mins.
1. A person wants to go from origin to a particular location, he can move in only 4 directions(i.e East, West, North, South) but his
… Read More

Filed Under: Flipkart Interview Questions, Interview Experience

Amazon Interview On-Campus For Internship – 1

March 25, 2014 by Dhaval Dave

 Amazon Interview On-Campus For Internship – 1

Online Round Coding Question:
Q1. Given a float number 7.64, convert it into the string WITHOUT using any inbuilt function/library.
for eg:
input
float no.: 7.64
output
string:

… Read More

Filed Under: Amazon Interview Question, Interview Experience Tagged With: Amazon

Adobe Interview Questions 8 month Exp

March 19, 2014 by Dhaval Dave

Adobe Interview Questions Set 1

For Experience : 8 months
 
First Round :
Held on interview street Aptitude + Technical (standard pattern and questions)
Check Questions : Adobe C,Aptitude Written Questions Answers
… Read More

Filed Under: Adobe Interview Questions, Interview Experience

  • « Previous Page
  • Page 1
  • Page 2
  • Page 3

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

Right view of Binary tree

SAP Off Campus Hiring_ March 2015 Computer Skills

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

LeetCode: Container With Most Water

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

Knight Tour Problem (Graph – Breadth First Search)

Reverse a Linked List in groups of given size

Given Set of words or A String find whether chain is possible from these words or not

Closed Parentheses checker

Code Chef PRGIFT Solution

C++ OOPs Part1

Naurki.com Security Breach

VMWare SDEII Interview

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

SAP Off Campus Hiring_ March 2015 Sample Questions

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

Leetcode: Edit Distance

Templates in C++

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

Walmart Labs Interview Experience

1014 Practice Question of New GRE – Princeton

Printing Longest Common Subsequence

Word Break Problem

Printing each word reverse in string

Daughter’s Age VeryGood Puzzle

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

Common Ancestor in a Binary Tree or Binary Search Tree

How strtok() Works

Find the element that appears once others appears thrice

Print all nodes that are at distance k from a leaf node

Copyright © 2026 · Genesis Framework · WordPress · Log in