• 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

Test Cases for Round Function

Maximum of all subarrays of size k

HackeEarth Flipkart’s Drone

SAP Hiring Off-Campus General Aptitude

Linked List V/S Binary Search Tree

Memory Efficient LinkedList

Convert number to words java

Closed Parentheses checker

Find the kth number with prime factors 3, 5 and 7

Diagonal Traversal of Binary Tree

Python String and numbers

Implement a generic binary search algorithm for Integer Double String etc

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Flipkart Set 1 On Campus with Answers

Find if two rectangles overlap

SAP Interview Questions

Handle duplicates in Binary Search Tree

VMWare SDEII Interview

Edit Distance ( Dynamic Programming )

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

Sort Stack in place

Find the element that appears once others appears thrice

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

Word Break Problem

Find two non repeating elements in an array of repeating elements

Count Possible Decodings of a given Digit Sequence

Length of the longest substring without repeating characters

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

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

FizzBuzz Solution C C++

Copyright © 2025 · Genesis Framework · WordPress · Log in