• 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

The greedy coins game Dynamic Programming

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

HackeEarth Flipkart’s Drone

Number of Islands BFS/DFS

Implement a generic binary search algorithm for Integer Double String etc

Knight Tour Problem (Graph – Breadth First Search)

Linked List V/S Binary Search Tree

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

ADOBE Aptitude C Language Test

Reversal of LinkedList

Memory Efficient LinkedList

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

Find min element in Sorted Rotated Array (Without Duplicates)

CodeChef Code SGARDEN

Stickler thief

Generic Object Oriented Stack with Template

Amazon Interview On-Campus For Internship – 1

Find min element in Sorted Rotated Array (With Duplicates)

Find loop in Singly linked list

Python Dictionaries

Convert number to words java

strtok()

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

Handle duplicates in Binary Search Tree

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

LeetCode: Binary Tree Maximum Path Sum

VMWare SDEII Interview

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

Urban Ladder Written Test.

simple sql injection

Copyright © 2025 · Genesis Framework · WordPress · Log in