menu
{ "item_title" : "Top 20 coding interview problems asked in Google with solutions", "item_author" : [" Lin Quan "], "item_description" : "Must Have for Google Aspirants This book is written for helping people prepare for Google Coding Interview. It contains top 20 programming problems frequently asked @Google with detailed worked-out solutions both in pseudo-code and C++(and C++11).Matching Nuts and Bolts OptimallySearching two-dimensional sorted arrayLowest Common Ancestor(LCA) ProblemMax Sub-Array ProblemCompute Next Higher Number2D Binary SearchString Edit DistanceSearching in Two Dimensional SequenceSelect Kth Smallest ElementSearching in Possibly Empty Two Dimensional SequenceThe Celebrity ProblemSwitch and Bulb ProblemInterpolation SearchThe Majority ProblemThe Plateau ProblemSegment ProblemsEfficient PermutationThe Non-Crooks ProblemMedian Search ProblemMissing Integer Problem", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/1/49/546/657/1495466574_b.jpg", "price_data" : { "retail_price" : "9.99", "online_price" : "9.99", "our_price" : "9.99", "club_price" : "9.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Top 20 coding interview problems asked in Google with solutions|Lin Quan

Top 20 coding interview problems asked in Google with solutions : Algorithmic Approach

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

Must Have for Google Aspirants This book is written for helping people prepare for Google Coding Interview. It contains top 20 programming problems frequently asked @Google with detailed worked-out solutions both in pseudo-code and C++(and C++11).

  1. Matching Nuts and Bolts Optimally
  2. Searching two-dimensional sorted array
  3. Lowest Common Ancestor(LCA) Problem
  4. Max Sub-Array Problem
  5. Compute Next Higher Number
  6. 2D Binary Search
  7. String Edit Distance
  8. Searching in Two Dimensional Sequence
  9. Select Kth Smallest Element
  10. Searching in Possibly Empty Two Dimensional Sequence
  11. The Celebrity Problem
  12. Switch and Bulb Problem
  13. Interpolation Search
  14. The Majority Problem
  15. The Plateau Problem
  16. Segment Problems
  17. Efficient Permutation
  18. The Non-Crooks Problem
  19. Median Search Problem
  20. Missing Integer Problem

This item is Non-Returnable

Details

  • ISBN-13: 9781495466571
  • ISBN-10: 1495466574
  • Publisher: Createspace Independent Publishing Platform
  • Publish Date: February 2014
  • Dimensions: 8.5 x 5.5 x 0.35 inches
  • Shipping Weight: 0.43 pounds
  • Page Count: 164

Related Categories

You May Also Like...

    1

BAM Customer Reviews