• 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

CodeChef’ RRCOPY

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

Print vertical sum of all the axis in the given binary tree

System Design: Designing a LLD for Hotel Booking

LeetCode: Binary Tree Maximum Path Sum

VMWare SDEII Interview

SAP Off Campus Hiring_ March 2015 Computer Skills

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

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

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

Find next greater number with same set of digits

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

Amazon Interview Experience – SDE Chennai

Given a string, find the first character which is non-repetitive

Naurki.com Security Breach

Trie Dictionary

Python List

Leetcode: Merge Intervals

Urban Ladder Written Test.

Implement a generic binary search algorithm for Integer Double String etc

Sort Stack in place

Python Array String

Find the element that appears once others appears thrice

Apriori algorithm C Code Data Mining

Right view of Binary tree

Python String and numbers

Difference between a LinkedList and a Binary Search Tree BST

Interfaces in C++ (Abstract Classes in C++)

Longest Increasing Subsequence

flattens 2 D linked list to a single sorted link list

Copyright © 2026 · Genesis Framework · WordPress · Log in