Daily coding problem / Alex Miller and Lawrence Wu.  (Text) (Text)

Miller, Alex (Computer software developer)
Wu, Lawrence
Call no.: QA76.6 .M52 2019Publication: [United States?] : [s.n], c2019Edition: 2nd edDescription: 299 p. : illISBN: 9781793296634; 1793296634Other title: Daily coding problem : get exceptionally good at coding interviews by solving one problem every day [Cover title]Subject(s): Computer programming -- Problems, exercises, etcComputer programming -- Vocational guidanceEmployment interviewingJob huntingLOC classification: QA76.6 | .M52 2019
Contents:I. Data Structures -- 1. Arrays -- 2. String -- 3. Linked Lists -- 4. Stacks and Queues --- 5. Hash Tables -- 6. Trees -- 7. Binary Search Trees -- 8. Tries -- 9. Heaps 10. Graphs -- 11. Advanced Data Structures -- II. Algorithms -- 12. Recursion -- 13. Dynamic Programming -- 14. Backtracking -- 15. Sorting and Searching -- 16. Pathfinding -- 17. Bit Manipulation -- 18. Randomized Algorithms -- 19. Advanced Algorithms -- III. Applications -- 20. Applications -- IV. Design -- 21. Data Structure Design -- 22. System Design.
Summary: Daily Coding Problem contains a wide variety of questions inspired by real programming interviews, with in-depth solutions that clearly take you through each core concept. You'll learn about: arrays, strings, linked lists, trees, hash tables, binary search trees, tries, heaps, stacks and queues, graphs, randomized algorithms, dynamic programming, backtracking, bit manipulation, pathfinding, recursion, data structure design, system design.
แท็ก: ไม่มีแท็กจากห้องสมุดสำหรับชื่อเรื่องนี้
ประเภททรัพยากร ตำแหน่งปัจจุบัน กลุ่มข้อมูล ตำแหน่งชั้นหนังสือ เลขเรียกหนังสือ สถานะ วันกำหนดส่ง บาร์โค้ด การจองรายการ
Book Book Puey Ungphakorn Library, Rangsit Campus
General Books General Stacks QA76.6 .M52 2019 (เรียกดูชั้นหนังสือ) Show map พร้อมให้บริการ
31379015822100
รายการจองทั้งหมด: 0

I. Data Structures -- 1. Arrays -- 2. String -- 3. Linked Lists -- 4. Stacks and Queues --- 5. Hash Tables -- 6. Trees -- 7. Binary Search Trees -- 8. Tries -- 9. Heaps 10. Graphs -- 11. Advanced Data Structures -- II. Algorithms -- 12. Recursion -- 13. Dynamic Programming -- 14. Backtracking -- 15. Sorting and Searching -- 16. Pathfinding -- 17. Bit Manipulation -- 18. Randomized Algorithms -- 19. Advanced Algorithms -- III. Applications -- 20. Applications -- IV. Design -- 21. Data Structure Design -- 22. System Design.

Daily Coding Problem contains a wide variety of questions inspired by real programming interviews, with in-depth solutions that clearly take you through each core concept. You'll learn about: arrays, strings, linked lists, trees, hash tables, binary search trees, tries, heaps, stacks and queues, graphs, randomized algorithms, dynamic programming, backtracking, bit manipulation, pathfinding, recursion, data structure design, system design.

There are no comments on this title.

เพื่อโพสต์ความคิดเห็น

คลิกที่รูปภาพเพื่อดูในตัวแสดงภาพ

ห้องสมุด:

Thammasat University Library, 2 Prachan Road, Phranakorn, Bangkok 10200

Puey Ungphakorn Library (Rangsit Campus), Circulation Desk 662 564-4444 ext. 1305

Pridi Banomyong Library, Circulation Desk 662 613-3544