Search results for "Frequently Asked Coding Interview - Algorithms"
Items we need to order for you






R 1,562.00

R 474.20

R 1,367.00

R 611.00



R 1,644.13

Fabulous Adventures in Data Structures and Algorithms
Get a free eBook (PDF or ePub) from Manning as well as access to the online liveBook format (and its AI assistant that will answer your questions in any language) when you purchase the print book. There's a lot more to algorithms than the useful-but-boring recipes you recite for every interview. This unique book introduces a collection of amazing algorithms that have the potential to change the way you program. In this book, language designer and C# legend Eric Lippert explores exciting, esoteric, and exotic data structures and algorithms that will expand your programming toolbox and your horizons. You'll upend the way you think about lists, learn the algorithms behind powerful developer tools, and rethink how to handle stochastic quantities in modern programming languages. Fabulous Adventures in Data Structures and Algorithms shows you how to: Build efficient, double-ended queues from immutable partsAuto-format structured text so it always looks sharpGenerate and manipulate random numbers from custom distributions using the same tools you use for sequencesHarness immutability to squeeze data smaller while speeding up repeated computationsUncover the mathematical structures underlying lists, nullables, functions, tasks, and probabilitiesAbout the book Fabulous Adventures in Data Structures and Algorithms teaches you how to solve programming challenges with lesser-known algorithmic approaches. You'll begin by examining immutable data structures--stacks, queues, deques, and unusual constructions like Hughes lists--that take on conventional assumptions about performance. Next, you'll investigate algorithms drawn from building developer tools, from backtracking search in graph coloring to unification and anti-unification. Finally, you'll venture into randomness, developing data structures and algorithms for discrete and continuous distributions, sequence operations on probability distributions, and Bayesian reasoning. About the reader For working programmers who know C#, Java, Python, or similar object-oriented language. Examples in C#. About the author Eric Lippert designed programming languages, compilers, and other developer tools for Microsoft, Coverity, and Facebook. He's been on the design and/or implementation and/or specification teams for Visual Basic, JavaScript, VBScript, C#, Hack, and Bean Machine. Eric's popular blog about language design, data structures and algorithms, and other "fabulous adventures in coding," which you can read at ericlippert.com, has enjoyed a twenty-year run.
R 2,249.00

R 1,676.77

Algorithms Illuminated
In Algorithms Illuminated, Tim Roughgarden teaches the basics of algorithms in the most accessible way imaginable. This Omnibus Edition contains the complete text of Parts 1-4, with thorough coverage of asymptotic analysis, graph search and shortest paths, data structures, divide-and-conquer algorithms, greedy algorithms, dynamic programming, and NP-hard problems. Hundreds of worked examples, quizzes, and exercises, plus comprehensive online videos, help readers become better programmers; sharpen their analytical skills; learn to think algorithmically; acquire literacy with computer science's greatest hits; and ace their technical interviews.
R 2,437.00

R 1,652.93



R 684.00









R 456.00

R 916.00


R 764.00

R 672.00

Data Structures And Algorithms In Javascript
For Javascript developers, this book is a one-stop-shop for learning the algorithms and data structures that solve and optimize complex problems. Covering everything from functional programming and abstract data types, to sorting and searching, lists, bags, binary trees, forests, heaps, and graphs - the author uses examples taken from coding challenges and interview questions, enabling readers to explore the real-world advantages of specific algorithms and data structures. Written and illustrated to be a developer's go-to reference manual as well as for immediate on-the-job applications, performance - both from a theoretical point of view and a practical standpoint - is considered alongside every algorithm or data structure introduced. In addition to demonstrating best practices throughout the text, each chapter ends with a series of questions that amplify the preceding concepts and provide further examples for the reader to apply. Also of note, the book utilizes the latest version of
R 1,368.00

R 503.59

R 367.00

R 1,625.30


R 1,627.00

Problems on Algorithms
With approximately 2500 problems, this book provides a collection of practical problems on the basic and advanced data structures, design, and analysis of algorithms. To make this book suitable for self-instruction, about one-third of the algorithms are supported by solutions, and some others are supported by hints and comments. This book is intended for students wishing to deepen their knowledge of algorithm design in an undergraduate or beginning graduate class on algorithms, for those teaching courses in this area, for use by practicing programmers who wish to hone and expand their skills, and as a self-study text for graduate students who are preparing for the qualifying examination on algorithms for a Ph.D. program in Computer Science or Computer Engineering. About all, it is a good source for exam problems for those who teach algorithms and data structure. The format of each chapter is just a little bit of instruction followed by lots of problems. This book is intended to augment the problem sets found in any standard algorithms textbook. This book • begins with four chapters on background material that most algorithms instructors would like their students to have mastered before setting foot in an algorithms class. The introductory chapters include mathematical induction, complexity notations, recurrence relations, and basic algorithm analysis methods. • provides many problems on basic and advanced data structures including basic data structures (arrays, stack, queue, and linked list), hash, tree, search, and sorting algorithms. • provides many problems on algorithm design techniques: divide and conquer, dynamic programming, greedy algorithms, graph algorithms, and backtracking algorithms. • is rounded out with a chapter on NP-completeness.
R 3,923.43

R 472.46


R 457.00

R 610.00


Head First Algorithms and Data Structures
What will you learn from this book?Successful software engineers all have this in common: They're fluent in the language of algorithms and data structures. Head First Algorithms and Data Structures is your gateway to becoming a part of this dynamic world. Guided by the expert insights of Eric Freeman and Elisabeth Robson, you'll unravel the complexities of algorithms and data structures through games, puzzles, and other entertaining challenges that will have you coding efficiently, scaling effectively, and acing your technical interviews in no time.What's so special about this book?If you've read a Head First book, you know what to expect: a visually rich format designed for the way your brain works. If you haven't, you're in for a treat. Whether you're taking your first steps in programming or seeking to hone your skills, you'll solidify your algorithmic thinking through a multisensory experience that engages your mind—not a text-heavy approach that puts you to sleep.
R 2,009.00


R 1,526.00

















































