Competitive programming in Python 128 algorithms to develop your coding skills
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 algor...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | , , |
| Format: | E-Book |
| Sprache: | English French |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2020
|
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9781108591928 | ||
| 003 | UkCbUP | ||
| 005 | 20201215131510.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 180725s2020||||enk o ||1 0|eng|d | ||
| 020 | |a 9781108591928 | ||
| 041 | 1 | |a eng |h fre | |
| 100 | 1 | |a Dürr, Christoph |d 1969- | |
| 240 | 1 | 0 | |a Programmation efficace. |l English |
| 245 | 1 | 0 | |a Competitive programming in Python |b 128 algorithms to develop your coding skills |c Christoph Dürr, Jill-Jênn Vie ; translated by Greg Gibbons, Danièle Gibbons |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2020 | |
| 300 | |a 1 Online-Ressource (x, 254 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 520 | |a 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. | ||
| 700 | 1 | |a Gibbons, Danièle | |
| 700 | 1 | |a Gibbons, Greg | |
| 700 | 1 | |a Vie, Jill-Jênn |d 1990- | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781108716826 |
| 856 | 4 | 0 | |l TUM01 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/9781108591928 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9781108591928 |
|---|---|
| _version_ | 1818779680031899648 |
| adam_text | |
| any_adam_object | |
| author | Dürr, Christoph 1969- |
| author2 | Gibbons, Danièle Gibbons, Greg Vie, Jill-Jênn 1990- |
| author2_role | |
| author2_variant | d g dg g g gg j j v jjv |
| author_facet | Dürr, Christoph 1969- Gibbons, Danièle Gibbons, Greg Vie, Jill-Jênn 1990- |
| author_role | |
| author_sort | Dürr, Christoph 1969- |
| author_variant | c d cd |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| doi_str_mv | 10.1017/9781108591928 |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02002nam a2200301 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9781108591928</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20201215131510.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">180725s2020||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108591928</subfield></datafield><datafield tag="041" ind1="1" ind2=" "><subfield code="a">eng</subfield><subfield code="h">fre</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dürr, Christoph</subfield><subfield code="d">1969-</subfield></datafield><datafield tag="240" ind1="1" ind2="0"><subfield code="a">Programmation efficace.</subfield><subfield code="l">English</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Competitive programming in Python</subfield><subfield code="b">128 algorithms to develop your coding skills</subfield><subfield code="c">Christoph Dürr, Jill-Jênn Vie ; translated by Greg Gibbons, Danièle Gibbons</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2020</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (x, 254 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gibbons, Danièle</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gibbons, Greg</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vie, Jill-Jênn</subfield><subfield code="d">1990-</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781108716826</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">TUM01</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/9781108591928</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9781108591928 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-18T12:04:28Z |
| institution | BVB |
| isbn | 9781108591928 |
| language | English French |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (x, 254 Seiten) |
| psigel | ZDB-20-CTM |
| publishDate | 2020 |
| publishDateSearch | 2020 |
| publishDateSort | 2020 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Dürr, Christoph 1969- Programmation efficace. English Competitive programming in Python 128 algorithms to develop your coding skills Christoph Dürr, Jill-Jênn Vie ; translated by Greg Gibbons, Danièle Gibbons Cambridge Cambridge University Press 2020 1 Online-Ressource (x, 254 Seiten) txt c cr 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. Gibbons, Danièle Gibbons, Greg Vie, Jill-Jênn 1990- Erscheint auch als Druck-Ausgabe 9781108716826 TUM01 ZDB-20-CTM TUM_PDA_CTM https://doi.org/10.1017/9781108591928 Volltext |
| spellingShingle | Dürr, Christoph 1969- Competitive programming in Python 128 algorithms to develop your coding skills |
| title | Competitive programming in Python 128 algorithms to develop your coding skills |
| title_alt | Programmation efficace. |
| title_auth | Competitive programming in Python 128 algorithms to develop your coding skills |
| title_exact_search | Competitive programming in Python 128 algorithms to develop your coding skills |
| title_full | Competitive programming in Python 128 algorithms to develop your coding skills Christoph Dürr, Jill-Jênn Vie ; translated by Greg Gibbons, Danièle Gibbons |
| title_fullStr | Competitive programming in Python 128 algorithms to develop your coding skills Christoph Dürr, Jill-Jênn Vie ; translated by Greg Gibbons, Danièle Gibbons |
| title_full_unstemmed | Competitive programming in Python 128 algorithms to develop your coding skills Christoph Dürr, Jill-Jênn Vie ; translated by Greg Gibbons, Danièle Gibbons |
| title_short | Competitive programming in Python |
| title_sort | competitive programming in python 128 algorithms to develop your coding skills |
| title_sub | 128 algorithms to develop your coding skills |
| url | https://doi.org/10.1017/9781108591928 |
| work_keys_str_mv | AT durrchristoph programmationefficace AT gibbonsdaniele programmationefficace AT gibbonsgreg programmationefficace AT viejilljenn programmationefficace AT durrchristoph competitiveprogramminginpython128algorithmstodevelopyourcodingskills AT gibbonsdaniele competitiveprogramminginpython128algorithmstodevelopyourcodingskills AT gibbonsgreg competitiveprogramminginpython128algorithmstodevelopyourcodingskills AT viejilljenn competitiveprogramminginpython128algorithmstodevelopyourcodingskills |