Linked Lists Java Edition by Brody Flannan (9 results)

- Softcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller5-star sellerCondition: New
US$ 59.00
US$ 3.00 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.

- Softcover
Seller: Home-set, Mannheim, GermanyHome-set
Contact seller5-star sellerCondition: New
US$ 91.90
US$ 54.88 shippingShips from Germany to U.S.A.Quantity: 2 available
Softcover/Taschenbuch. Condition: Neu. Stop memorizing pointer tricks. Start seeing why they work.Linked Lists - Java Edition teaches 56 linked-list algorithms through plain-language explanations, Java implementations, and step-by-step visual walkthroughs that trace the structure through every pointer update. Every algorithm is shown in full color, so nodes, pointers, and changing links stand apart at a glance and are easy to trace.Watch a list reverse one link at a time. Follow fast and slow pointers until they meet inside a cycle. See two sorted lists merge into one, and track the carry as two numbers are added digit by digit. Instead of holding every pointer in your head, follow the execution on the page.The visual walkthroughs use small multiples, a data visualization technique that presents successive stages of an algorithm as a series of consistently structured diagrams. By seeing meaningful stages together, you can compare states, follow what moves, and understand how each decision affects the next. This brings the algorithm to life, reinforcing understanding and helping the underlying patterns and mechanics stay with you longer.Every main algorithm is presented in three complementary parts:Understanding & Reasoning: Learn the goal, key idea, edge cases, and time and space complexity before studying the implementation.Inspect & Debug: Examine Java code alongside an AI-Era Interview Lens that challenges you to question assumptions, recognize plausible mistakes, and explain why a solution is correct.Trace & Walkthrough: Follow the input through intermediate states to the result, with visual explanations of the decisions that matter.Part One builds the foundations - traversal, insertion, cycle detection, merging, and linked-list arithmetic. Part Two modernizes them for the AI era, reframing the same patterns around the judgement calls, verification habits, and debugging instincts that today's interviews actually test.In the AI era, DSA interviews are shifting from pure recall to judgement, verification, debugging, and exploration.Every code sample was compiled, tested against edge cases beyond what's printed on the page, and independently reviewed before making it into the book.Designed for readers with basic Java knowledge who want to strengthen coding interview preparation, debugging, and algorithmic reasoning.Understand the idea. Follow the state. Explain the result. Sprache: Englisch Gewicht in Gramm: 438.…

- Softcover
- Print on Demand
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail
Contact seller5-star sellerCondition: New
US$ 56.63
Free ShippingShips within U.S.A.Quantity: 1 available
Paperback. Condition: new. Paperback. Stop memorizing pointer tricks. Start seeing why they work.Linked Lists - Java Edition teaches 56 linked-list algorithms through plain-language explanations, Java implementations, and step-by-step visual walkthroughs that trace the structure through every pointer update. Every algorithm is shown in full color, so nodes, pointers, and changing links stand apart at a glance and are easy to trace.Watch a list reverse one link at a time. Follow fast and slow pointers until they meet inside a cycle. See two sorted lists merge into one, and track the carry as two numbers are added digit by digit. Instead of holding every pointer in your head, follow the execution on the page.The visual walkthroughs use small multiples, a data visualization technique that presents successive stages of an algorithm as a series of consistently structured diagrams. By seeing meaningful stages together, you can compare states, follow what moves, and understand how each decision affects the next. This brings the algorithm to life, reinforcing understanding and helping the underlying patterns and mechanics stay with you longer.Every main algorithm is presented in three complementary parts: Understanding & Reasoning: Learn the goal, key idea, edge cases, and time and space complexity before studying the implementation.Inspect & Debug: Examine Java code alongside an AI-Era Interview Lens that challenges you to question assumptions, recognize plausible mistakes, and explain why a solution is correct.Trace & Walkthrough: Follow the input through intermediate states to the result, with visual explanations of the decisions that matter.Part One builds the foundations - traversal, insertion, cycle detection, merging, and linked-list arithmetic. Part Two modernizes them for the AI era, reframing the same patterns around the judgement calls, verification habits, and debugging instincts that today's interviews actually test.In the AI era, DSA interviews are shifting from pure recall to judgement, verification, debugging, and exploration.Every code sample was compiled, tested against edge cases beyond what's printed on the page, and independently reviewed before making it into the book.Designed for readers with basic Java knowledge who want to strengthen coding interview preparation, debugging, and algorithmic reasoning.Understand the idea. Follow the state. Explain the result. Linked Lists - Java Edition teaches 56 linked-list algorithms through plain-language explanations, Java implementations, and step-by-step visual walkthroughs that trace the structure through every. In full color. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

