Cracking Programming Interviews: 500 Questions with Solutions

3 durchschnittliche Bewertung
( 1 Bewertungen bei Goodreads )
 
9781495459801: Cracking Programming Interviews: 500 Questions with Solutions
Alle Exemplare der Ausgabe mit dieser ISBN anzeigen:
 
 
Reseña del editor:

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

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Versand: Gratis
Von Vereinigtes Königreich nach USA

Versandziele, Kosten & Dauer

In den Warenkorb

Beste Suchergebnisse bei AbeBooks

Beispielbild für diese ISBN

1.

Sergei Nakariakov
Verlag: Createspace Independent Publishing Platform, United States (2014)
ISBN 10: 1495459802 ISBN 13: 9781495459801
Neu Paperback Anzahl: 10
Anbieter
The Book Depository
(London, Vereinigtes Königreich)
Bewertung

Buchbeschreibung Createspace Independent Publishing Platform, United States, 2014. Paperback. Zustand: New. Language: English. Brand new Book. Part I Algorithms and Data Structures 1 Fundamentals Approximating the square root of a numberGenerating Permutation EfficientlyUnique 5-bit SequencesSelect Kth Smallest ElementThe Non-Crooks ProblemIs this (almost) sorted?Sorting an almost sorted listThe Longest Upsequence ProblemFixed size generic array in C++Seating ProblemSegment ProblemsExponentiationSearching two-dimensional sorted arrayHamming ProblemConstant Time Range QueryLinear Time SortingWriting a Value as the Sum of SquaresThe Celebrity ProblemTransport ProblemFind Length of the ropeSwitch Bulb ProblemIn, On or OutThe problem of the balanced segThe problem of the most isolated villages 2 Arrays The Plateau ProblemSearching in Two Dimensional SequenceThe Welfare Crook Problem2D Array RotationA Queuing Problem in A Post OfficeInterpolation SearchRobot WalkLinear Time SortingWrite as sum of consecutive positive numbersPrint 2D Array in Spiral OrderThe Problem of the Circular RacecourseSparse Array TrickBulterman's Reshuffling ProblemFinding the majorityMode of a MultisetCircular ArrayFind Median of two sorted arraysFinding the missing integerFinding the missing number with sorted columnsRe-arranging an array Switch and Bulb ProblemCompute sum of sub-arrayFind a number not sum of subsets of arrayKth Smallest Element in Two Sorted ArraysSort a sequence of sub-sequencesFind missing integerInplace ReversingFind the number not occurring twice in an array 3 Trees Lowest Common Ancestor(LCA) ProblemSpying Campaign 4 Dynamic Programming Stage Coach ProblemMatrix MultiplicationTSP ProblemA Simple Path ProblemString Edit DistanceMusic recognitionMax Sub-Array Problem 5 Graphs Reliable distributionIndependent SetParty Problem 6 Miscellaneous Compute Next Higher NumberSearching in Possibly Empty Two Dimensional SequenceMatching Nuts and Bolts OptimallyRandom-number generationWeighted MedianCompute a^nCompute a^n revisitedCompute the product a × bCompute the quotient and remainderCompute GCDComputed Constrained GCDAlternative Euclid' AlgorithmRevisit Constrained GCDCompute Square using only addition and subtractionFactorizationFactorization RevisitedDecimal RepresentationReverse Decimal RepresentationSolve InequalitySolve Inequality RevisitedPrint Decimal RepresentationDecimal Period LengthSequence Periodicity ProblemCompute FunctionEmulate Division and Modulus OperationsSorting Array of Strings: Linear TimeLRU data structureExchange Prefix and Suffix 7 Parallel Algorithms Parallel AdditionFind MaximumParallel Prefix ProblemFinding Ranks in Linked ListsFinding the k th Smallest Element 8 Low Level Algorithms Manipulating Rightmost BitsCounting 1-BitsCounting the 1-bits in an ArrayComputing Parity of a wordCounting Leading/Trailing 0'sBit ReversalBit ShufflingInteger Square RootNewton's MethodInteger ExponentiationLRU AlgorithmShortest String of 1-BitsFibonacci wordsComputation of Power of 2Round to a known power of 2Round to Next Power of 2Efficient Multiplication by ConstantsBit-wise RotationGray Code ConversionAverage of Integers without Overflow Least/Most Significant 1 BitNext bit PermutationModulus Division Part II C++ 8 General9 Constant Expression10 Type Specifier11 Namespaces12 Misc13 Classes14 Templates15 Standard Library. Bestandsnummer des Verkäufers APC9781495459801

Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren

Neu kaufen
EUR 32,21
Währung umrechnen

In den Warenkorb

Versand: Gratis
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer
Beispielbild für diese ISBN

2.

Nakariakov, Sergei
Verlag: Createspace (2014)
ISBN 10: 1495459802 ISBN 13: 9781495459801
Neu Anzahl: > 20
Print-on-Demand
Anbieter
Paperbackshop-US
(Wood Dale, IL, USA)
Bewertung

Buchbeschreibung Createspace, 2014. PAP. Zustand: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bestandsnummer des Verkäufers IQ-9781495459801

Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren

Neu kaufen
EUR 32,88
Währung umrechnen

In den Warenkorb

Versand: Gratis
Innerhalb USA
Versandziele, Kosten & Dauer
Beispielbild für diese ISBN

3.

Nakariakov, Sergei
Verlag: Createspace (2014)
ISBN 10: 1495459802 ISBN 13: 9781495459801
Neu Anzahl: 15
Print-on-Demand
Anbieter
Books2Anywhere
(Fairford, GLOS, Vereinigtes Königreich)
Bewertung

Buchbeschreibung Createspace, 2014. PAP. Zustand: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bestandsnummer des Verkäufers IQ-9781495459801

Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren

Neu kaufen
EUR 25,44
Währung umrechnen

In den Warenkorb

Versand: EUR 27,49
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer