• 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

Practo Hiring Experience

December 22, 2014 by Dhaval Dave

Started from Written Test on HackeEarth1) http://www.hackerearth.com/problem/algorithm/divide-to-three-33/
Code Solution Click : http://ideone.com/7M1o9j
2) http://www.hackerearth.com/problem/algorithm/good-times-vs-bad-times-3/
Code Solution Click : http://ideone.com/xj7o49

After few days F2F is scheduled….

Face to Face Interview : 

1) About my current work, Discussion on current work

2) Very deep Discussion about my B.Tech and M.Tech Projects and Research Work.

3) As I know sql injection, he asked several questions on sql injection, why it happens and how etc just to check my knowledge in it.

4) Simply started with Fibonacci Series code
wrote recursive solution and then wrote solution which uses memorization technic in O(n) with
space complexity O(n)

Then incremental solution in O(n).
with

while(i<n){
  a=1;
  b=1;
  c=a+b;
  a=b;
  b=c;
  i++
}
print c;

Then he wished to create same solution (above one) with recursion. that modification also I did.
Then he wanted Previous Recursive solution
with F(n) = F(n-1)+F(n-2) in O(n) but without using Space or Memorization.
As I could not do, He suggested me to use Accumulator, for that also I was not aware.

4) Then Interviewer Asked me question on “Minimum insertions to form a palindrome”
Solution check : http://www.geeksforgeeks.org/dynamic-programming-set-28-minimum-insertions-to-form-a-palindrome/

Which I partially could’not , as DP solutions are tricky,
but he liked the approach I was doing, and he saw code for it.

5) Question on SQL left joins.

Late in evening I got call for Rejection :(

Similar Articles

Filed Under: Interview Experience

Reader Interactions

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

Linked List V/S Binary Search Tree

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

Code Chef PRGIFT Solution

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 ?

25 horses 5 tracks Find 3 fastest puzzle

Find the element that appears once others appears thrice

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

Maximum occurred Smallest integer in n ranges

Naurki.com Security Breach

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Amazon Interview On-Campus For Internship – 1

Best Java Book | Top Java Programming Book for Beginners

Skiing on Mountains Matrix

Client Server C program

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

SAP Off Campus Hiring_ March 2015 Computer Skills

Check Binary Tree is Binary Search Tree or not

CodeChef’ RRCOPY

HackeEarth Flipkart’s Drone

SAP Off Campus Hiring_ March 2015 Verbal Skills

Search element in a matrix with all rows and columns in sorted order

Wrong Directions given find minimum moves so that he can reach to the destination

LeetCode: Container With Most Water

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

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

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 Stack in place

Memory Efficient LinkedList

Leetcode: Merge Intervals

simple sql injection

Copyright © 2026 · Genesis Framework · WordPress · Log in