- Softcover
- Print on Demand
Seller: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contact seller5-star sellerCondition: New
US$ 56.64
Free ShippingShips within U.S.A.Quantity: Over 20 available
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

- Softcover
- Print on Demand
Seller: PBShop.store UK, Fairford, GLOS, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
US$ 53.94
US$ 5.49 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

- Softcover
- Print on Demand
Seller: CitiRetail, Stevenage, United KingdomCitiRetail
Contact seller5-star sellerCondition: New
US$ 59.74
US$ 48.79 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: new. Paperback. Stop memorizing pointer tricks. Start seeing why they work.Linked Lists - Java Edition teaches 56 linked-list algorithms through plain-language explanations, Java implementations, and step-by-step visual walkthroughs that trace the structure through every pointer update. Every algorithm is shown in full color, so nodes, pointers, and changing links stand apart at a glance and are easy to trace.Watch a list reverse one link at a time. Follow fast and slow pointers until they meet inside a cycle. See two sorted lists merge into one, and track the carry as two numbers are added digit by digit. Instead of holding every pointer in your head, follow the execution on the page.The visual walkthroughs use small multiples, a data visualization technique that presents successive stages of an algorithm as a series of consistently structured diagrams. By seeing meaningful stages together, you can compare states, follow what moves, and understand how each decision affects the next. This brings the algorithm to life, reinforcing understanding and helping the underlying patterns and mechanics stay with you longer.Every main algorithm is presented in three complementary parts: Understanding & Reasoning: Learn the goal, key idea, edge cases, and time and space complexity before studying the implementation.Inspect & Debug: Examine Java code alongside an AI-Era Interview Lens that challenges you to question assumptions, recognize plausible mistakes, and explain why a solution is correct.Trace & Walkthrough: Follow the input through intermediate states to the result, with visual explanations of the decisions that matter.Part One builds the foundations - traversal, insertion, cycle detection, merging, and linked-list arithmetic. Part Two modernizes them for the AI era, reframing the same patterns around the judgement calls, verification habits, and debugging instincts that today's interviews actually test.In the AI era, DSA interviews are shifting from pure recall to judgement, verification, debugging, and exploration.Every code sample was compiled, tested against edge cases beyond what's printed on the page, and independently reviewed before making it into the book.Designed for readers with basic Java knowledge who want to strengthen coding interview preparation, debugging, and algorithmic reasoning.Understand the idea. Follow the state. Explain the result. Linked Lists - Java Edition teaches 56 linked-list algorithms through plain-language explanations, Java implementations, and step-by-step visual walkthroughs that trace the structure through every. In full color. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…

