Compartir
Cracking Programming Interviews: 500 Questions with Solutions (en Inglés)
Sergei Nakariakov
(Autor)
·
Createspace
· Tapa Blanda
Cracking Programming Interviews: 500 Questions with Solutions (en Inglés) - Nakariakov, Sergei
Libro Nuevo
Importado
Envío: 10 a 12 días háb.
₡ 17.933
Costos de importación y 13% IVA incluídos en el precio ✅
Reseña del libro "Cracking Programming Interviews: 500 Questions with Solutions (en Inglés)"
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
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
Todos los libros de nuestro catálogo son Originales.
El libro está escrito en Inglés.
La encuadernación de esta edición es Tapa Blanda.
✓ Producto agregado correctamente al carro, Ir a Pagar.
