--- product_id: 14873303 title: "Cracking Programming Interviews: 500 Questions with Solutions" brand: "nakariakov sergei" price: "£35.09" currency: GBP in_stock: true category: "Paperback" url: https://www.desertcart.co.uk/products/14873303-cracking-programming-interviews-500-questions-with-solutions store_origin: GB region: United Kingdom --- # Cracking Programming Interviews: 500 Questions with Solutions **Brand:** nakariakov sergei **Price:** £35.09 **Availability:** ✅ In Stock ## Quick Answers - **What is this?** Cracking Programming Interviews: 500 Questions with Solutions by nakariakov sergei - **How much does it cost?** £35.09 with free shipping - **Is it available?** Yes, in stock and ready to ship - **Where can I buy it?** [www.desertcart.co.uk](https://www.desertcart.co.uk/products/14873303-cracking-programming-interviews-500-questions-with-solutions) ## Best For - nakariakov sergei enthusiasts ## Why This Product - Trusted nakariakov sergei brand quality - Free international shipping included - Worldwide delivery with tracking - 15-day hassle-free returns ## Description Part I Algorithms and Data Structures 1 Fundamentals Approximating the square root of a number Generating Permutation Efficiently Unique 5-bit Sequences Select Kth Smallest Element The Non-Crooks Problem Is this (almost) sorted? Sorting an almost sorted list The Longest Upsequence Problem Fixed size generic array in C++ Seating Problem Segment Problems Exponentiation Searching two-dimensional sorted array Hamming Problem Constant Time Range Query Linear Time Sorting Writing a Value as the Sum of Squares The Celebrity Problem Transport Problem Find Length of the rope Switch Bulb Problem In, On or Out The problem of the balanced seg The problem of the most isolated villages 2 Arrays The Plateau Problem Searching in Two Dimensional Sequence The Welfare Crook Problem 2D Array Rotation A Queuing Problem in A Post Office Interpolation Search Robot Walk Linear Time Sorting Write as sum of consecutive positive numbers Print 2D Array in Spiral Order The Problem of the Circular Racecourse Sparse Array Trick Bulterman’s Reshuffling Problem Finding the majority Mode of a Multiset Circular Array Find Median of two sorted arrays Finding the missing integer Finding the missing number with sorted columns Re-arranging an array Switch and Bulb Problem Compute sum of sub-array Find a number not sum of subsets of array Kth Smallest Element in Two Sorted Arrays Sort a sequence of sub-sequences Find missing integer Inplace Reversing Find the number not occurring twice in an array 3 Trees Lowest Common Ancestor(LCA) Problem Spying Campaign 4 Dynamic Programming Stage Coach Problem Matrix Multiplication TSP Problem A Simple Path Problem String Edit Distance Music recognition Max Sub-Array Problem 5 Graphs Reliable distribution Independent Set Party Problem 6 Miscellaneous Compute Next Higher Number Searching in Possibly Empty Two Dimensional Sequence Matching Nuts and Bolts Optimally Random-number generation Weighted Median Compute a^n Compute a^n revisited Compute the product a × b Compute the quotient and remainder Compute GCD Computed Constrained GCD Alternative Euclid’ Algorithm Revisit Constrained GCD Compute Square using only addition and subtraction Factorization Factorization Revisited Decimal Representation Reverse Decimal Representation Solve Inequality Solve Inequality Revisited Print Decimal Representation Decimal Period Length Sequence Periodicity Problem Compute Function Emulate Division and Modulus Operations Sorting Array of Strings : Linear Time LRU data structure Exchange Prefix and Suffix 7 Parallel Algorithms Parallel Addition Find Maximum Parallel Prefix Problem Finding Ranks in Linked Lists Finding the k th Smallest Element 8 Low Level Algorithms Manipulating Rightmost Bits Counting 1-Bits Counting the 1-bits in an Array Computing Parity of a word Counting Leading/Trailing 0’s Bit Reversal Bit Shuffling Integer Square Root Newton’s Method Integer Exponentiation LRU Algorithm Shortest String of 1-Bits Fibonacci words Computation of Power of 2 Round to a known power of 2 Round to Next Power of 2 Efficient Multiplication by Constants Bit-wise Rotation Gray Code Conversion Average of Integers without Overflow Least/Most Significant 1 Bit Next bit Permutation Modulus Division Part II C++ 8 General 9 Constant Expression 10 Type Specifier 11 Namespaces 12 Misc 13 Classes 14 Templates 15 Standard Library ## Features - Cracking Programming Interviews 500 Questions with Solutions ## Images ![Cracking Programming Interviews: 500 Questions with Solutions - Image 1](https://images-na.ssl-images-amazon.com/images/I/51sHG8AsgCL.jpg) --- ## Why Shop on Desertcart? - 🛒 **Trusted by 1.3+ Million Shoppers** — Serving international shoppers since 2016 - 🌍 **Shop Globally** — Access 737+ million products across 21 categories - 💰 **No Hidden Fees** — All customs, duties, and taxes included in the price - 🔄 **15-Day Free Returns** — Hassle-free returns (30 days for PRO members) - 🔒 **Secure Payments** — Trusted payment options with buyer protection - ⭐ **TrustPilot Rated 4.5/5** — Based on 8,000+ happy customer reviews **Shop now:** [https://www.desertcart.co.uk/products/14873303-cracking-programming-interviews-500-questions-with-solutions](https://www.desertcart.co.uk/products/14873303-cracking-programming-interviews-500-questions-with-solutions) --- *Product available on Desertcart United Kingdom* *Store origin: GB* *Last updated: 2026-05-16*