- Softcover
- Print on Demand
Seller: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller
Contact seller5-star sellerCondition: New
US$ 81.58
US$ 37.00 shippingShips from Australia to U.S.A.Quantity: 1 available
Paperback. Condition: new. Paperback. Stop memorizing pointer tricks. Start seeing why they work.Linked Lists - Java Edition teaches 56 linked-list algorithms through plain-language explanations, Java implementations, and step-by-step visual walkthroughs that trace the structure through every pointer update. Every algorithm is shown in full color, so nodes, pointers, and changing links stand apart at a glance and are easy to trace.Watch a list reverse one link at a time. Follow fast and slow pointers until they meet inside a cycle. See two sorted lists merge into one, and track the carry as two numbers are added digit by digit. Instead of holding every pointer in your head, follow the execution on the page.The visual walkthroughs use small multiples, a data visualization technique that presents successive stages of an algorithm as a series of consistently structured diagrams. By seeing meaningful stages together, you can compare states, follow what moves, and understand how each decision affects the next. This brings the algorithm to life, reinforcing understanding and helping the underlying patterns and mechanics stay with you longer.Every main algorithm is presented in three complementary parts: Understanding & Reasoning: Learn the goal, key idea, edge cases, and time and space complexity before studying the implementation.Inspect & Debug: Examine Java code alongside an AI-Era Interview Lens that challenges you to question assumptions, recognize plausible mistakes, and explain why a solution is correct.Trace & Walkthrough: Follow the input through intermediate states to the result, with visual explanations of the decisions that matter.Part One builds the foundations - traversal, insertion, cycle detection, merging, and linked-list arithmetic. Part Two modernizes them for the AI era, reframing the same patterns around the judgement calls, verification habits, and debugging instincts that today's interviews actually test.In the AI era, DSA interviews are shifting from pure recall to judgement, verification, debugging, and exploration.Every code sample was compiled, tested against edge cases beyond what's printed on the page, and independently reviewed before making it into the book.Designed for readers with basic Java knowledge who want to strengthen coding interview preparation, debugging, and algorithmic reasoning.Understand the idea. Follow the state. Explain the result. Linked Lists - Java Edition teaches 56 linked-list algorithms through plain-language explanations, Java implementations, and step-by-step visual walkthroughs that trace the structure through every. In full color. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…

- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 87.09
US$ 38.50 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Stop memorizing pointer tricks. Start seeing why they work.Linked Lists - Java Edition teaches 56 linked-list algorithms through plain-language explanations, Java implementations, and step-by-step visual walkthroughs that trace the structure through every pointer update. Every algorithm is shown in full color, so nodes, pointers, and changing links stand apart at a glance and are easy to trace.Watch a list reverse one link at a time. Follow fast and slow pointers until they meet inside a cycle. See two sorted lists merge into one, and track the carry as two numbers are added digit by digit. Instead of holding every pointer in your head, follow the execution on the page.The visual walkthroughs use small multiples, a data visualization technique that presents successive stages of an algorithm as a series of consistently structured diagrams. By seeing meaningful stages together, you can compare states, follow what moves, and understand how each decision affects the next. This brings the algorithm to life, reinforcing understanding and helping the underlying patterns and mechanics stay with you longer.Every main algorithm is presented in three complementary parts:Understanding & Reasoning: Learn the goal, key idea, edge cases, and time and space complexity before studying the implementation.Inspect & Debug: Examine Java code alongside an AI-Era Interview Lens that challenges you to question assumptions, recognize plausible mistakes, and explain why a solution is correct.Trace & Walkthrough: Follow the input through intermediate states to the result, with visual explanations of the decisions that matter.Part One builds the foundations - traversal, insertion, cycle detection, merging, and linked-list arithmetic. Part Two modernizes them for the AI era, reframing the same patterns around the judgement calls, verification habits, and debugging instincts that today's interviews actually test.In the AI era, DSA interviews are shifting from pure recall to judgement, verification, debugging, and exploration.Every code sample was compiled, tested against edge cases beyond what's printed on the page, and independently reviewed before making it into the book.Designed for readers with basic Java knowledge who want to strengthen coding interview preparation, debugging, and algorithmic reasoning.Understand the idea. Follow the state. Explain the result.…

- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 82.75
US$ 76.99 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Linked Lists - Java Edition | Data Structures & Algorithms for AI-Era Interviews | Flannan P. Brody | Taschenbuch | Learn Algorithms Visually - Java Edition | Englisch | 2026 | Learn Algorithms Visually | EAN 9798182892551 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand. …