Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Supporting your high street Find out how »
Competitive Programming in Python : 128 Algorithms to Develop your Coding Skills, EPUB eBook

Competitive Programming in Python : 128 Algorithms to Develop your Coding Skills EPUB

EPUB

Download - Immediately Available
Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

Want to kill it at your job interview in the tech industry?

Want to win that coding competition? Learn all the algorithmic techniques and programming skills you need from two experienced coaches, problem setters, and jurors for coding competitions.

The authors highlight the versatility of each algorithm by considering a variety of problems and show how to implement algorithms in simple and efficient code.

Readers can expect to master 128 algorithms in Python and discover the right way to tackle a problem and quickly implement a solution of low complexity.

Classic problems like Dijkstra's shortest path algorithm and Knuth-Morris-Pratt's string matching algorithm are featured alongside lesser known data structures like Fenwick trees and Knuth's dancing links.

The book provides a framework to tackle algorithmic problem solving, including: Definition, Complexity, Applications, Algorithm, Key Information, Implementation, Variants, In Practice, and Problems.

Python code included in the book and on the companion website.

Information

Other Formats

Save 15%

£33.99

£28.89

Download - Immediately Available
Add to Basket
Sign in to add to wishlist
 
Delivered to your inbox

to transfer to your device

eBook Help

Is this the right eBook for
my device? How do I download
this eBook? See help and FAQs pages

Information