{"product_id":"cracking-programming-interviews-sergei-nakariakov-9781495459801","title":"Cracking Programming Interviews: 500 Questions with Solutions","description":"Part I Algorithms and Data Structures \u003cp\u003e\u003c\/p\u003e1 Fundamentals \u003cp\u003e\u003c\/p\u003eApproximating the square root of a number\u003cbr\u003eGenerating Permutation Efficiently\u003cbr\u003eUnique 5-bit Sequences\u003cbr\u003eSelect Kth Smallest Element\u003cbr\u003eThe Non-Crooks Problem\u003cbr\u003eIs this (almost) sorted?\u003cbr\u003eSorting an almost sorted list\u003cbr\u003eThe Longest Upsequence Problem\u003cbr\u003eFixed size generic array in C++\u003cbr\u003eSeating Problem\u003cbr\u003eSegment Problems\u003cbr\u003eExponentiation\u003cbr\u003eSearching two-dimensional sorted array\u003cbr\u003eHamming Problem\u003cbr\u003eConstant Time Range Query\u003cbr\u003eLinear Time Sorting\u003cbr\u003eWriting a Value as the Sum of Squares\u003cbr\u003eThe Celebrity Problem\u003cbr\u003eTransport Problem\u003cbr\u003eFind Length of the rope\u003cbr\u003eSwitch Bulb Problem\u003cbr\u003eIn, On or Out\u003cbr\u003eThe problem of the balanced seg\u003cbr\u003eThe problem of the most isolated villages \u003cp\u003e\u003c\/p\u003e2 Arrays \u003cp\u003e\u003c\/p\u003eThe Plateau Problem\u003cbr\u003eSearching in Two Dimensional Sequence\u003cbr\u003eThe Welfare Crook Problem\u003cbr\u003e2D Array Rotation\u003cbr\u003eA Queuing Problem in A Post Office\u003cbr\u003eInterpolation Search\u003cbr\u003eRobot Walk\u003cbr\u003eLinear Time Sorting\u003cbr\u003eWrite as sum of consecutive positive numbers\u003cbr\u003ePrint 2D Array in Spiral Order\u003cbr\u003eThe Problem of the Circular Racecourse\u003cbr\u003eSparse Array Trick\u003cbr\u003eBulterman's Reshuffling Problem\u003cbr\u003eFinding the majority\u003cbr\u003eMode of a Multiset\u003cbr\u003eCircular Array\u003cbr\u003eFind Median of two sorted arrays\u003cbr\u003eFinding the missing integer\u003cbr\u003eFinding the missing number with sorted columns\u003cbr\u003eRe-arranging an array \u003cbr\u003eSwitch and Bulb Problem\u003cbr\u003eCompute sum of sub-array\u003cbr\u003eFind a number not sum of subsets of array\u003cbr\u003eKth Smallest Element in Two Sorted Arrays\u003cbr\u003eSort a sequence of sub-sequences\u003cbr\u003eFind missing integer\u003cbr\u003eInplace Reversing\u003cbr\u003eFind the number not occurring twice in an array \u003cp\u003e\u003c\/p\u003e3 Trees \u003cp\u003e\u003c\/p\u003eLowest Common Ancestor(LCA) Problem\u003cbr\u003eSpying Campaign \u003cp\u003e\u003c\/p\u003e4 Dynamic Programming \u003cp\u003e\u003c\/p\u003eStage Coach Problem\u003cbr\u003eMatrix Multiplication\u003cbr\u003eTSP Problem\u003cbr\u003eA Simple Path Problem\u003cbr\u003eString Edit Distance\u003cbr\u003eMusic recognition\u003cbr\u003eMax Sub-Array Problem \u003cp\u003e\u003c\/p\u003e5 Graphs \u003cp\u003e\u003c\/p\u003eReliable distribution\u003cbr\u003eIndependent Set\u003cbr\u003eParty Problem \u003cp\u003e\u003c\/p\u003e6 Miscellaneous \u003cp\u003e\u003c\/p\u003eCompute Next Higher Number\u003cbr\u003eSearching in Possibly Empty Two Dimensional Sequence\u003cbr\u003eMatching Nuts and Bolts Optimally\u003cbr\u003eRandom-number generation\u003cbr\u003eWeighted Median\u003cbr\u003eCompute a n\u003cbr\u003eCompute a n revisited\u003cbr\u003eCompute the product a   b\u003cbr\u003eCompute the quotient and remainder\u003cbr\u003eCompute GCD\u003cbr\u003eComputed Constrained GCD\u003cbr\u003eAlternative Euclid' Algorithm\u003cbr\u003eRevisit Constrained GCD\u003cbr\u003eCompute Square using only addition and subtraction\u003cbr\u003eFactorization\u003cbr\u003eFactorization Revisited\u003cbr\u003eDecimal Representation\u003cbr\u003eReverse Decimal Representation\u003cbr\u003eSolve Inequality\u003cbr\u003eSolve Inequality Revisited\u003cbr\u003ePrint Decimal Representation\u003cbr\u003eDecimal Period Length\u003cbr\u003eSequence Periodicity Problem\u003cbr\u003eCompute Function\u003cbr\u003eEmulate Division and Modulus Operations\u003cbr\u003eSorting Array of Strings: Linear Time\u003cbr\u003eLRU data structure\u003cbr\u003eExchange Prefix and Suffix \u003cp\u003e\u003c\/p\u003e7 Parallel Algorithms \u003cp\u003e\u003c\/p\u003eParallel Addition\u003cbr\u003eFind Maximum\u003cbr\u003eParallel Prefix Problem\u003cbr\u003eFinding Ranks in Linked Lists\u003cbr\u003eFinding the k th Smallest Element \u003cp\u003e\u003c\/p\u003e8 Low Level Algorithms \u003cp\u003e\u003c\/p\u003eManipulating Rightmost Bits\u003cbr\u003eCounting 1-Bits\u003cbr\u003eCounting the 1-bits in an Array\u003cbr\u003eComputing Parity of a word\u003cbr\u003eCounting Leading\/Trailing 0's\u003cbr\u003eBit Reversal\u003cbr\u003eBit Shuffling\u003cbr\u003eInteger Square Root\u003cbr\u003eNewton's Method\u003cbr\u003eInteger Exponentiation\u003cbr\u003eLRU Algorithm\u003cbr\u003eShortest String of 1-Bits\u003cbr\u003eFibonacci words\u003cbr\u003eComputation of Power of 2\u003cbr\u003eRound to a known power of 2\u003cbr\u003eRound to Next Power of 2\u003cbr\u003eEfficient Multiplication by Constants\u003cbr\u003eBit-wise Rotation\u003cbr\u003eGray Code Conversion\u003cbr\u003eAverage of Integers without Overflow \u003cbr\u003eLeast\/Most Significant 1 Bit\u003cbr\u003eNext bit Permutation\u003cbr\u003eModulus Division \u003cp\u003e\u003c\/p\u003ePart II C++ \u003cp\u003e\u003c\/p\u003e8 General\u003cbr\u003e9 Constant Expression\u003cbr\u003e10 Type Specifier\u003cbr\u003e11 Namespaces\u003cbr\u003e12 Misc\u003cbr\u003e13 Classes\u003cbr\u003e14 Templates\u003cbr\u003e15 Standard Library\u003cbr\u003e\u003cbr\u003e\u003cbr\u003e\u003cb\u003eAuthor:\u003c\/b\u003e Sergei Nakariakov\u003cbr\u003e\u003cb\u003eISBN-10:\u003c\/b\u003e 1495459802\u003cbr\u003e\u003cb\u003eISBN-13:\u003c\/b\u003e 9781495459801\u003cbr\u003e\u003cb\u003ePublisher:\u003c\/b\u003e Createspace Independent Publishing Platform\u003cbr\u003e\u003cb\u003eLanguage:\u003c\/b\u003e English\u003cbr\u003e\u003cb\u003ePublished:\u003c\/b\u003e 02\/07\/2014\u003cbr\u003e\u003cb\u003ePages:\u003c\/b\u003e 524\u003cbr\u003e\u003cb\u003eFormat:\u003c\/b\u003e Paperback\u003cbr\u003e\u003cb\u003eWeight:\u003c\/b\u003e 1.53lbs\u003cbr\u003e\u003cb\u003eSize:\u003c\/b\u003e 9.00h x 6.00w x 1.05d","brand":"Sergei Nakariakov","offers":[{"title":"Paperback","offer_id":44124121235711,"sku":"9781495459801","price":29.99,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0662\/2982\/9887\/files\/img_71a01341-e0ab-4509-b783-8b57ac38db64.jpg?v=1687434872","url":"https:\/\/www.whiterainbookhouse.com\/products\/cracking-programming-interviews-sergei-nakariakov-9781495459801","provider":"WR Book House","version":"1.0","type":"link"}