[{"data":1,"prerenderedAt":2663},["ShallowReactive",2],{"item-lessons-light-ch06-strings":3,"item-examples-light-ch06-strings":444,"item-exercises-light-ch06-strings":753,"item-lesson-full-ch06-strings-6.2":1070,"item-example-full-ch06-strings-6.2":1435,"item-exercise-full-ch06-strings-6.2":1833},[4,8,12,16,20,24,28,32,36,40,44,48,52,56,60,64,68,72,76,80,84,88,92,96,100,104,108,112,116,120,124,128,132,136,140,144,148,152,156,160,164,168,172,176,180,184,188,192,196,200,204,208,212,216,220,224,228,232,236,240,244,248,252,256,260,264,268,272,276,280,284,288,292,296,300,304,308,312,316,320,324,328,332,336,340,344,348,352,356,360,364,368,372,376,380,384,388,392,396,400,404,408,412,416,420,424,428,432,436,440],{"path":5,"title":6,"stem":7},"\u002Fshockwave-curriculum\u002Flessons\u002Fch01-why-java-for-frc\u002F1-why-java-for-frc","Why Java for FRC?","shockwave-curriculum\u002Flessons\u002Fch01-why-java-for-frc\u002F1.1-why-java-for-frc",{"path":9,"title":10,"stem":11},"\u002Fshockwave-curriculum\u002Flessons\u002Fch01-why-java-for-frc\u002F2-intro-to-algorithms-programming-and-compilers","Intro to Algorithms, Programming and Compilers","shockwave-curriculum\u002Flessons\u002Fch01-why-java-for-frc\u002F1.2-intro-to-algorithms-programming-and-compilers",{"path":13,"title":14,"stem":15},"\u002Fshockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F1-variables-and-data-types","Variables & Data Types","shockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F2.1-variables-and-data-types",{"path":17,"title":18,"stem":19},"\u002Fshockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F2-expressions-and-output","Expressions & Output","shockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F2.2-expressions-and-output",{"path":21,"title":22,"stem":23},"\u002Fshockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F3-assignment-and-input","Assignment & Input","shockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F2.3-assignment-and-input",{"path":25,"title":26,"stem":27},"\u002Fshockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F4-casting-and-ranges-of-values","Casting & Ranges of Values","shockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F2.4-casting-and-ranges-of-values",{"path":29,"title":30,"stem":31},"\u002Fshockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F5-compound-assignment-operators","Compound Assignment Operators","shockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F2.5-compound-assignment-operators",{"path":33,"title":34,"stem":35},"\u002Fshockwave-curriculum\u002Flessons\u002Fch03-apis-libraries-and-documentation\u002F1-apis-and-libraries","APIs and Libraries","shockwave-curriculum\u002Flessons\u002Fch03-apis-libraries-and-documentation\u002F3.1-apis-and-libraries",{"path":37,"title":38,"stem":39},"\u002Fshockwave-curriculum\u002Flessons\u002Fch03-apis-libraries-and-documentation\u002F2-documentation-with-comments-and-preconditions","Documentation with Comments and Preconditions","shockwave-curriculum\u002Flessons\u002Fch03-apis-libraries-and-documentation\u002F3.2-documentation-with-comments-and-preconditions",{"path":41,"title":42,"stem":43},"\u002Fshockwave-curriculum\u002Flessons\u002Fch03-apis-libraries-and-documentation\u002F3-packages-and-imports","Packages & Imports","shockwave-curriculum\u002Flessons\u002Fch03-apis-libraries-and-documentation\u002F3.3-packages-and-imports",{"path":45,"title":46,"stem":47},"\u002Fshockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F1-methods-signatures-and-parameters","Methods, Signatures & Parameters","shockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4.1-methods-signatures-and-parameters",{"path":49,"title":50,"stem":51},"\u002Fshockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F2-calling-class-methods","Calling Class Methods","shockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4.2-calling-class-methods",{"path":53,"title":54,"stem":55},"\u002Fshockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F3-using-the-math-class","Using the Math Class","shockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4.3-using-the-math-class",{"path":57,"title":58,"stem":59},"\u002Fshockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4-objects-instances-of-classes","Objects — Instances of Classes","shockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4.4-objects-instances-of-classes",{"path":61,"title":62,"stem":63},"\u002Fshockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F5-creating-and-initializing-objects-constructors","Creating & Initializing Objects: Constructors","shockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4.5-creating-and-initializing-objects-constructors",{"path":65,"title":66,"stem":67},"\u002Fshockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F6-calling-instance-methods","Calling Instance Methods","shockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4.6-calling-instance-methods",{"path":69,"title":70,"stem":71},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F1-5.2-if-statements-and-for-loops","Control Structures: if Statements & For Loops","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.1-5.2-if-statements-and-for-loops",{"path":73,"title":74,"stem":75},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F10-nested-iteration","Nested Iteration","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.10-nested-iteration",{"path":77,"title":78,"stem":79},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F11-informal-runtime-analysis-of-loops","Informal Runtime Analysis of Loops","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.11-informal-runtime-analysis-of-loops",{"path":81,"title":82,"stem":83},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F12-switch-statements-and-expressions","switch Statements and Expressions","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.12-switch-statements-and-expressions",{"path":85,"title":86,"stem":87},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F3-algorithms-with-selection-and-repetition","Algorithms with Selection and Repetition","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.3-algorithms-with-selection-and-repetition",{"path":89,"title":90,"stem":91},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F4-boolean-expressions","Boolean Expressions","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.4-boolean-expressions",{"path":93,"title":94,"stem":95},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5-nested-if-statements","Nested if Statements","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.5-nested-if-statements",{"path":97,"title":98,"stem":99},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F6-compound-boolean-expressions","Compound Boolean Expressions","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.6-compound-boolean-expressions",{"path":101,"title":102,"stem":103},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F7-comparing-boolean-expressions-de-morgans-laws","Comparing Boolean Expressions (De Morgan's Laws)","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.7-comparing-boolean-expressions-de-morgans-laws",{"path":105,"title":106,"stem":107},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F8-while-loops","While Loops","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.8-while-loops",{"path":109,"title":110,"stem":111},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F9-implementing-selection-and-iteration-algorithms","Implementing Selection and Iteration Algorithms","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.9-implementing-selection-and-iteration-algorithms",{"path":113,"title":114,"stem":115},"\u002Fshockwave-curriculum\u002Flessons\u002Fch06-strings\u002F1-strings","Strings","shockwave-curriculum\u002Flessons\u002Fch06-strings\u002F6.1-strings",{"path":117,"title":118,"stem":119},"\u002Fshockwave-curriculum\u002Flessons\u002Fch06-strings\u002F2-string-algorithms","String Algorithms","shockwave-curriculum\u002Flessons\u002Fch06-strings\u002F6.2-string-algorithms",{"path":121,"title":122,"stem":123},"\u002Fshockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F1-anatomy-of-a-java-class","The Class Blueprint","shockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F7.1-anatomy-of-a-java-class",{"path":125,"title":126,"stem":127},"\u002Fshockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F2-methods-how-to-write-them","Methods: How to Write Them","shockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F7.2-methods-how-to-write-them",{"path":129,"title":130,"stem":131},"\u002Fshockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F3-methods-passing-and-returning-references-of-an-object","Methods: Passing & Returning References of an Object","shockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F7.3-methods-passing-and-returning-references-of-an-object",{"path":133,"title":134,"stem":135},"\u002Fshockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F4-class-static-variables-and-methods","Class (static) Variables & Methods","shockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F7.4-class-static-variables-and-methods",{"path":137,"title":138,"stem":139},"\u002Fshockwave-curriculum\u002Flessons\u002Fch08-constructors-and-this\u002F1-8.2-constructors-and-this","Constructors & \"this\"","shockwave-curriculum\u002Flessons\u002Fch08-constructors-and-this\u002F8.1-8.2-constructors-and-this",{"path":141,"title":142,"stem":143},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F1-array-creation-and-access","Array Creation and Access","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.1-array-creation-and-access",{"path":145,"title":146,"stem":147},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F2-arraylist-and-its-methods","ArrayList and its Methods","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.2-arraylist-and-its-methods",{"path":149,"title":150,"stem":151},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F3-optional-hashmap-dictionary-data-structure","HashMap (Dictionary) Data Structure","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.3-optional-hashmap-dictionary-data-structure",{"path":153,"title":154,"stem":155},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F4-array-traversals","Array Traversals","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.4-array-traversals",{"path":157,"title":158,"stem":159},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F5-implementing-array-algorithms","Implementing Array Algorithms","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.5-implementing-array-algorithms",{"path":161,"title":162,"stem":163},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F6-arraylist-traversals","ArrayList Traversals","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.6-arraylist-traversals",{"path":165,"title":166,"stem":167},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F7-implementing-arraylist-algorithms","Implementing ArrayList Algorithms","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.7-implementing-arraylist-algorithms",{"path":169,"title":170,"stem":171},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F8-using-text-files","Using Text Files","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.8-using-text-files",{"path":173,"title":174,"stem":175},"\u002Fshockwave-curriculum\u002Flessons\u002Fch10-2d-arrays\u002F1-2d-array-creation-and-access","2D Array Creation and Access","shockwave-curriculum\u002Flessons\u002Fch10-2d-arrays\u002F10.1-2d-array-creation-and-access",{"path":177,"title":178,"stem":179},"\u002Fshockwave-curriculum\u002Flessons\u002Fch10-2d-arrays\u002F2-2d-array-traversals-nested-loops","2D Array Traversals: Nested Loops","shockwave-curriculum\u002Flessons\u002Fch10-2d-arrays\u002F10.2-2d-array-traversals-nested-loops",{"path":181,"title":182,"stem":183},"\u002Fshockwave-curriculum\u002Flessons\u002Fch10-2d-arrays\u002F3-implementing-2d-array-algorithms","Implementing 2D Array Algorithms","shockwave-curriculum\u002Flessons\u002Fch10-2d-arrays\u002F10.3-implementing-2d-array-algorithms",{"path":185,"title":186,"stem":187},"\u002Fshockwave-curriculum\u002Flessons\u002Fch11-enums-named-choices\u002F11-enums-named-choices","Enums: Named Choices","shockwave-curriculum\u002Flessons\u002Fch11-enums-named-choices\u002F11-enums-named-choices",{"path":189,"title":190,"stem":191},"\u002Fshockwave-curriculum\u002Flessons\u002Fch12-exceptions-and-try-catch\u002F12-exceptions-and-try-catch","Exceptions & try\u002Fcatch","shockwave-curriculum\u002Flessons\u002Fch12-exceptions-and-try-catch\u002F12-exceptions-and-try-catch",{"path":193,"title":194,"stem":195},"\u002Fshockwave-curriculum\u002Flessons\u002Fch13-common-gotchas\u002F13-common-gotchas","Common Gotchas","shockwave-curriculum\u002Flessons\u002Fch13-common-gotchas\u002F13-common-gotchas",{"path":197,"title":198,"stem":199},"\u002Fshockwave-curriculum\u002Flessons\u002Fch14-why-design-patterns\u002F14-why-design-patterns","Why Design Patterns?","shockwave-curriculum\u002Flessons\u002Fch14-why-design-patterns\u002F14-why-design-patterns",{"path":201,"title":202,"stem":203},"\u002Fshockwave-curriculum\u002Flessons\u002Fch15-advanced-collections\u002F15-advanced-collections","Advanced Collections (Set\u002FQueue\u002FMap)","shockwave-curriculum\u002Flessons\u002Fch15-advanced-collections\u002F15-advanced-collections",{"path":205,"title":206,"stem":207},"\u002Fshockwave-curriculum\u002Flessons\u002Fch16-writing-your-own-generics\u002F16-writing-your-own-generics","Writing Your Own Generics","shockwave-curriculum\u002Flessons\u002Fch16-writing-your-own-generics\u002F16-writing-your-own-generics",{"path":209,"title":210,"stem":211},"\u002Fshockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F1-inheritance-superclass-subclass","Inheritance, Superclass, Subclass","shockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F17.1-inheritance-superclass-subclass",{"path":213,"title":214,"stem":215},"\u002Fshockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F2-inheritance-and-constructors","Inheritance and Constructors","shockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F17.2-inheritance-and-constructors",{"path":217,"title":218,"stem":219},"\u002Fshockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F3-inheritance-hierarchies","Inheritance Hierarchies","shockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F17.3-inheritance-hierarchies",{"path":221,"title":222,"stem":223},"\u002Fshockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F4-object-superclass","Object Superclass","shockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F17.4-object-superclass",{"path":225,"title":226,"stem":227},"\u002Fshockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F5-abstract-classes-and-methods","Abstract Classes and Methods","shockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F17.5-abstract-classes-and-methods",{"path":229,"title":230,"stem":231},"\u002Fshockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F1-overriding-methods","Overriding Methods","shockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F18.1-overriding-methods",{"path":233,"title":234,"stem":235},"\u002Fshockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F2-super-keyword","super Keyword","shockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F18.2-super-keyword",{"path":237,"title":238,"stem":239},"\u002Fshockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F3-polymorphism","Polymorphism","shockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F18.3-polymorphism",{"path":241,"title":242,"stem":243},"\u002Fshockwave-curriculum\u002Flessons\u002Fch19-interfaces-as-contracts\u002F19-interfaces-as-contracts","Interfaces as Contracts","shockwave-curriculum\u002Flessons\u002Fch19-interfaces-as-contracts\u002F19-interfaces-as-contracts",{"path":245,"title":246,"stem":247},"\u002Fshockwave-curriculum\u002Flessons\u002Fch19-interfaces-as-contracts\u002F1-lambdas-and-method-references","Lambdas & Method References","shockwave-curriculum\u002Flessons\u002Fch19-interfaces-as-contracts\u002F19.1-lambdas-and-method-references",{"path":249,"title":250,"stem":251},"\u002Fshockwave-curriculum\u002Flessons\u002Fch20-the-io-layer-pattern\u002F20-the-io-layer-pattern","The IO-Layer Pattern","shockwave-curriculum\u002Flessons\u002Fch20-the-io-layer-pattern\u002F20-the-io-layer-pattern",{"path":253,"title":254,"stem":255},"\u002Fshockwave-curriculum\u002Flessons\u002Fch21-static-factories\u002F21-static-factories","Static Factories","shockwave-curriculum\u002Flessons\u002Fch21-static-factories\u002F21-static-factories",{"path":257,"title":258,"stem":259},"\u002Fshockwave-curriculum\u002Flessons\u002Fch22-the-builder-pattern\u002F22-the-builder-pattern","The Builder Pattern","shockwave-curriculum\u002Flessons\u002Fch22-the-builder-pattern\u002F22-the-builder-pattern",{"path":261,"title":262,"stem":263},"\u002Fshockwave-curriculum\u002Flessons\u002Fch23-encapsulation-and-final\u002F1-scope-and-access","Access, final, and Immutability","shockwave-curriculum\u002Flessons\u002Fch23-encapsulation-and-final\u002F23.1-scope-and-access",{"path":265,"title":266,"stem":267},"\u002Fshockwave-curriculum\u002Flessons\u002Fch24-optional-avoiding-null-pointer-exceptions\u002F24-optional-avoiding-null-pointer-exceptions","Optional: Avoiding Null Pointer Exceptions","shockwave-curriculum\u002Flessons\u002Fch24-optional-avoiding-null-pointer-exceptions\u002F24-optional-avoiding-null-pointer-exceptions",{"path":269,"title":270,"stem":271},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F1-what-is-command-based-programming","What Is Command-Based Programming?","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.1-what-is-command-based-programming",{"path":273,"title":274,"stem":275},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F2-commands-and-command-compositions","Commands & Command Compositions","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.2-commands-and-command-compositions",{"path":277,"title":278,"stem":279},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F3-the-command-scheduler","The Command Scheduler","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.3-the-command-scheduler",{"path":281,"title":282,"stem":283},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F4-state-machines-logic","State Machines: Logic","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.4-state-machines-logic",{"path":285,"title":286,"stem":287},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F5-managing-transitions","Managing Transitions","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.5-managing-transitions",{"path":289,"title":290,"stem":291},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F6-binding-commands-to-triggers","Binding Commands to Triggers","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.6-binding-commands-to-triggers",{"path":293,"title":294,"stem":295},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F7-structuring-a-command-based-robot-project","Structuring a Command-Based Robot Project","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.7-structuring-a-command-based-robot-project",{"path":297,"title":298,"stem":299},"\u002Fshockwave-curriculum\u002Flessons\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways","Architecture Takeaways","shockwave-curriculum\u002Flessons\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways",{"path":301,"title":302,"stem":303},"\u002Fshockwave-curriculum\u002Flessons\u002Fch27-program-design-and-abstraction\u002F1-abstraction-and-program-design","Abstraction and Program Design","shockwave-curriculum\u002Flessons\u002Fch27-program-design-and-abstraction\u002F27.1-abstraction-and-program-design",{"path":305,"title":306,"stem":307},"\u002Fshockwave-curriculum\u002Flessons\u002Fch27-program-design-and-abstraction\u002F2-impact-of-program-design","Impact of Program Design","shockwave-curriculum\u002Flessons\u002Fch27-program-design-and-abstraction\u002F27.2-impact-of-program-design",{"path":309,"title":310,"stem":311},"\u002Fshockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F1-searching-algorithms","Searching Algorithms","shockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F28.1-searching-algorithms",{"path":313,"title":314,"stem":315},"\u002Fshockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F2-sorting-algorithms","Sorting Algorithms","shockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F28.2-sorting-algorithms",{"path":317,"title":318,"stem":319},"\u002Fshockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F3-recursion","Recursion","shockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F28.3-recursion",{"path":321,"title":322,"stem":323},"\u002Fshockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F4-recursive-searching-and-sorting","Recursive Searching and Sorting","shockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F28.4-recursive-searching-and-sorting",{"path":325,"title":326,"stem":327},"\u002Fshockwave-curriculum\u002Flessons\u002Fch29-git-and-github-basics\u002F1-coming-soon","Git & GitHub Basics — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch29-git-and-github-basics\u002F29.1-coming-soon",{"path":329,"title":330,"stem":331},"\u002Fshockwave-curriculum\u002Flessons\u002Fch30-git-history-and-merging\u002F1-coming-soon","Git — History & Merging — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch30-git-history-and-merging\u002F30.1-coming-soon",{"path":333,"title":334,"stem":335},"\u002Fshockwave-curriculum\u002Flessons\u002Fch31-dev-environment-and-tooling\u002F1-coming-soon","Dev Environment & Tooling — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch31-dev-environment-and-tooling\u002F31.1-coming-soon",{"path":337,"title":338,"stem":339},"\u002Fshockwave-curriculum\u002Flessons\u002Fch32-unit-testing\u002F1-coming-soon","Unit Testing — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch32-unit-testing\u002F32.1-coming-soon",{"path":341,"title":342,"stem":343},"\u002Fshockwave-curriculum\u002Flessons\u002Fch33-advantagekit-autologging\u002F1-coming-soon","AdvantageKit — AutoLogging — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch33-advantagekit-autologging\u002F33.1-coming-soon",{"path":345,"title":346,"stem":347},"\u002Fshockwave-curriculum\u002Flessons\u002Fch34-log-replay\u002F1-coming-soon","Log Replay — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch34-log-replay\u002F34.1-coming-soon",{"path":349,"title":350,"stem":351},"\u002Fshockwave-curriculum\u002Flessons\u002Fch35-advantagescope-i-visualization\u002F1-coming-soon","AdvantageScope I: Visualization — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch35-advantagescope-i-visualization\u002F35.1-coming-soon",{"path":353,"title":354,"stem":355},"\u002Fshockwave-curriculum\u002Flessons\u002Fch36-advantagescope-ii-custom-3d-assets\u002F1-coming-soon","AdvantageScope II: Custom 3D Assets — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch36-advantagescope-ii-custom-3d-assets\u002F36.1-coming-soon",{"path":357,"title":358,"stem":359},"\u002Fshockwave-curriculum\u002Flessons\u002Fch37-autonomous-i\u002F1-coming-soon","Autonomous I — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch37-autonomous-i\u002F37.1-coming-soon",{"path":361,"title":362,"stem":363},"\u002Fshockwave-curriculum\u002Flessons\u002Fch38-autonomous-ii-pathplanner-and-trajectories\u002F1-coming-soon","Autonomous II: PathPlanner & Trajectories — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch38-autonomous-ii-pathplanner-and-trajectories\u002F38.1-coming-soon",{"path":365,"title":366,"stem":367},"\u002Fshockwave-curriculum\u002Flessons\u002Fch39-control-fundamentals\u002F1-coming-soon","Control Fundamentals — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch39-control-fundamentals\u002F39.1-coming-soon",{"path":369,"title":370,"stem":371},"\u002Fshockwave-curriculum\u002Flessons\u002Fch40-motion-profiles\u002F1-coming-soon","Motion Profiles — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch40-motion-profiles\u002F40.1-coming-soon",{"path":373,"title":374,"stem":375},"\u002Fshockwave-curriculum\u002Flessons\u002Fch41-hardware-fundamentals\u002F1-coming-soon","Hardware Fundamentals — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch41-hardware-fundamentals\u002F41.1-coming-soon",{"path":377,"title":378,"stem":379},"\u002Fshockwave-curriculum\u002Flessons\u002Fch42-photonvision\u002F1-coming-soon","PhotonVision — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch42-photonvision\u002F42.1-coming-soon",{"path":381,"title":382,"stem":383},"\u002Fshockwave-curriculum\u002Flessons\u002Fch43-apriltags-and-pose\u002F1-coming-soon","AprilTags & Pose — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch43-apriltags-and-pose\u002F43.1-coming-soon",{"path":385,"title":386,"stem":387},"\u002Fshockwave-curriculum\u002Flessons\u002Fch44-subsystems-i\u002F1-coming-soon","Subsystems I — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch44-subsystems-i\u002F44.1-coming-soon",{"path":389,"title":390,"stem":391},"\u002Fshockwave-curriculum\u002Flessons\u002Fch45-subsystems-ii-advanced\u002F1-coming-soon","Subsystems II — Advanced — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch45-subsystems-ii-advanced\u002F45.1-coming-soon",{"path":393,"title":394,"stem":395},"\u002Fshockwave-curriculum\u002Flessons\u002Fch46-team-utilities-i\u002F1-coming-soon","Team Utilities I — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch46-team-utilities-i\u002F46.1-coming-soon",{"path":397,"title":398,"stem":399},"\u002Fshockwave-curriculum\u002Flessons\u002Fch47-field-constants\u002F1-coming-soon","Field Constants — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch47-field-constants\u002F47.1-coming-soon",{"path":401,"title":402,"stem":403},"\u002Fshockwave-curriculum\u002Flessons\u002Fch48-troubleshooting-i-runtime-debug\u002F1-coming-soon","Troubleshooting I — Runtime Debug — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch48-troubleshooting-i-runtime-debug\u002F48.1-coming-soon",{"path":405,"title":406,"stem":407},"\u002Fshockwave-curriculum\u002Flessons\u002Fch49-troubleshooting-ii-can-and-sim\u002F1-coming-soon","Troubleshooting II: CAN & Sim — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch49-troubleshooting-ii-can-and-sim\u002F49.1-coming-soon",{"path":409,"title":410,"stem":411},"\u002Fshockwave-curriculum\u002Flessons\u002Fch50-vendor-libraries-talonfx\u002F1-coming-soon","Vendor Libraries: TalonFX — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch50-vendor-libraries-talonfx\u002F50.1-coming-soon",{"path":413,"title":414,"stem":415},"\u002Fshockwave-curriculum\u002Flessons\u002Fch51-robot-alerts\u002F1-coming-soon","Robot Alerts — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch51-robot-alerts\u002F51.1-coming-soon",{"path":417,"title":418,"stem":419},"\u002Fshockwave-curriculum\u002Flessons\u002Fch52-wpilib-commands\u002F1-coming-soon","WPILib Commands — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch52-wpilib-commands\u002F52.1-coming-soon",{"path":421,"title":422,"stem":423},"\u002Fshockwave-curriculum\u002Flessons\u002Fch53-wpilib-geometry\u002F1-coming-soon","WPILib Geometry — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch53-wpilib-geometry\u002F53.1-coming-soon",{"path":425,"title":426,"stem":427},"\u002Fshockwave-curriculum\u002Flessons\u002Fch54-networktables\u002F1-coming-soon","NetworkTables — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch54-networktables\u002F54.1-coming-soon",{"path":429,"title":430,"stem":431},"\u002Fshockwave-curriculum\u002Flessons\u002Fch55-command-scheduler\u002F1-coming-soon","Command Scheduler — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch55-command-scheduler\u002F55.1-coming-soon",{"path":433,"title":434,"stem":435},"\u002Fshockwave-curriculum\u002Flessons\u002Fch56-wpilib-timers\u002F1-coming-soon","WPILib Timers — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch56-wpilib-timers\u002F56.1-coming-soon",{"path":437,"title":438,"stem":439},"\u002Fshockwave-curriculum\u002Flessons\u002Fch57-wpilib-triggers\u002F1-coming-soon","WPILib Triggers — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch57-wpilib-triggers\u002F57.1-coming-soon",{"path":441,"title":442,"stem":443},"\u002Fshockwave-curriculum\u002Flessons\u002Fch58-vendor-units-and-conversions\u002F1-coming-soon","Vendor Units & Conversions — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch58-vendor-units-and-conversions\u002F58.1-coming-soon",[445,449,453,457,461,465,469,473,477,481,485,489,493,497,501,505,509,513,517,521,525,529,533,537,541,545,549,553,557,561,565,569,573,577,581,585,589,593,597,601,605,609,613,617,621,625,629,633,637,641,645,649,653,657,661,665,669,673,677,681,685,689,693,697,701,705,709,713,717,721,725,729,733,737,741,745,749],{"path":446,"title":447,"stem":448},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch01-why-java-for-frc\u002F2-intro-to-algorithms-programming-and-compilers","Intro to Algorithms, Programming and Compilers — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch01-why-java-for-frc\u002F1.2-intro-to-algorithms-programming-and-compilers",{"path":450,"title":451,"stem":452},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F1-variables-and-data-types","Variables & Data Types — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F2.1-variables-and-data-types",{"path":454,"title":455,"stem":456},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F2-expressions-and-output","Expressions & Output — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F2.2-expressions-and-output",{"path":458,"title":459,"stem":460},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F3-assignment-and-input","Assignment & Input — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F2.3-assignment-and-input",{"path":462,"title":463,"stem":464},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F4-casting-and-ranges-of-values","Casting & Ranges of Values — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F2.4-casting-and-ranges-of-values",{"path":466,"title":467,"stem":468},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F5-compound-assignment-operators","Compound Assignment Operators — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F2.5-compound-assignment-operators",{"path":470,"title":471,"stem":472},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch03-apis-libraries-and-documentation\u002F1-apis-and-libraries","APIs and Libraries — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch03-apis-libraries-and-documentation\u002F3.1-apis-and-libraries",{"path":474,"title":475,"stem":476},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch03-apis-libraries-and-documentation\u002F2-documentation-with-comments-and-preconditions","Documentation with Comments and Preconditions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch03-apis-libraries-and-documentation\u002F3.2-documentation-with-comments-and-preconditions",{"path":478,"title":479,"stem":480},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch03-apis-libraries-and-documentation\u002F3-packages-and-imports","Packages & Imports — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch03-apis-libraries-and-documentation\u002F3.3-packages-and-imports",{"path":482,"title":483,"stem":484},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F1-methods-signatures-and-parameters","Methods, Signatures & Parameters — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4.1-methods-signatures-and-parameters",{"path":486,"title":487,"stem":488},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F2-calling-class-methods","Calling Class Methods — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4.2-calling-class-methods",{"path":490,"title":491,"stem":492},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F3-using-the-math-class","Using the Math Class — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4.3-using-the-math-class",{"path":494,"title":495,"stem":496},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4-objects-instances-of-classes","Objects — Instances of Classes — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4.4-objects-instances-of-classes",{"path":498,"title":499,"stem":500},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F5-creating-and-initializing-objects-constructors","Creating & Initializing Objects: Constructors — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4.5-creating-and-initializing-objects-constructors",{"path":502,"title":503,"stem":504},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F6-calling-instance-methods","Calling Instance Methods — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4.6-calling-instance-methods",{"path":506,"title":507,"stem":508},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F1-5.2-if-statements-and-for-loops","if Statements & For Loops — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.1-5.2-if-statements-and-for-loops",{"path":510,"title":511,"stem":512},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F10-nested-iteration","Nested Iteration — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.10-nested-iteration",{"path":514,"title":515,"stem":516},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F11-informal-runtime-analysis-of-loops","Informal Runtime Analysis of Loops — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.11-informal-runtime-analysis-of-loops",{"path":518,"title":519,"stem":520},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F12-switch-statements-and-expressions","switch Statements and Expressions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.12-switch-statements-and-expressions",{"path":522,"title":523,"stem":524},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F3-algorithms-with-selection-and-repetition","Algorithms with Selection and Repetition — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.3-algorithms-with-selection-and-repetition",{"path":526,"title":527,"stem":528},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F4-boolean-expressions","Boolean Expressions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.4-boolean-expressions",{"path":530,"title":531,"stem":532},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5-nested-if-statements","Nested if Statements — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.5-nested-if-statements",{"path":534,"title":535,"stem":536},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F6-compound-boolean-expressions","Compound Boolean Expressions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.6-compound-boolean-expressions",{"path":538,"title":539,"stem":540},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F7-comparing-boolean-expressions-de-morgans-laws","Comparing Boolean Expressions (De Morgan's Laws) — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.7-comparing-boolean-expressions-de-morgans-laws",{"path":542,"title":543,"stem":544},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F8-while-loops","While Loops — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.8-while-loops",{"path":546,"title":547,"stem":548},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F9-implementing-selection-and-iteration-algorithms","Implementing Selection and Iteration Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.9-implementing-selection-and-iteration-algorithms",{"path":550,"title":551,"stem":552},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F1-strings","Strings — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F6.1-strings",{"path":554,"title":555,"stem":556},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F2-string-algorithms","String Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F6.2-string-algorithms",{"path":558,"title":559,"stem":560},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F1-anatomy-of-a-java-class","Anatomy of a Java Class — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F7.1-anatomy-of-a-java-class",{"path":562,"title":563,"stem":564},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F2-methods-how-to-write-them","Methods: How to Write Them — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F7.2-methods-how-to-write-them",{"path":566,"title":567,"stem":568},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F3-methods-passing-and-returning-references-of-an-object","Methods: Passing & Returning References of an Object — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F7.3-methods-passing-and-returning-references-of-an-object",{"path":570,"title":571,"stem":572},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F4-class-static-variables-and-methods","Class (static) Variables & Methods — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F7.4-class-static-variables-and-methods",{"path":574,"title":575,"stem":576},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch08-constructors-and-this\u002F1-8.2-constructors-and-this","Constructors & \"this\" — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch08-constructors-and-this\u002F8.1-8.2-constructors-and-this",{"path":578,"title":579,"stem":580},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F1-array-creation-and-access","Array Creation and Access — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.1-array-creation-and-access",{"path":582,"title":583,"stem":584},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F2-arraylist-and-its-methods","ArrayList and its Methods — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.2-arraylist-and-its-methods",{"path":586,"title":587,"stem":588},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F3-optional-hashmap-dictionary-data-structure","HashMap (Dictionary) Data Structure — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.3-optional-hashmap-dictionary-data-structure",{"path":590,"title":591,"stem":592},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F4-array-traversals","Array Traversals — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.4-array-traversals",{"path":594,"title":595,"stem":596},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F5-implementing-array-algorithms","Implementing Array Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.5-implementing-array-algorithms",{"path":598,"title":599,"stem":600},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F6-arraylist-traversals","ArrayList Traversals — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.6-arraylist-traversals",{"path":602,"title":603,"stem":604},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F7-implementing-arraylist-algorithms","Implementing ArrayList Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.7-implementing-arraylist-algorithms",{"path":606,"title":607,"stem":608},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F8-using-text-files","Using Text Files — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.8-using-text-files",{"path":610,"title":611,"stem":612},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch10-2d-arrays\u002F1-2d-array-creation-and-access","2D Array Creation and Access — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch10-2d-arrays\u002F10.1-2d-array-creation-and-access",{"path":614,"title":615,"stem":616},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch10-2d-arrays\u002F2-2d-array-traversals-nested-loops","2D Array Traversals: Nested Loops — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch10-2d-arrays\u002F10.2-2d-array-traversals-nested-loops",{"path":618,"title":619,"stem":620},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch10-2d-arrays\u002F3-implementing-2d-array-algorithms","Implementing 2D Array Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch10-2d-arrays\u002F10.3-implementing-2d-array-algorithms",{"path":622,"title":623,"stem":624},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch11-enums-named-choices\u002F11-enums-named-choices","Enums: Named Choices — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch11-enums-named-choices\u002F11-enums-named-choices",{"path":626,"title":627,"stem":628},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch12-exceptions-and-try-catch\u002F12-exceptions-and-try-catch","Exceptions & try\u002Fcatch — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch12-exceptions-and-try-catch\u002F12-exceptions-and-try-catch",{"path":630,"title":631,"stem":632},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch13-common-gotchas\u002F13-common-gotchas","Common Gotchas — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch13-common-gotchas\u002F13-common-gotchas",{"path":634,"title":635,"stem":636},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch15-advanced-collections\u002F15-advanced-collections","Advanced Collections (Set\u002FQueue\u002FMap) — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch15-advanced-collections\u002F15-advanced-collections",{"path":638,"title":639,"stem":640},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch16-writing-your-own-generics\u002F16-writing-your-own-generics","Writing Your Own Generics — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch16-writing-your-own-generics\u002F16-writing-your-own-generics",{"path":642,"title":643,"stem":644},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F1-inheritance-superclass-subclass","Inheritance, Superclass, Subclass — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F17.1-inheritance-superclass-subclass",{"path":646,"title":647,"stem":648},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F2-inheritance-and-constructors","Inheritance and Constructors — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F17.2-inheritance-and-constructors",{"path":650,"title":651,"stem":652},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F3-inheritance-hierarchies","Inheritance Hierarchies — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F17.3-inheritance-hierarchies",{"path":654,"title":655,"stem":656},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F4-object-superclass","Object Superclass — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F17.4-object-superclass",{"path":658,"title":659,"stem":660},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F5-abstract-classes-and-methods","Abstract Classes and Methods — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F17.5-abstract-classes-and-methods",{"path":662,"title":663,"stem":664},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch18-polymorphism-many-forms\u002F1-overriding-methods","Overriding Methods — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch18-polymorphism-many-forms\u002F18.1-overriding-methods",{"path":666,"title":667,"stem":668},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch18-polymorphism-many-forms\u002F2-super-keyword","super Keyword — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch18-polymorphism-many-forms\u002F18.2-super-keyword",{"path":670,"title":671,"stem":672},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch18-polymorphism-many-forms\u002F3-polymorphism","Polymorphism — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch18-polymorphism-many-forms\u002F18.3-polymorphism",{"path":674,"title":675,"stem":676},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch19-interfaces-as-contracts\u002F19-interfaces-as-contracts","Interfaces as Contracts — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch19-interfaces-as-contracts\u002F19-interfaces-as-contracts",{"path":678,"title":679,"stem":680},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch19-interfaces-as-contracts\u002F1-lambdas-and-method-references","Lambdas & Method References — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch19-interfaces-as-contracts\u002F19.1-lambdas-and-method-references",{"path":682,"title":683,"stem":684},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch20-the-io-layer-pattern\u002F20-the-io-layer-pattern","The IO-Layer Pattern — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch20-the-io-layer-pattern\u002F20-the-io-layer-pattern",{"path":686,"title":687,"stem":688},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch21-static-factories\u002F21-static-factories","Static Factories — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch21-static-factories\u002F21-static-factories",{"path":690,"title":691,"stem":692},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch22-the-builder-pattern\u002F22-the-builder-pattern","The Builder Pattern — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch22-the-builder-pattern\u002F22-the-builder-pattern",{"path":694,"title":695,"stem":696},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch23-encapsulation-and-final\u002F1-scope-and-access","Access, final, and Immutability — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch23-encapsulation-and-final\u002F23.1-scope-and-access",{"path":698,"title":699,"stem":700},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch24-optional-avoiding-null-pointer-exceptions\u002F24-optional-avoiding-null-pointer-exceptions","Optional: Avoiding Null Pointer Exceptions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch24-optional-avoiding-null-pointer-exceptions\u002F24-optional-avoiding-null-pointer-exceptions",{"path":702,"title":703,"stem":704},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F1-what-is-command-based-programming","What Is Command-Based Programming? — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.1-what-is-command-based-programming",{"path":706,"title":707,"stem":708},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F2-commands-and-command-compositions","Commands & Command Compositions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.2-commands-and-command-compositions",{"path":710,"title":711,"stem":712},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F3-the-command-scheduler","The Command Scheduler — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.3-the-command-scheduler",{"path":714,"title":715,"stem":716},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F4-state-machines-logic","State Machines: Logic — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.4-state-machines-logic",{"path":718,"title":719,"stem":720},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F5-managing-transitions","Managing Transitions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.5-managing-transitions",{"path":722,"title":723,"stem":724},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F6-binding-commands-to-triggers","Binding Commands to Triggers — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.6-binding-commands-to-triggers",{"path":726,"title":727,"stem":728},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F7-structuring-a-command-based-robot-project","Structuring a Command-Based Robot Project — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.7-structuring-a-command-based-robot-project",{"path":730,"title":731,"stem":732},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways","Architecture Takeaways — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways",{"path":734,"title":735,"stem":736},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch27-program-design-and-abstraction\u002F1-abstraction-and-program-design","Abstraction and Program Design — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch27-program-design-and-abstraction\u002F27.1-abstraction-and-program-design",{"path":738,"title":739,"stem":740},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F1-searching-algorithms","Searching Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F28.1-searching-algorithms",{"path":742,"title":743,"stem":744},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F2-sorting-algorithms","Sorting Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F28.2-sorting-algorithms",{"path":746,"title":747,"stem":748},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F3-recursion","Recursion — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F28.3-recursion",{"path":750,"title":751,"stem":752},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F4-recursive-searching-and-sorting","Recursive Searching and Sorting — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F28.4-recursive-searching-and-sorting",[754,758,762,766,770,774,778,782,786,790,794,798,802,806,810,814,818,822,826,830,834,838,842,846,850,854,858,862,866,870,874,878,882,886,890,894,898,902,906,910,914,918,922,926,930,934,938,942,946,950,954,958,962,966,970,974,978,982,986,990,994,998,1002,1006,1010,1014,1018,1022,1026,1030,1034,1038,1042,1046,1050,1054,1058,1062,1066],{"path":755,"title":756,"stem":757},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch01-why-java-for-frc\u002F2-intro-to-algorithms-programming-and-compilers","Intro to Algorithms, Programming and Compilers — Exercises","shockwave-curriculum\u002Fexercises\u002Fch01-why-java-for-frc\u002F1.2-intro-to-algorithms-programming-and-compilers",{"path":759,"title":760,"stem":761},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F1-variables-and-data-types","Variables & Data Types — Exercises","shockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F2.1-variables-and-data-types",{"path":763,"title":764,"stem":765},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F2-expressions-and-output","Expressions & Output — Exercises","shockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F2.2-expressions-and-output",{"path":767,"title":768,"stem":769},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F3-assignment-and-input","Assignment & Input — Exercises","shockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F2.3-assignment-and-input",{"path":771,"title":772,"stem":773},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F4-casting-and-ranges-of-values","Casting & Ranges of Values — Exercises","shockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F2.4-casting-and-ranges-of-values",{"path":775,"title":776,"stem":777},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F5-compound-assignment-operators","Compound Assignment Operators — Exercises","shockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F2.5-compound-assignment-operators",{"path":779,"title":780,"stem":781},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch03-apis-libraries-and-documentation\u002F1-apis-and-libraries","APIs and Libraries — Exercises","shockwave-curriculum\u002Fexercises\u002Fch03-apis-libraries-and-documentation\u002F3.1-apis-and-libraries",{"path":783,"title":784,"stem":785},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch03-apis-libraries-and-documentation\u002F2-documentation-with-comments-and-preconditions","Documentation with Comments and Preconditions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch03-apis-libraries-and-documentation\u002F3.2-documentation-with-comments-and-preconditions",{"path":787,"title":788,"stem":789},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch03-apis-libraries-and-documentation\u002F3-packages-and-imports","Packages & Imports — Exercises","shockwave-curriculum\u002Fexercises\u002Fch03-apis-libraries-and-documentation\u002F3.3-packages-and-imports",{"path":791,"title":792,"stem":793},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F1-methods-signatures-and-parameters","Methods, Signatures & Parameters — Exercises","shockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4.1-methods-signatures-and-parameters",{"path":795,"title":796,"stem":797},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F2-calling-class-methods","Calling Class Methods — Exercises","shockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4.2-calling-class-methods",{"path":799,"title":800,"stem":801},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F3-using-the-math-class","Using the Math Class — Exercises","shockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4.3-using-the-math-class",{"path":803,"title":804,"stem":805},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4-objects-instances-of-classes","Objects — Instances of Classes — Exercises","shockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4.4-objects-instances-of-classes",{"path":807,"title":808,"stem":809},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F5-creating-and-initializing-objects-constructors","Creating & Initializing Objects: Constructors — Exercises","shockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4.5-creating-and-initializing-objects-constructors",{"path":811,"title":812,"stem":813},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F6-calling-instance-methods","Calling Instance Methods — Exercises","shockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4.6-calling-instance-methods",{"path":815,"title":816,"stem":817},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F1-5.2-if-statements-and-for-loops","if Statements & For Loops — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.1-5.2-if-statements-and-for-loops",{"path":819,"title":820,"stem":821},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F10-nested-iteration","Nested Iteration — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.10-nested-iteration",{"path":823,"title":824,"stem":825},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F11-informal-runtime-analysis-of-loops","Informal Runtime Analysis of Loops — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.11-informal-runtime-analysis-of-loops",{"path":827,"title":828,"stem":829},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F12-switch-statements-and-expressions","switch Statements and Expressions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.12-switch-statements-and-expressions",{"path":831,"title":832,"stem":833},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F3-algorithms-with-selection-and-repetition","Algorithms with Selection and Repetition — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.3-algorithms-with-selection-and-repetition",{"path":835,"title":836,"stem":837},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F4-boolean-expressions","Boolean Expressions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.4-boolean-expressions",{"path":839,"title":840,"stem":841},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5-nested-if-statements","Nested if Statements — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.5-nested-if-statements",{"path":843,"title":844,"stem":845},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F6-compound-boolean-expressions","Compound Boolean Expressions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.6-compound-boolean-expressions",{"path":847,"title":848,"stem":849},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F7-comparing-boolean-expressions-de-morgans-laws","Comparing Boolean Expressions (De Morgan's Laws) — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.7-comparing-boolean-expressions-de-morgans-laws",{"path":851,"title":852,"stem":853},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F8-while-loops","While Loops — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.8-while-loops",{"path":855,"title":856,"stem":857},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F9-implementing-selection-and-iteration-algorithms","Implementing Selection and Iteration Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.9-implementing-selection-and-iteration-algorithms",{"path":859,"title":860,"stem":861},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F1-strings","Strings — Exercises","shockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F6.1-strings",{"path":863,"title":864,"stem":865},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F2-string-algorithms","String Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F6.2-string-algorithms",{"path":867,"title":868,"stem":869},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F1-anatomy-of-a-java-class","Anatomy of a Java Class — Exercises","shockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F7.1-anatomy-of-a-java-class",{"path":871,"title":872,"stem":873},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F2-methods-how-to-write-them","Methods: How to Write Them — Exercises","shockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F7.2-methods-how-to-write-them",{"path":875,"title":876,"stem":877},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F3-methods-passing-and-returning-references-of-an-object","Methods: Passing & Returning References of an Object — Exercises","shockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F7.3-methods-passing-and-returning-references-of-an-object",{"path":879,"title":880,"stem":881},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F4-class-static-variables-and-methods","Class (static) Variables & Methods — Exercises","shockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F7.4-class-static-variables-and-methods",{"path":883,"title":884,"stem":885},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch08-constructors-and-this\u002F1-8.2-constructors-and-this","Constructors & \"this\" — Exercises","shockwave-curriculum\u002Fexercises\u002Fch08-constructors-and-this\u002F8.1-8.2-constructors-and-this",{"path":887,"title":888,"stem":889},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F1-array-creation-and-access","Array Creation and Access — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.1-array-creation-and-access",{"path":891,"title":892,"stem":893},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F2-arraylist-and-its-methods","ArrayList and its Methods — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.2-arraylist-and-its-methods",{"path":895,"title":896,"stem":897},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F3-optional-hashmap-dictionary-data-structure","HashMap (Dictionary) Data Structure — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.3-optional-hashmap-dictionary-data-structure",{"path":899,"title":900,"stem":901},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F4-array-traversals","Array Traversals — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.4-array-traversals",{"path":903,"title":904,"stem":905},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F5-implementing-array-algorithms","Implementing Array Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.5-implementing-array-algorithms",{"path":907,"title":908,"stem":909},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F6-arraylist-traversals","ArrayList Traversals — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.6-arraylist-traversals",{"path":911,"title":912,"stem":913},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F7-implementing-arraylist-algorithms","Implementing ArrayList Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.7-implementing-arraylist-algorithms",{"path":915,"title":916,"stem":917},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F8-using-text-files","Using Text Files — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.8-using-text-files",{"path":919,"title":920,"stem":921},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch10-2d-arrays\u002F1-2d-array-creation-and-access","2D Array Creation and Access — Exercises","shockwave-curriculum\u002Fexercises\u002Fch10-2d-arrays\u002F10.1-2d-array-creation-and-access",{"path":923,"title":924,"stem":925},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch10-2d-arrays\u002F2-2d-array-traversals-nested-loops","2D Array Traversals: Nested Loops — Exercises","shockwave-curriculum\u002Fexercises\u002Fch10-2d-arrays\u002F10.2-2d-array-traversals-nested-loops",{"path":927,"title":928,"stem":929},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch10-2d-arrays\u002F3-implementing-2d-array-algorithms","Implementing 2D Array Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch10-2d-arrays\u002F10.3-implementing-2d-array-algorithms",{"path":931,"title":932,"stem":933},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch11-enums-named-choices\u002F11-enums-named-choices","Enums: Named Choices — Exercises","shockwave-curriculum\u002Fexercises\u002Fch11-enums-named-choices\u002F11-enums-named-choices",{"path":935,"title":936,"stem":937},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch12-exceptions-and-try-catch\u002F12-exceptions-and-try-catch","Exceptions & try\u002Fcatch — Exercises","shockwave-curriculum\u002Fexercises\u002Fch12-exceptions-and-try-catch\u002F12-exceptions-and-try-catch",{"path":939,"title":940,"stem":941},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch13-common-gotchas\u002F13-common-gotchas","Common Gotchas — Exercises","shockwave-curriculum\u002Fexercises\u002Fch13-common-gotchas\u002F13-common-gotchas",{"path":943,"title":944,"stem":945},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch14-why-design-patterns\u002F14-why-design-patterns","Why Design Patterns? — Exercises","shockwave-curriculum\u002Fexercises\u002Fch14-why-design-patterns\u002F14-why-design-patterns",{"path":947,"title":948,"stem":949},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch15-advanced-collections\u002F15-advanced-collections","Advanced Collections (Set\u002FQueue\u002FMap) — Exercises","shockwave-curriculum\u002Fexercises\u002Fch15-advanced-collections\u002F15-advanced-collections",{"path":951,"title":952,"stem":953},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch16-writing-your-own-generics\u002F16-writing-your-own-generics","Writing Your Own Generics — Exercises","shockwave-curriculum\u002Fexercises\u002Fch16-writing-your-own-generics\u002F16-writing-your-own-generics",{"path":955,"title":956,"stem":957},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F1-inheritance-superclass-subclass","Inheritance, Superclass, Subclass — Exercises","shockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F17.1-inheritance-superclass-subclass",{"path":959,"title":960,"stem":961},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F2-inheritance-and-constructors","Inheritance and Constructors — Exercises","shockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F17.2-inheritance-and-constructors",{"path":963,"title":964,"stem":965},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F3-inheritance-hierarchies","Inheritance Hierarchies — Exercises","shockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F17.3-inheritance-hierarchies",{"path":967,"title":968,"stem":969},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F4-object-superclass","Object Superclass — Exercises","shockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F17.4-object-superclass",{"path":971,"title":972,"stem":973},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F5-abstract-classes-and-methods","Abstract Classes and Methods — Exercises","shockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F17.5-abstract-classes-and-methods",{"path":975,"title":976,"stem":977},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch18-polymorphism-many-forms\u002F1-overriding-methods","Overriding Methods — Exercises","shockwave-curriculum\u002Fexercises\u002Fch18-polymorphism-many-forms\u002F18.1-overriding-methods",{"path":979,"title":980,"stem":981},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch18-polymorphism-many-forms\u002F2-super-keyword","super Keyword — Exercises","shockwave-curriculum\u002Fexercises\u002Fch18-polymorphism-many-forms\u002F18.2-super-keyword",{"path":983,"title":984,"stem":985},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch18-polymorphism-many-forms\u002F3-polymorphism","Polymorphism — Exercises","shockwave-curriculum\u002Fexercises\u002Fch18-polymorphism-many-forms\u002F18.3-polymorphism",{"path":987,"title":988,"stem":989},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch19-interfaces-as-contracts\u002F19-interfaces-as-contracts","Interfaces as Contracts — Exercises","shockwave-curriculum\u002Fexercises\u002Fch19-interfaces-as-contracts\u002F19-interfaces-as-contracts",{"path":991,"title":992,"stem":993},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch19-interfaces-as-contracts\u002F1-lambdas-and-method-references","Lambdas & Method References — Exercises","shockwave-curriculum\u002Fexercises\u002Fch19-interfaces-as-contracts\u002F19.1-lambdas-and-method-references",{"path":995,"title":996,"stem":997},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch20-the-io-layer-pattern\u002F20-the-io-layer-pattern","The IO-Layer Pattern — Exercises","shockwave-curriculum\u002Fexercises\u002Fch20-the-io-layer-pattern\u002F20-the-io-layer-pattern",{"path":999,"title":1000,"stem":1001},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch21-static-factories\u002F21-static-factories","Static Factories — Exercises","shockwave-curriculum\u002Fexercises\u002Fch21-static-factories\u002F21-static-factories",{"path":1003,"title":1004,"stem":1005},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch22-the-builder-pattern\u002F22-the-builder-pattern","The Builder Pattern — Exercises","shockwave-curriculum\u002Fexercises\u002Fch22-the-builder-pattern\u002F22-the-builder-pattern",{"path":1007,"title":1008,"stem":1009},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch23-encapsulation-and-final\u002F1-scope-and-access","Access, final, and Immutability — Exercises","shockwave-curriculum\u002Fexercises\u002Fch23-encapsulation-and-final\u002F23.1-scope-and-access",{"path":1011,"title":1012,"stem":1013},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch24-optional-avoiding-null-pointer-exceptions\u002F24-optional-avoiding-null-pointer-exceptions","Optional: Avoiding Null Pointer Exceptions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch24-optional-avoiding-null-pointer-exceptions\u002F24-optional-avoiding-null-pointer-exceptions",{"path":1015,"title":1016,"stem":1017},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F1-what-is-command-based-programming","What Is Command-Based Programming? — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.1-what-is-command-based-programming",{"path":1019,"title":1020,"stem":1021},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F2-commands-and-command-compositions","Commands & Command Compositions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.2-commands-and-command-compositions",{"path":1023,"title":1024,"stem":1025},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F3-the-command-scheduler","The Command Scheduler — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.3-the-command-scheduler",{"path":1027,"title":1028,"stem":1029},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F4-state-machines-logic","State Machines: Logic — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.4-state-machines-logic",{"path":1031,"title":1032,"stem":1033},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F5-managing-transitions","Managing Transitions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.5-managing-transitions",{"path":1035,"title":1036,"stem":1037},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F6-binding-commands-to-triggers","Binding Commands to Triggers — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.6-binding-commands-to-triggers",{"path":1039,"title":1040,"stem":1041},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F7-structuring-a-command-based-robot-project","Structuring a Command-Based Robot Project — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.7-structuring-a-command-based-robot-project",{"path":1043,"title":1044,"stem":1045},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways","Architecture Takeaways — Exercises","shockwave-curriculum\u002Fexercises\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways",{"path":1047,"title":1048,"stem":1049},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch27-program-design-and-abstraction\u002F1-abstraction-and-program-design","Abstraction and Program Design — Exercises","shockwave-curriculum\u002Fexercises\u002Fch27-program-design-and-abstraction\u002F27.1-abstraction-and-program-design",{"path":1051,"title":1052,"stem":1053},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch27-program-design-and-abstraction\u002F2-impact-of-program-design","Impact of Program Design — Exercises","shockwave-curriculum\u002Fexercises\u002Fch27-program-design-and-abstraction\u002F27.2-impact-of-program-design",{"path":1055,"title":1056,"stem":1057},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F1-searching-algorithms","Searching Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F28.1-searching-algorithms",{"path":1059,"title":1060,"stem":1061},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F2-sorting-algorithms","Sorting Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F28.2-sorting-algorithms",{"path":1063,"title":1064,"stem":1065},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F3-recursion","Recursion — Exercises","shockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F28.3-recursion",{"path":1067,"title":1068,"stem":1069},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F4-recursive-searching-and-sorting","Recursive Searching and Sorting — Exercises","shockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F28.4-recursive-searching-and-sorting",{"id":1071,"title":118,"body":1072,"description":1103,"extension":1428,"meta":1429,"navigation":1432,"path":117,"seo":1433,"stem":119,"__hash__":1434},"lessons\u002Fshockwave-curriculum\u002Flessons\u002Fch06-strings\u002F6.2-string-algorithms.md",{"type":1073,"value":1074,"toc":1420},"minimark",[1075,1079,1084,1097,1162,1172,1183,1191,1239,1263,1267,1270,1302,1332,1336,1379,1383,1405,1416],[1076,1077,118],"h1",{"id":1078},"string-algorithms",[1080,1081,1083],"h2",{"id":1082},"scanning-a-string-character-by-character","Scanning a String Character by Character",[1085,1086,1087,1088,1092,1093,1096],"p",{},"A ",[1089,1090,1091],"code",{},"for"," loop is the standard way to visit every character of a string — start at 0, stop before ",[1089,1094,1095],{},"length()",":",[1098,1099,1104],"pre",{"className":1100,"code":1101,"language":1102,"meta":1103,"style":1103},"language-java shiki shiki-themes github-light github-dark","String autoName = \"BlueAlliance-Left\";\nint dashCount = 0;\nfor (int i = 0; i \u003C autoName.length(); i++)\n{\n    if (autoName.substring(i, i + 1).equals(\"-\"))\n    {\n        dashCount++;\n    }\n}\n","java","",[1089,1105,1106,1114,1120,1126,1132,1138,1144,1150,1156],{"__ignoreMap":1103},[1107,1108,1111],"span",{"class":1109,"line":1110},"line",1,[1107,1112,1113],{},"String autoName = \"BlueAlliance-Left\";\n",[1107,1115,1117],{"class":1109,"line":1116},2,[1107,1118,1119],{},"int dashCount = 0;\n",[1107,1121,1123],{"class":1109,"line":1122},3,[1107,1124,1125],{},"for (int i = 0; i \u003C autoName.length(); i++)\n",[1107,1127,1129],{"class":1109,"line":1128},4,[1107,1130,1131],{},"{\n",[1107,1133,1135],{"class":1109,"line":1134},5,[1107,1136,1137],{},"    if (autoName.substring(i, i + 1).equals(\"-\"))\n",[1107,1139,1141],{"class":1109,"line":1140},6,[1107,1142,1143],{},"    {\n",[1107,1145,1147],{"class":1109,"line":1146},7,[1107,1148,1149],{},"        dashCount++;\n",[1107,1151,1153],{"class":1109,"line":1152},8,[1107,1154,1155],{},"    }\n",[1107,1157,1159],{"class":1109,"line":1158},9,[1107,1160,1161],{},"}\n",[1085,1163,1164,1165,1167,1168,1171],{},"Use a ",[1089,1166,1091],{}," loop when you know you want to check every character. Use a ",[1089,1169,1170],{},"while"," loop instead when you're searching for something and don't know in advance how many characters you'll need to check — see the find-and-replace pattern below.",[1080,1173,1175,1176,1179,1180],{"id":1174},"find-and-replace-with-indexof-substring","Find and Replace with ",[1089,1177,1178],{},"indexOf"," + ",[1089,1181,1182],{},"substring",[1085,1184,1087,1185,1187,1188,1190],{},[1089,1186,1170],{}," loop paired with ",[1089,1189,1178],{}," repeatedly finds and processes one match at a time, until none remain:",[1098,1192,1194],{"className":1100,"code":1193,"language":1102,"meta":1103,"style":1103},"String name = \"A11iance\";\nint i = 0;\nwhile (name.indexOf(\"1\") >= 0)\n{\n    i = name.indexOf(\"1\");\n    String firstPart = name.substring(0, i);\n    String lastPart = name.substring(i + 1);\n    name = firstPart + \"l\" + lastPart; \u002F\u002F replace the \"1\" with \"l\"\n}\n",[1089,1195,1196,1201,1206,1211,1215,1220,1225,1230,1235],{"__ignoreMap":1103},[1107,1197,1198],{"class":1109,"line":1110},[1107,1199,1200],{},"String name = \"A11iance\";\n",[1107,1202,1203],{"class":1109,"line":1116},[1107,1204,1205],{},"int i = 0;\n",[1107,1207,1208],{"class":1109,"line":1122},[1107,1209,1210],{},"while (name.indexOf(\"1\") >= 0)\n",[1107,1212,1213],{"class":1109,"line":1128},[1107,1214,1131],{},[1107,1216,1217],{"class":1109,"line":1134},[1107,1218,1219],{},"    i = name.indexOf(\"1\");\n",[1107,1221,1222],{"class":1109,"line":1140},[1107,1223,1224],{},"    String firstPart = name.substring(0, i);\n",[1107,1226,1227],{"class":1109,"line":1146},[1107,1228,1229],{},"    String lastPart = name.substring(i + 1);\n",[1107,1231,1232],{"class":1109,"line":1152},[1107,1233,1234],{},"    name = firstPart + \"l\" + lastPart; \u002F\u002F replace the \"1\" with \"l\"\n",[1107,1236,1237],{"class":1109,"line":1158},[1107,1238,1161],{},[1085,1240,1241,1242,1245,1246,1249,1250,1253,1254,1258,1259,1262],{},"This loop runs twice: the first pass turns ",[1089,1243,1244],{},"\"A11iance\""," into ",[1089,1247,1248],{},"\"Al1iance\"",", and the second turns that into ",[1089,1251,1252],{},"\"Alliance\"",". Each pass finds the ",[1255,1256,1257],"em",{},"next"," occurrence, because the string was already reassigned — the search always runs against the current (updated) value of ",[1089,1260,1261],{},"name",".",[1080,1264,1266],{"id":1265},"building-a-new-string","Building a New String",[1085,1268,1269],{},"Since strings are immutable, \"building\" one really means starting with an empty string and concatenating onto it inside a loop:",[1098,1271,1273],{"className":1100,"code":1272,"language":1102,"meta":1103,"style":1103},"String reversed = \"\";\nfor (int i = 0; i \u003C autoName.length(); i++)\n{\n    String letter = autoName.substring(i, i + 1);\n    reversed = letter + reversed; \u002F\u002F prepend — builds the string backwards\n}\n",[1089,1274,1275,1280,1284,1288,1293,1298],{"__ignoreMap":1103},[1107,1276,1277],{"class":1109,"line":1110},[1107,1278,1279],{},"String reversed = \"\";\n",[1107,1281,1282],{"class":1109,"line":1116},[1107,1283,1125],{},[1107,1285,1286],{"class":1109,"line":1122},[1107,1287,1131],{},[1107,1289,1290],{"class":1109,"line":1128},[1107,1291,1292],{},"    String letter = autoName.substring(i, i + 1);\n",[1107,1294,1295],{"class":1109,"line":1134},[1107,1296,1297],{},"    reversed = letter + reversed; \u002F\u002F prepend — builds the string backwards\n",[1107,1299,1300],{"class":1109,"line":1140},[1107,1301,1161],{},[1085,1303,1304,1305,1308,1309,1311,1312,1315,1316,1319,1320,1323,1324,1327,1328,1331],{},"In real code, two shortcuts save you from hand-writing these patterns: ",[1089,1306,1307],{},"name.replace(\"1\", \"l\")"," does the entire find-and-replace loop above in one call (every occurrence, no manual ",[1089,1310,1178],{}," loop), and ",[1089,1313,1314],{},"StringBuilder"," is built for exactly this kind of repeated concatenation — ",[1089,1317,1318],{},"new StringBuilder(autoName).reverse().toString()"," reverses a string in one line, and ",[1089,1321,1322],{},"append(...)"," avoids creating a new ",[1089,1325,1326],{},"String"," object on every pass the way ",[1089,1329,1330],{},"+="," does.",[1080,1333,1335],{"id":1334},"common-pitfalls","Common Pitfalls",[1337,1338,1339,1347,1370],"ul",{},[1340,1341,1342,1346],"li",{},[1343,1344,1345],"strong",{},"Starting a string-scanning loop at 1 instead of 0."," The first character is always at index 0 — starting at 1 skips it.",[1340,1348,1349,1362,1363,1366,1367,1262],{},[1343,1350,1351,1352,1355,1356,1359,1360,1262],{},"Using ",[1089,1353,1354],{},"\u003C="," instead of ",[1089,1357,1358],{},"\u003C"," against ",[1089,1361,1095],{}," ",[1089,1364,1365],{},"i \u003C= autoName.length()"," reads one index past the end and throws ",[1089,1368,1369],{},"StringIndexOutOfBoundsException",[1340,1371,1372,1375,1376,1378],{},[1343,1373,1374],{},"An infinite loop in a find-and-replace pattern."," If the replacement text itself still contains the thing you're searching for, ",[1089,1377,1178],{}," finds it again forever — make sure each pass genuinely reduces what's left to find.",[1080,1380,1382],{"id":1381},"key-takeaways","Key Takeaways",[1337,1384,1385,1393,1402],{},[1340,1386,1387,1389,1390,1392],{},[1089,1388,1091],{}," loops fit scanning every character; ",[1089,1391,1170],{}," loops fit searching for an unknown number of matches.",[1340,1394,1395,1396,1398,1399,1401],{},"A find-and-replace loop combines ",[1089,1397,1178],{}," (to locate) with ",[1089,1400,1182],{}," (to rebuild around the match), reassigning the string each pass.",[1340,1403,1404],{},"Building a new string from scratch means starting empty and concatenating inside a loop — strings can't be modified in place.",[1085,1406,1407,1408,1411,1412,1415],{},"Derived from ",[1089,1409,1410],{},"csawesome-2026",": ",[1089,1413,1414],{},"unit-2-selection-and-iteration\u002F2.10-implementing-string-algorithms.md"," (CSA 2.10)",[1417,1418,1419],"style",{},"html .default .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}html .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}html .dark .shiki span {color: var(--shiki-dark);background: var(--shiki-dark-bg);font-style: var(--shiki-dark-font-style);font-weight: var(--shiki-dark-font-weight);text-decoration: var(--shiki-dark-text-decoration);}html.dark .shiki span {color: var(--shiki-dark);background: var(--shiki-dark-bg);font-style: var(--shiki-dark-font-style);font-weight: var(--shiki-dark-font-weight);text-decoration: var(--shiki-dark-text-decoration);}",{"title":1103,"searchDepth":1116,"depth":1116,"links":1421},[1422,1423,1425,1426,1427],{"id":1082,"depth":1116,"text":1083},{"id":1174,"depth":1116,"text":1424},"Find and Replace with indexOf + substring",{"id":1265,"depth":1116,"text":1266},{"id":1334,"depth":1116,"text":1335},{"id":1381,"depth":1116,"text":1382},"md",{"outlineRef":1430,"status":1431},"6.2 — String Algorithms (CSA 2.10)","new — authored lesson (fuller depth than the teaser slide)",true,{"title":118,"description":1103},"06R5z5Mo7disM1QtJqyftS12Eh1h31NfkZqry9MIUqo",{"id":1436,"title":555,"body":1437,"description":1103,"extension":1428,"meta":1828,"navigation":1432,"path":554,"seo":1831,"stem":556,"__hash__":1832},"examples\u002Fshockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F6.2-string-algorithms.md",{"type":1073,"value":1438,"toc":1814},[1439,1442,1446,1453,1457,1477,1484,1520,1524,1530,1571,1584,1588,1597,1640,1657,1661,1664,1697,1708,1712,1732,1735,1743,1747,1757,1764,1785,1789,1812],[1076,1440,555],{"id":1441},"string-algorithms-worked-example",[1080,1443,1445],{"id":1444},"problem","Problem",[1085,1447,1448,1449,1452],{},"A driver types the name of an autonomous routine into the dashboard before a match, e.g. ",[1089,1450,1451],{},"\"Left  Start Cone\""," — they double-tapped the spacebar by accident. Before the routine name can be written to the match log as a filename-safe tag, count how many spaces it contains, replace every space with an underscore, and build a reversed copy of the cleaned name for a scrolling ticker display.",[1080,1454,1456],{"id":1455},"step-1-plan-it-first","Step 1: Plan It First",[1458,1459,1460,1466,1474],"ol",{},[1340,1461,1462,1463,1465],{},"Scan every character and count the spaces — a known number of characters to check, so a ",[1089,1464,1091],{}," loop fits.",[1340,1467,1468,1469,1187,1471,1473],{},"Replace spaces with underscores one at a time until none remain — an unknown number of matches, so a ",[1089,1470,1170],{},[1089,1472,1178],{}," fits.",[1340,1475,1476],{},"Build a reversed copy of the cleaned name by concatenating onto a new string, one character at a time.",[1080,1478,1480,1481],{"id":1479},"step-2-set-up-the-class-and-main","Step 2: Set Up the Class and ",[1089,1482,1483],{},"main",[1098,1485,1487],{"className":1100,"code":1486,"language":1102,"meta":1103,"style":1103},"public class RoutineNameCleaner\n{\n    public static void main(String[] args)\n    {\n        String rawName = \"Left  Start Cone\";\n    }\n}\n",[1089,1488,1489,1494,1498,1503,1507,1512,1516],{"__ignoreMap":1103},[1107,1490,1491],{"class":1109,"line":1110},[1107,1492,1493],{},"public class RoutineNameCleaner\n",[1107,1495,1496],{"class":1109,"line":1116},[1107,1497,1131],{},[1107,1499,1500],{"class":1109,"line":1122},[1107,1501,1502],{},"    public static void main(String[] args)\n",[1107,1504,1505],{"class":1109,"line":1128},[1107,1506,1143],{},[1107,1508,1509],{"class":1109,"line":1134},[1107,1510,1511],{},"        String rawName = \"Left  Start Cone\";\n",[1107,1513,1514],{"class":1109,"line":1140},[1107,1515,1155],{},[1107,1517,1518],{"class":1109,"line":1146},[1107,1519,1161],{},[1080,1521,1523],{"id":1522},"step-3-count-the-spaces","Step 3: Count the Spaces",[1085,1525,1526,1527,1529],{},"Visiting every character exactly once, in order, is exactly what a ",[1089,1528,1091],{}," loop is for:",[1098,1531,1533],{"className":1100,"code":1532,"language":1102,"meta":1103,"style":1103},"int spaceCount = 0;\nfor (int i = 0; i \u003C rawName.length(); i++)\n{\n    if (rawName.substring(i, i + 1).equals(\" \"))\n    {\n        spaceCount++;\n    }\n}\n",[1089,1534,1535,1540,1545,1549,1554,1558,1563,1567],{"__ignoreMap":1103},[1107,1536,1537],{"class":1109,"line":1110},[1107,1538,1539],{},"int spaceCount = 0;\n",[1107,1541,1542],{"class":1109,"line":1116},[1107,1543,1544],{},"for (int i = 0; i \u003C rawName.length(); i++)\n",[1107,1546,1547],{"class":1109,"line":1122},[1107,1548,1131],{},[1107,1550,1551],{"class":1109,"line":1128},[1107,1552,1553],{},"    if (rawName.substring(i, i + 1).equals(\" \"))\n",[1107,1555,1556],{"class":1109,"line":1134},[1107,1557,1143],{},[1107,1559,1560],{"class":1109,"line":1140},[1107,1561,1562],{},"        spaceCount++;\n",[1107,1564,1565],{"class":1109,"line":1146},[1107,1566,1155],{},[1107,1568,1569],{"class":1109,"line":1152},[1107,1570,1161],{},[1085,1572,1573,1576,1577,1580,1581,1583],{},[1089,1574,1575],{},"substring(i, i + 1)"," pulls out the single character at index ",[1089,1578,1579],{},"i",". The loop starts at 0 and stops before ",[1089,1582,1095],{},", so every index from the first character to the last gets checked exactly once.",[1080,1585,1587],{"id":1586},"step-4-replace-every-space-with-an-underscore","Step 4: Replace Every Space with an Underscore",[1085,1589,1590,1591,1593,1594,1596],{},"There's no way to know in advance how many spaces the driver typed, so a ",[1089,1592,1170],{}," loop keeps going until ",[1089,1595,1178],{}," reports there are none left:",[1098,1598,1600],{"className":1100,"code":1599,"language":1102,"meta":1103,"style":1103},"String cleanedName = rawName;\nwhile (cleanedName.indexOf(\" \") >= 0)\n{\n    int i = cleanedName.indexOf(\" \");\n    String firstPart = cleanedName.substring(0, i);\n    String lastPart = cleanedName.substring(i + 1);\n    cleanedName = firstPart + \"_\" + lastPart;\n}\n",[1089,1601,1602,1607,1612,1616,1621,1626,1631,1636],{"__ignoreMap":1103},[1107,1603,1604],{"class":1109,"line":1110},[1107,1605,1606],{},"String cleanedName = rawName;\n",[1107,1608,1609],{"class":1109,"line":1116},[1107,1610,1611],{},"while (cleanedName.indexOf(\" \") >= 0)\n",[1107,1613,1614],{"class":1109,"line":1122},[1107,1615,1131],{},[1107,1617,1618],{"class":1109,"line":1128},[1107,1619,1620],{},"    int i = cleanedName.indexOf(\" \");\n",[1107,1622,1623],{"class":1109,"line":1134},[1107,1624,1625],{},"    String firstPart = cleanedName.substring(0, i);\n",[1107,1627,1628],{"class":1109,"line":1140},[1107,1629,1630],{},"    String lastPart = cleanedName.substring(i + 1);\n",[1107,1632,1633],{"class":1109,"line":1146},[1107,1634,1635],{},"    cleanedName = firstPart + \"_\" + lastPart;\n",[1107,1637,1638],{"class":1109,"line":1152},[1107,1639,1161],{},[1085,1641,1642,1643,1646,1647,1650,1651,1653,1654,1656],{},"Each pass reassigns ",[1089,1644,1645],{},"cleanedName",", so the next ",[1089,1648,1649],{},"indexOf(\" \")"," search runs against the already-partially-cleaned string and finds the ",[1255,1652,1257],{}," remaining space. Because ",[1089,1655,1451],{}," has two spaces back to back plus one more, this loop runs three times.",[1080,1658,1660],{"id":1659},"step-5-build-the-reversed-name","Step 5: Build the Reversed Name",[1085,1662,1663],{},"Building a new string means starting empty and concatenating inside a loop — strings can't be edited in place:",[1098,1665,1667],{"className":1100,"code":1666,"language":1102,"meta":1103,"style":1103},"String reversedName = \"\";\nfor (int i = 0; i \u003C cleanedName.length(); i++)\n{\n    String letter = cleanedName.substring(i, i + 1);\n    reversedName = letter + reversedName;\n}\n",[1089,1668,1669,1674,1679,1683,1688,1693],{"__ignoreMap":1103},[1107,1670,1671],{"class":1109,"line":1110},[1107,1672,1673],{},"String reversedName = \"\";\n",[1107,1675,1676],{"class":1109,"line":1116},[1107,1677,1678],{},"for (int i = 0; i \u003C cleanedName.length(); i++)\n",[1107,1680,1681],{"class":1109,"line":1122},[1107,1682,1131],{},[1107,1684,1685],{"class":1109,"line":1128},[1107,1686,1687],{},"    String letter = cleanedName.substring(i, i + 1);\n",[1107,1689,1690],{"class":1109,"line":1134},[1107,1691,1692],{},"    reversedName = letter + reversedName;\n",[1107,1694,1695],{"class":1109,"line":1140},[1107,1696,1161],{},[1085,1698,1699,1700,1703,1704,1707],{},"Prepending each letter (",[1089,1701,1702],{},"letter + reversedName",", not ",[1089,1705,1706],{},"reversedName + letter",") is what builds the string backwards.",[1080,1709,1711],{"id":1710},"step-6-print-and-verify","Step 6: Print and Verify",[1098,1713,1715],{"className":1100,"code":1714,"language":1102,"meta":1103,"style":1103},"System.out.println(\"Spaces found: \" + spaceCount);\nSystem.out.println(\"Cleaned name: \" + cleanedName);\nSystem.out.println(\"Reversed name: \" + reversedName);\n",[1089,1716,1717,1722,1727],{"__ignoreMap":1103},[1107,1718,1719],{"class":1109,"line":1110},[1107,1720,1721],{},"System.out.println(\"Spaces found: \" + spaceCount);\n",[1107,1723,1724],{"class":1109,"line":1116},[1107,1725,1726],{},"System.out.println(\"Cleaned name: \" + cleanedName);\n",[1107,1728,1729],{"class":1109,"line":1122},[1107,1730,1731],{},"System.out.println(\"Reversed name: \" + reversedName);\n",[1085,1733,1734],{},"Output:",[1098,1736,1741],{"className":1737,"code":1739,"language":1740},[1738],"language-text","Spaces found: 3\nCleaned name: Left__Start_Cone\nReversed name: enoC_tratS__tfeL\n","text",[1089,1742,1739],{"__ignoreMap":1103},[1080,1744,1746],{"id":1745},"what-starting-at-index-1-would-look-like","What Starting at Index 1 Would Look Like",[1085,1748,1749,1750,1355,1753,1756],{},"If Step 3's loop had started at ",[1089,1751,1752],{},"i = 1",[1089,1754,1755],{},"i = 0",", the first character would never be checked — a space in the very first position would be silently missed. The first character of any string is always at index 0.",[1080,1758,1760,1761,1763],{"id":1759},"what-would-look-like","What ",[1089,1762,1354],{}," Would Look Like",[1085,1765,1766,1767,1355,1770,1773,1774,1777,1778,1781,1782,1784],{},"If Step 3's condition had been written ",[1089,1768,1769],{},"i \u003C= rawName.length()",[1089,1771,1772],{},"i \u003C rawName.length()"," (or Step 5's ",[1089,1775,1776],{},"i \u003C= cleanedName.length()","), the last pass would call ",[1089,1779,1780],{},"substring(length(), length() + 1)"," — one index past the end — and throw a ",[1089,1783,1369],{}," instead of finishing.",[1080,1786,1788],{"id":1787},"recap","Recap",[1337,1790,1791,1796,1806],{},[1340,1792,1087,1793,1795],{},[1089,1794,1091],{}," loop fit counting the spaces, since every character needed exactly one check.",[1340,1797,1087,1798,1187,1800,1802,1803,1805],{},[1089,1799,1170],{},[1089,1801,1178],{}," fit replacing the spaces, since the number of matches wasn't known ahead of time — each pass reassigned ",[1089,1804,1645],{}," and searched again against the updated value.",[1340,1807,1808,1809,1811],{},"Building the reversed name started from an empty string and concatenated one character at a time inside a ",[1089,1810,1091],{}," loop, since strings can't be modified in place.",[1417,1813,1419],{},{"title":1103,"searchDepth":1116,"depth":1116,"links":1815},[1816,1817,1818,1820,1821,1822,1823,1824,1825,1827],{"id":1444,"depth":1116,"text":1445},{"id":1455,"depth":1116,"text":1456},{"id":1479,"depth":1116,"text":1819},"Step 2: Set Up the Class and main",{"id":1522,"depth":1116,"text":1523},{"id":1586,"depth":1116,"text":1587},{"id":1659,"depth":1116,"text":1660},{"id":1710,"depth":1116,"text":1711},{"id":1745,"depth":1116,"text":1746},{"id":1759,"depth":1116,"text":1826},"What \u003C= Would Look Like",{"id":1787,"depth":1116,"text":1788},{"outlineRef":1430,"pairsWith":1829,"status":1830},"[`lessons\u002Fch06-strings\u002F6.2-string-algorithms.md`](..\u002F..\u002Flessons\u002Fch06-strings\u002F6.2-string-algorithms.md)","new — authored worked example (fully solved, walked step by step — not a problem to attempt)",{"title":555,"description":1103},"X4qnm8VSJKdVDVJ02EvciHRw6sYV6VKFzmmhUnJXsJU",{"id":1834,"title":864,"body":1835,"description":1103,"extension":1428,"meta":2659,"navigation":1432,"path":863,"seo":2661,"stem":865,"__hash__":2662},"exercises\u002Fshockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F6.2-string-algorithms.md",{"type":1073,"value":1836,"toc":2654},[1837,1840,1844,1858,1896,1902,1907,1940,1946,1965,1982,1986,2013,2048,2051,2113,2118,2124,2210,2280,2284,2290,2321,2324,2350,2358,2363,2399,2404,2534,2539,2609,2652],[1076,1838,864],{"id":1839},"string-algorithms-exercises",[1080,1841,1843],{"id":1842},"multiple-choice","Multiple Choice",[1085,1845,1846,1849,1850,1853,1854,1857],{},[1343,1847,1848],{},"Question:"," A find-and-replace loop is meant to replace every ",[1089,1851,1852],{},"\"0\""," in a sensor code with ",[1089,1855,1856],{},"\"00\""," (doubling each zero):",[1098,1859,1861],{"className":1100,"code":1860,"language":1102,"meta":1103,"style":1103},"while (code.indexOf(\"0\") >= 0)\n{\n    int i = code.indexOf(\"0\");\n    String firstPart = code.substring(0, i);\n    String lastPart = code.substring(i + 1);\n    code = firstPart + \"00\" + lastPart;\n}\n",[1089,1862,1863,1868,1872,1877,1882,1887,1892],{"__ignoreMap":1103},[1107,1864,1865],{"class":1109,"line":1110},[1107,1866,1867],{},"while (code.indexOf(\"0\") >= 0)\n",[1107,1869,1870],{"class":1109,"line":1116},[1107,1871,1131],{},[1107,1873,1874],{"class":1109,"line":1122},[1107,1875,1876],{},"    int i = code.indexOf(\"0\");\n",[1107,1878,1879],{"class":1109,"line":1128},[1107,1880,1881],{},"    String firstPart = code.substring(0, i);\n",[1107,1883,1884],{"class":1109,"line":1134},[1107,1885,1886],{},"    String lastPart = code.substring(i + 1);\n",[1107,1888,1889],{"class":1109,"line":1140},[1107,1890,1891],{},"    code = firstPart + \"00\" + lastPart;\n",[1107,1893,1894],{"class":1109,"line":1146},[1107,1895,1161],{},[1085,1897,1898,1899,1901],{},"What happens when this runs on a code that contains at least one ",[1089,1900,1852],{},"?",[1085,1903,1904],{},[1343,1905,1906],{},"Options:",[1337,1908,1909,1922,1931,1937],{},[1340,1910,1911,1912,1914,1915,1917,1918,1921],{},"A. It loops forever — the replacement text ",[1089,1913,1856],{}," still contains a ",[1089,1916,1852],{},", so ",[1089,1919,1920],{},"indexOf(\"0\")"," keeps finding one",[1340,1923,1924,1925,1927,1928,1930],{},"B. It replaces every zero with ",[1089,1926,1856],{}," once each, then stops, because ",[1089,1929,1178],{}," only searches the original text",[1340,1932,1933,1934,1936],{},"C. It throws a ",[1089,1935,1369],{}," once all the zeros are gone",[1340,1938,1939],{},"D. It replaces only the first zero and leaves the rest of the string unchanged",[1085,1941,1942,1945],{},[1343,1943,1944],{},"Answer:"," A",[1085,1947,1948,1951,1952,1954,1955,1958,1959,1961,1962,1964],{},[1343,1949,1950],{},"Why:"," Each pass searches ",[1089,1953,1089],{},"'s ",[1255,1956,1957],{},"current"," value, which was just reassigned at the end of the previous pass. Since the replacement text (",[1089,1960,1856],{},") still contains the character being searched for, ",[1089,1963,1920],{}," finds a match again on the very next pass — forever. A find-and-replace loop only terminates when each pass genuinely reduces the number of matches left to find.",[1337,1966,1967,1976,1979],{},[1340,1968,1969,1970,1972,1973,1975],{},"B is wrong — ",[1089,1971,1178],{}," always searches whatever ",[1089,1974,1089],{}," currently holds, not the original string; it has no memory of what's already been replaced.",[1340,1977,1978],{},"C is wrong — nothing in this loop reads past the end of the string; it just never satisfies its exit condition, so it never gets the chance to throw.",[1340,1980,1981],{},"D is wrong — the loop keeps running (and keeps matching) instead of stopping after a single replacement.",[1080,1983,1985],{"id":1984},"micro-parsons","Micro-Parsons",[1085,1987,1988,1991,1992,1995,1996,1999,2000,2003,2004,2006,2007,2009,2010,2012],{},[1343,1989,1990],{},"Problem:"," A limit switch's status is packed into a string of ",[1089,1993,1994],{},"1","s and ",[1089,1997,1998],{},"0","s, e.g. ",[1089,2001,2002],{},"\"10110\"",", where ",[1089,2005,1994],{}," means the switch is triggered. The class and ",[1089,2008,1483],{}," method below are already set up — reorder only the fragments that go inside ",[1089,2011,1483],{}," so the program counts and prints how many switches are triggered.",[1098,2014,2016],{"className":1100,"code":2015,"language":1102,"meta":1103,"style":1103},"public class SwitchStatus\n{\n    public static void main(String[] args)\n    {\n        \u002F\u002F fragments go here\n    }\n}\n",[1089,2017,2018,2023,2027,2031,2035,2040,2044],{"__ignoreMap":1103},[1107,2019,2020],{"class":1109,"line":1110},[1107,2021,2022],{},"public class SwitchStatus\n",[1107,2024,2025],{"class":1109,"line":1116},[1107,2026,1131],{},[1107,2028,2029],{"class":1109,"line":1122},[1107,2030,1502],{},[1107,2032,2033],{"class":1109,"line":1128},[1107,2034,1143],{},[1107,2036,2037],{"class":1109,"line":1134},[1107,2038,2039],{},"        \u002F\u002F fragments go here\n",[1107,2041,2042],{"class":1109,"line":1140},[1107,2043,1155],{},[1107,2045,2046],{"class":1109,"line":1146},[1107,2047,1161],{},[1085,2049,2050],{},"Reorder the fragments below:",[1337,2052,2053,2059,2065,2071,2077,2083,2089,2095,2101,2107],{},[1340,2054,2055,2056],{},"a. ",[1089,2057,2058],{},"            }",[1340,2060,2061,2062],{},"b. ",[1089,2063,2064],{},"        String status = \"10110\";",[1340,2066,2067,2068],{},"c. ",[1089,2069,2070],{},"                triggeredCount++;",[1340,2072,2073,2074],{},"d. ",[1089,2075,2076],{},"        for (int i = 0; i \u003C status.length(); i++)",[1340,2078,2079,2080],{},"e. ",[1089,2081,2082],{},"        }",[1340,2084,2085,2086],{},"f. ",[1089,2087,2088],{},"            if (status.substring(i, i + 1).equals(\"1\"))",[1340,2090,2091,2092],{},"g. ",[1089,2093,2094],{},"        {",[1340,2096,2097,2098],{},"h. ",[1089,2099,2100],{},"        System.out.println(\"Triggered: \" + triggeredCount);",[1340,2102,2103,2104],{},"i. ",[1089,2105,2106],{},"            {",[1340,2108,2109,2110],{},"j. ",[1089,2111,2112],{},"        int triggeredCount = 0;",[1085,2114,2115,2117],{},[1343,2116,1944],{}," b, j, d, g, f, i, c, a, e, h",[1085,2119,2120,2123],{},[1343,2121,2122],{},"Interchangeable:"," (b, j)",[1098,2125,2127],{"className":1100,"code":2126,"language":1102,"meta":1103,"style":1103},"public class SwitchStatus\n{\n    public static void main(String[] args)\n    {\n        String status = \"10110\";\n        int triggeredCount = 0;\n        for (int i = 0; i \u003C status.length(); i++)\n        {\n            if (status.substring(i, i + 1).equals(\"1\"))\n            {\n                triggeredCount++;\n            }\n        }\n        System.out.println(\"Triggered: \" + triggeredCount);\n    }\n}\n",[1089,2128,2129,2133,2137,2141,2145,2150,2155,2160,2165,2170,2176,2182,2188,2194,2200,2205],{"__ignoreMap":1103},[1107,2130,2131],{"class":1109,"line":1110},[1107,2132,2022],{},[1107,2134,2135],{"class":1109,"line":1116},[1107,2136,1131],{},[1107,2138,2139],{"class":1109,"line":1122},[1107,2140,1502],{},[1107,2142,2143],{"class":1109,"line":1128},[1107,2144,1143],{},[1107,2146,2147],{"class":1109,"line":1134},[1107,2148,2149],{},"        String status = \"10110\";\n",[1107,2151,2152],{"class":1109,"line":1140},[1107,2153,2154],{},"        int triggeredCount = 0;\n",[1107,2156,2157],{"class":1109,"line":1146},[1107,2158,2159],{},"        for (int i = 0; i \u003C status.length(); i++)\n",[1107,2161,2162],{"class":1109,"line":1152},[1107,2163,2164],{},"        {\n",[1107,2166,2167],{"class":1109,"line":1158},[1107,2168,2169],{},"            if (status.substring(i, i + 1).equals(\"1\"))\n",[1107,2171,2173],{"class":1109,"line":2172},10,[1107,2174,2175],{},"            {\n",[1107,2177,2179],{"class":1109,"line":2178},11,[1107,2180,2181],{},"                triggeredCount++;\n",[1107,2183,2185],{"class":1109,"line":2184},12,[1107,2186,2187],{},"            }\n",[1107,2189,2191],{"class":1109,"line":2190},13,[1107,2192,2193],{},"        }\n",[1107,2195,2197],{"class":1109,"line":2196},14,[1107,2198,2199],{},"        System.out.println(\"Triggered: \" + triggeredCount);\n",[1107,2201,2203],{"class":1109,"line":2202},15,[1107,2204,1155],{},[1107,2206,2208],{"class":1109,"line":2207},16,[1107,2209,1161],{},[1085,2211,2212,1362,2215,2218,2219,2222,2223,2218,2226,2229,2230,2232,2233,2236,2237,2240,2241,2232,2244,2236,2247,2249,2250,2218,2253,2256,2257,2259,2260,2262,2263,2266,2267,2262,2269,2272,2273,2218,2276,2279],{},[1343,2213,2214],{},"Why this order:",[1089,2216,2217],{},"status"," (",[1089,2220,2221],{},"b",") and ",[1089,2224,2225],{},"triggeredCount",[1089,2227,2228],{},"j",") are declared before the loop, in either order — neither declaration reads the other's value, so swapping them changes nothing. The ",[1089,2231,1091],{}," header (",[1089,2234,2235],{},"d",") and its opening brace (",[1089,2238,2239],{},"g",") start the scan; inside it, the ",[1089,2242,2243],{},"if",[1089,2245,2246],{},"f",[1089,2248,1579],{},") test one character at a time, with ",[1089,2251,2252],{},"triggeredCount++",[1089,2254,2255],{},"c",") inside the ",[1089,2258,2243],{},"'s own braces. The ",[1089,2261,2243],{}," closes (",[1089,2264,2265],{},"a",") before the ",[1089,2268,1091],{},[1089,2270,2271],{},"e",") — braces have to close from the inside out. Only after the loop finishes does ",[1089,2274,2275],{},"println",[1089,2277,2278],{},"h",") run, since it needs the final count, not a partial one.",[1080,2281,2283],{"id":2282},"coding","Coding",[1085,2285,2286,2289],{},[1343,2287,2288],{},"Mode:"," harness",[1085,2291,2292,2294,2295,2298,2299,1362,2301,2304,2305,2307,2308,2311,2312,2315,2316,2318,2319,1262],{},[1343,2293,1990],{}," Write ",[1089,2296,2297],{},"countLetter",", which returns how many times the one-character ",[1089,2300,1326],{},[1089,2302,2303],{},"letter"," appears in\n",[1089,2306,1740],{},". The comparison is case-sensitive, so ",[1089,2309,2310],{},"\"L\""," does not match ",[1089,2313,2314],{},"\"l\"",". ",[1089,2317,1740],{}," may be empty, in which case\nthe answer is ",[1089,2320,1998],{},[1085,2322,2323],{},"Examples:",[1337,2325,2326,2335,2342],{},[1340,2327,2328,2331,2332],{},[1089,2329,2330],{},"countLetter(\"BlueAlliance-Left\", \"l\")"," returns ",[1089,2333,2334],{},"3",[1340,2336,2337,2331,2340],{},[1089,2338,2339],{},"countLetter(\"Red\", \"x\")",[1089,2341,1998],{},[1340,2343,2344,2331,2347],{},[1089,2345,2346],{},"countLetter(\"Left-Lift\", \"L\")",[1089,2348,2349],{},"2",[1085,2351,2352,1362,2355],{},[1343,2353,2354],{},"Signature:",[1089,2356,2357],{},"public static int countLetter(String text, String letter)",[1085,2359,2360],{},[1343,2361,2362],{},"Starter:",[1098,2364,2366],{"className":1100,"code":2365,"language":1102,"meta":1103,"style":1103},"public class Solution\n{\n    public static int countLetter(String text, String letter)\n    {\n        \u002F\u002F TODO: scan every character of text and count the matches\n    }\n}\n",[1089,2367,2368,2373,2377,2382,2386,2391,2395],{"__ignoreMap":1103},[1107,2369,2370],{"class":1109,"line":1110},[1107,2371,2372],{},"public class Solution\n",[1107,2374,2375],{"class":1109,"line":1116},[1107,2376,1131],{},[1107,2378,2379],{"class":1109,"line":1122},[1107,2380,2381],{},"    public static int countLetter(String text, String letter)\n",[1107,2383,2384],{"class":1109,"line":1128},[1107,2385,1143],{},[1107,2387,2388],{"class":1109,"line":1134},[1107,2389,2390],{},"        \u002F\u002F TODO: scan every character of text and count the matches\n",[1107,2392,2393],{"class":1109,"line":1140},[1107,2394,1155],{},[1107,2396,2397],{"class":1109,"line":1146},[1107,2398,1161],{},[1085,2400,2401],{},[1343,2402,2403],{},"Tests:",[2405,2406,2407,2423],"table",{},[2408,2409,2410],"thead",{},[2411,2412,2413,2417,2420],"tr",{},[2414,2415,2416],"th",{},"Visible",[2414,2418,2419],{},"Arguments",[2414,2421,2422],{},"Expected",[2424,2425,2426,2441,2454,2467,2481,2494,2507,2520],"tbody",{},[2411,2427,2428,2432,2437],{},[2429,2430,2431],"td",{},"yes",[2429,2433,2434],{},[1089,2435,2436],{},"\"BlueAlliance-Left\", \"l\"",[2429,2438,2439],{},[1089,2440,2334],{},[2411,2442,2443,2445,2450],{},[2429,2444,2431],{},[2429,2446,2447],{},[1089,2448,2449],{},"\"Red\", \"x\"",[2429,2451,2452],{},[1089,2453,1998],{},[2411,2455,2456,2458,2463],{},[2429,2457,2431],{},[2429,2459,2460],{},[1089,2461,2462],{},"\"Left-Lift\", \"L\"",[2429,2464,2465],{},[1089,2466,2349],{},[2411,2468,2469,2472,2477],{},[2429,2470,2471],{},"no",[2429,2473,2474],{},[1089,2475,2476],{},"\"aXXa\", \"a\"",[2429,2478,2479],{},[1089,2480,2349],{},[2411,2482,2483,2485,2490],{},[2429,2484,2471],{},[2429,2486,2487],{},[1089,2488,2489],{},"\"\", \"a\"",[2429,2491,2492],{},[1089,2493,1998],{},[2411,2495,2496,2498,2503],{},[2429,2497,2471],{},[2429,2499,2500],{},[1089,2501,2502],{},"\"Titan\", \"T\"",[2429,2504,2505],{},[1089,2506,1994],{},[2411,2508,2509,2511,2516],{},[2429,2510,2471],{},[2429,2512,2513],{},[1089,2514,2515],{},"\"Titan\", \"n\"",[2429,2517,2518],{},[1089,2519,1994],{},[2411,2521,2522,2524,2529],{},[2429,2523,2471],{},[2429,2525,2526],{},[1089,2527,2528],{},"\"aaaa\", \"a\"",[2429,2530,2531],{},[1089,2532,2533],{},"4",[1085,2535,2536],{},[1343,2537,2538],{},"Solution:",[1098,2540,2542],{"className":1100,"code":2541,"language":1102,"meta":1103,"style":1103},"public class Solution\n{\n    public static int countLetter(String text, String letter)\n    {\n        int count = 0;\n        for (int i = 0; i \u003C text.length(); i++)\n        {\n            if (text.substring(i, i + 1).equals(letter))\n            {\n                count++;\n            }\n        }\n        return count;\n    }\n}\n",[1089,2543,2544,2548,2552,2556,2560,2565,2570,2574,2579,2583,2588,2592,2596,2601,2605],{"__ignoreMap":1103},[1107,2545,2546],{"class":1109,"line":1110},[1107,2547,2372],{},[1107,2549,2550],{"class":1109,"line":1116},[1107,2551,1131],{},[1107,2553,2554],{"class":1109,"line":1122},[1107,2555,2381],{},[1107,2557,2558],{"class":1109,"line":1128},[1107,2559,1143],{},[1107,2561,2562],{"class":1109,"line":1134},[1107,2563,2564],{},"        int count = 0;\n",[1107,2566,2567],{"class":1109,"line":1140},[1107,2568,2569],{},"        for (int i = 0; i \u003C text.length(); i++)\n",[1107,2571,2572],{"class":1109,"line":1146},[1107,2573,2164],{},[1107,2575,2576],{"class":1109,"line":1152},[1107,2577,2578],{},"            if (text.substring(i, i + 1).equals(letter))\n",[1107,2580,2581],{"class":1109,"line":1158},[1107,2582,2175],{},[1107,2584,2585],{"class":1109,"line":2172},[1107,2586,2587],{},"                count++;\n",[1107,2589,2590],{"class":1109,"line":2178},[1107,2591,2187],{},[1107,2593,2594],{"class":1109,"line":2184},[1107,2595,2193],{},[1107,2597,2598],{"class":1109,"line":2190},[1107,2599,2600],{},"        return count;\n",[1107,2602,2603],{"class":1109,"line":2196},[1107,2604,1155],{},[1107,2606,2607],{"class":1109,"line":2202},[1107,2608,1161],{},[1085,2610,2611,2613,2614,2616,2617,2619,2620,2622,2623,2625,2626,2629,2630,2633,2634,2636,2637,2639,2640,2642,2643,2645,2646,1703,2649,1262],{},[1343,2612,1950],{}," A ",[1089,2615,1091],{}," loop from ",[1089,2618,1998],{}," up to (but not including) ",[1089,2621,1095],{}," visits every character once. Starting at ",[1089,2624,1994],{},"\nskips the first character, so ",[1089,2627,2628],{},"\"Titan\""," with ",[1089,2631,2632],{},"\"T\""," would give ",[1089,2635,1998],{},". Using ",[1089,2638,1354],{}," reads one index past the end and\nthrows ",[1089,2641,1369],{},". Each one-character piece is a ",[1089,2644,1326],{},", so it is compared with\n",[1089,2647,2648],{},".equals()",[1089,2650,2651],{},"==",[1417,2653,1419],{},{"title":1103,"searchDepth":1116,"depth":1116,"links":2655},[2656,2657,2658],{"id":1842,"depth":1116,"text":1843},{"id":1984,"depth":1116,"text":1985},{"id":2282,"depth":1116,"text":2283},{"outlineRef":1430,"pairsWith":1829,"status":2660},"new — authored exercises (Multiple Choice + Micro-Parsons + Coding)",{"title":864,"description":1103},"c-vHeC_1A3Liej3Hb59iMjvibXKCjzgaO39kghbaVKs",1792718164821]