[{"data":1,"prerenderedAt":1939},["ShallowReactive",2],{"item-lessons-light-ch06-strings":3,"item-examples-light-ch06-strings":436,"item-exercises-light-ch06-strings":597,"item-lesson-full-ch06-strings-6.2":758,"item-example-full-ch06-strings-6.2":1081,"item-exercise-full-ch06-strings-6.2":1475},[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],{"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 & 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\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":85,"title":86,"stem":87},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F4-boolean-expressions","Boolean Expressions","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.4-boolean-expressions",{"path":89,"title":90,"stem":91},"\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":93,"title":94,"stem":95},"\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":97,"title":98,"stem":99},"\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":101,"title":102,"stem":103},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F8-while-loops","While Loops","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.8-while-loops",{"path":105,"title":106,"stem":107},"\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":109,"title":110,"stem":111},"\u002Fshockwave-curriculum\u002Flessons\u002Fch06-strings\u002F1-strings","Strings","shockwave-curriculum\u002Flessons\u002Fch06-strings\u002F6.1-strings",{"path":113,"title":114,"stem":115},"\u002Fshockwave-curriculum\u002Flessons\u002Fch06-strings\u002F2-string-algorithms","String Algorithms","shockwave-curriculum\u002Flessons\u002Fch06-strings\u002F6.2-string-algorithms",{"path":117,"title":118,"stem":119},"\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":121,"title":122,"stem":123},"\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":125,"title":126,"stem":127},"\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":129,"title":130,"stem":131},"\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":133,"title":134,"stem":135},"\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":137,"title":138,"stem":139},"\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":141,"title":142,"stem":143},"\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":145,"title":146,"stem":147},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F3-optional-hashmap-dictionary-data-structure","Optional: HashMap (Dictionary) Data Structure","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.3-optional-hashmap-dictionary-data-structure",{"path":149,"title":150,"stem":151},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F4-array-traversals","Array Traversals","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.4-array-traversals",{"path":153,"title":154,"stem":155},"\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":157,"title":158,"stem":159},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F6-arraylist-traversals","ArrayList Traversals","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.6-arraylist-traversals",{"path":161,"title":162,"stem":163},"\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":165,"title":166,"stem":167},"\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":169,"title":170,"stem":171},"\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":173,"title":174,"stem":175},"\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":177,"title":178,"stem":179},"\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":181,"title":182,"stem":183},"\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":185,"title":186,"stem":187},"\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":189,"title":190,"stem":191},"\u002Fshockwave-curriculum\u002Flessons\u002Fch13-common-gotchas\u002F13-common-gotchas","Common Gotchas","shockwave-curriculum\u002Flessons\u002Fch13-common-gotchas\u002F13-common-gotchas",{"path":193,"title":194,"stem":195},"\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":197,"title":198,"stem":199},"\u002Fshockwave-curriculum\u002Flessons\u002Fch15-advanced-collections\u002F15-advanced-collections","Advanced Collections (Set\u002FQueue\u002FMap)","shockwave-curriculum\u002Flessons\u002Fch15-advanced-collections\u002F15-advanced-collections",{"path":201,"title":202,"stem":203},"\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":205,"title":206,"stem":207},"\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":209,"title":210,"stem":211},"\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":213,"title":214,"stem":215},"\u002Fshockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F3-inheritance-hierarchies","Inheritance Hierarchies","shockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F17.3-inheritance-hierarchies",{"path":217,"title":218,"stem":219},"\u002Fshockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F4-object-superclass","Object Superclass","shockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F17.4-object-superclass",{"path":221,"title":222,"stem":223},"\u002Fshockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F1-overriding-methods","Overriding Methods","shockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F18.1-overriding-methods",{"path":225,"title":226,"stem":227},"\u002Fshockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F2-super-keyword","super Keyword","shockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F18.2-super-keyword",{"path":229,"title":230,"stem":231},"\u002Fshockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F3-polymorphism","Polymorphism","shockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F18.3-polymorphism",{"path":233,"title":234,"stem":235},"\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":237,"title":238,"stem":239},"\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":241,"title":242,"stem":243},"\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":245,"title":246,"stem":247},"\u002Fshockwave-curriculum\u002Flessons\u002Fch21-static-factories\u002F21-static-factories","Static Factories","shockwave-curriculum\u002Flessons\u002Fch21-static-factories\u002F21-static-factories",{"path":249,"title":250,"stem":251},"\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":253,"title":254,"stem":255},"\u002Fshockwave-curriculum\u002Flessons\u002Fch23-encapsulation-and-final\u002F1-scope-and-access","Scope and Access","shockwave-curriculum\u002Flessons\u002Fch23-encapsulation-and-final\u002F23.1-scope-and-access",{"path":257,"title":258,"stem":259},"\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":261,"title":262,"stem":263},"\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":265,"title":266,"stem":267},"\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":269,"title":270,"stem":271},"\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":273,"title":274,"stem":275},"\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":277,"title":278,"stem":279},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F5-managing-transitions","Managing Transitions","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.5-managing-transitions",{"path":281,"title":282,"stem":283},"\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":285,"title":286,"stem":287},"\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":289,"title":290,"stem":291},"\u002Fshockwave-curriculum\u002Flessons\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways","Architecture Takeaways","shockwave-curriculum\u002Flessons\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways",{"path":293,"title":294,"stem":295},"\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":297,"title":298,"stem":299},"\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":301,"title":302,"stem":303},"\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":305,"title":306,"stem":307},"\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":309,"title":310,"stem":311},"\u002Fshockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F3-recursion","Recursion","shockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F28.3-recursion",{"path":313,"title":314,"stem":315},"\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":317,"title":318,"stem":319},"\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":321,"title":322,"stem":323},"\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":325,"title":326,"stem":327},"\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":329,"title":330,"stem":331},"\u002Fshockwave-curriculum\u002Flessons\u002Fch32-unit-testing\u002F1-coming-soon","Unit Testing — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch32-unit-testing\u002F32.1-coming-soon",{"path":333,"title":334,"stem":335},"\u002Fshockwave-curriculum\u002Flessons\u002Fch33-advantagekit-autologging\u002F1-coming-soon","AdvantageKit — AutoLogging — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch33-advantagekit-autologging\u002F33.1-coming-soon",{"path":337,"title":338,"stem":339},"\u002Fshockwave-curriculum\u002Flessons\u002Fch34-log-replay\u002F1-coming-soon","Log Replay — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch34-log-replay\u002F34.1-coming-soon",{"path":341,"title":342,"stem":343},"\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":345,"title":346,"stem":347},"\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":349,"title":350,"stem":351},"\u002Fshockwave-curriculum\u002Flessons\u002Fch37-autonomous-i\u002F1-coming-soon","Autonomous I — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch37-autonomous-i\u002F37.1-coming-soon",{"path":353,"title":354,"stem":355},"\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":357,"title":358,"stem":359},"\u002Fshockwave-curriculum\u002Flessons\u002Fch39-control-fundamentals\u002F1-coming-soon","Control Fundamentals — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch39-control-fundamentals\u002F39.1-coming-soon",{"path":361,"title":362,"stem":363},"\u002Fshockwave-curriculum\u002Flessons\u002Fch40-motion-profiles\u002F1-coming-soon","Motion Profiles — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch40-motion-profiles\u002F40.1-coming-soon",{"path":365,"title":366,"stem":367},"\u002Fshockwave-curriculum\u002Flessons\u002Fch41-hardware-fundamentals\u002F1-coming-soon","Hardware Fundamentals — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch41-hardware-fundamentals\u002F41.1-coming-soon",{"path":369,"title":370,"stem":371},"\u002Fshockwave-curriculum\u002Flessons\u002Fch42-photonvision\u002F1-coming-soon","PhotonVision — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch42-photonvision\u002F42.1-coming-soon",{"path":373,"title":374,"stem":375},"\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":377,"title":378,"stem":379},"\u002Fshockwave-curriculum\u002Flessons\u002Fch44-subsystems-i\u002F1-coming-soon","Subsystems I — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch44-subsystems-i\u002F44.1-coming-soon",{"path":381,"title":382,"stem":383},"\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":385,"title":386,"stem":387},"\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":389,"title":390,"stem":391},"\u002Fshockwave-curriculum\u002Flessons\u002Fch47-field-constants\u002F1-coming-soon","Field Constants — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch47-field-constants\u002F47.1-coming-soon",{"path":393,"title":394,"stem":395},"\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":397,"title":398,"stem":399},"\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":401,"title":402,"stem":403},"\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":405,"title":406,"stem":407},"\u002Fshockwave-curriculum\u002Flessons\u002Fch51-robot-alerts\u002F1-coming-soon","Robot Alerts — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch51-robot-alerts\u002F51.1-coming-soon",{"path":409,"title":410,"stem":411},"\u002Fshockwave-curriculum\u002Flessons\u002Fch52-wpilib-commands\u002F1-coming-soon","WPILib Commands — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch52-wpilib-commands\u002F52.1-coming-soon",{"path":413,"title":414,"stem":415},"\u002Fshockwave-curriculum\u002Flessons\u002Fch53-wpilib-geometry\u002F1-coming-soon","WPILib Geometry — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch53-wpilib-geometry\u002F53.1-coming-soon",{"path":417,"title":418,"stem":419},"\u002Fshockwave-curriculum\u002Flessons\u002Fch54-networktables\u002F1-coming-soon","NetworkTables — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch54-networktables\u002F54.1-coming-soon",{"path":421,"title":422,"stem":423},"\u002Fshockwave-curriculum\u002Flessons\u002Fch55-command-scheduler\u002F1-coming-soon","Command Scheduler — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch55-command-scheduler\u002F55.1-coming-soon",{"path":425,"title":426,"stem":427},"\u002Fshockwave-curriculum\u002Flessons\u002Fch56-wpilib-timers\u002F1-coming-soon","WPILib Timers — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch56-wpilib-timers\u002F56.1-coming-soon",{"path":429,"title":430,"stem":431},"\u002Fshockwave-curriculum\u002Flessons\u002Fch57-wpilib-triggers\u002F1-coming-soon","WPILib Triggers — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch57-wpilib-triggers\u002F57.1-coming-soon",{"path":433,"title":434,"stem":435},"\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",[437,441,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],{"path":438,"title":439,"stem":440},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch01-why-java-for-frc\u002F2-intro-to-algorithms-programming-and-compilers","Intro to Algorithms, Programming & Compilers — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch01-why-java-for-frc\u002F1.2-intro-to-algorithms-programming-and-compilers",{"path":442,"title":443,"stem":444},"\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":446,"title":447,"stem":448},"\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":450,"title":451,"stem":452},"\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":454,"title":455,"stem":456},"\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":458,"title":459,"stem":460},"\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":462,"title":463,"stem":464},"\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":466,"title":467,"stem":468},"\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":470,"title":471,"stem":472},"\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":474,"title":475,"stem":476},"\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":478,"title":479,"stem":480},"\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":482,"title":483,"stem":484},"\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":486,"title":487,"stem":488},"\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":490,"title":491,"stem":492},"\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":494,"title":495,"stem":496},"\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":498,"title":499,"stem":500},"\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":502,"title":503,"stem":504},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F10-nested-iteration","Nested Iteration — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.10-nested-iteration",{"path":506,"title":507,"stem":508},"\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":510,"title":511,"stem":512},"\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":514,"title":515,"stem":516},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F4-boolean-expressions","Boolean Expressions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.4-boolean-expressions",{"path":518,"title":519,"stem":520},"\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":522,"title":523,"stem":524},"\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":526,"title":527,"stem":528},"\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":530,"title":531,"stem":532},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F8-while-loops","While Loops — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.8-while-loops",{"path":534,"title":535,"stem":536},"\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":538,"title":539,"stem":540},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F1-strings","Strings — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F6.1-strings",{"path":542,"title":543,"stem":544},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F2-string-algorithms","String Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F6.2-string-algorithms",{"path":546,"title":547,"stem":548},"\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":550,"title":551,"stem":552},"\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":554,"title":555,"stem":556},"\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":558,"title":559,"stem":560},"\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":562,"title":563,"stem":564},"\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":566,"title":567,"stem":568},"\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":570,"title":571,"stem":572},"\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":574,"title":575,"stem":576},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F3-optional-hashmap-dictionary-data-structure","Optional: HashMap (Dictionary) Data Structure — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.3-optional-hashmap-dictionary-data-structure",{"path":578,"title":579,"stem":580},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F4-array-traversals","Array Traversals — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.4-array-traversals",{"path":582,"title":583,"stem":584},"\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":586,"title":587,"stem":588},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F6-arraylist-traversals","ArrayList Traversals — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.6-arraylist-traversals",{"path":590,"title":591,"stem":592},"\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":594,"title":595,"stem":596},"\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",[598,602,606,610,614,618,622,626,630,634,638,642,646,650,654,658,662,666,670,674,678,682,686,690,694,698,702,706,710,714,718,722,726,730,734,738,742,746,750,754],{"path":599,"title":600,"stem":601},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch01-why-java-for-frc\u002F2-intro-to-algorithms-programming-and-compilers","Intro to Algorithms, Programming & Compilers — Exercises","shockwave-curriculum\u002Fexercises\u002Fch01-why-java-for-frc\u002F1.2-intro-to-algorithms-programming-and-compilers",{"path":603,"title":604,"stem":605},"\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":607,"title":608,"stem":609},"\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":611,"title":612,"stem":613},"\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":615,"title":616,"stem":617},"\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":619,"title":620,"stem":621},"\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":623,"title":624,"stem":625},"\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":627,"title":628,"stem":629},"\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":631,"title":632,"stem":633},"\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":635,"title":636,"stem":637},"\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":639,"title":640,"stem":641},"\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":643,"title":644,"stem":645},"\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":647,"title":648,"stem":649},"\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":651,"title":652,"stem":653},"\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":655,"title":656,"stem":657},"\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":659,"title":660,"stem":661},"\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":663,"title":664,"stem":665},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F10-nested-iteration","Nested Iteration — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.10-nested-iteration",{"path":667,"title":668,"stem":669},"\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":671,"title":672,"stem":673},"\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":675,"title":676,"stem":677},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F4-boolean-expressions","Boolean Expressions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.4-boolean-expressions",{"path":679,"title":680,"stem":681},"\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":683,"title":684,"stem":685},"\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":687,"title":688,"stem":689},"\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":691,"title":692,"stem":693},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F8-while-loops","While Loops — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.8-while-loops",{"path":695,"title":696,"stem":697},"\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":699,"title":700,"stem":701},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F1-strings","Strings — Exercises","shockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F6.1-strings",{"path":703,"title":704,"stem":705},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F2-string-algorithms","String Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F6.2-string-algorithms",{"path":707,"title":708,"stem":709},"\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":711,"title":712,"stem":713},"\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":715,"title":716,"stem":717},"\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":719,"title":720,"stem":721},"\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":723,"title":724,"stem":725},"\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":727,"title":728,"stem":729},"\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":731,"title":732,"stem":733},"\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":735,"title":736,"stem":737},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F3-optional-hashmap-dictionary-data-structure","Optional: HashMap (Dictionary) Data Structure — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.3-optional-hashmap-dictionary-data-structure",{"path":739,"title":740,"stem":741},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F4-array-traversals","Array Traversals — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.4-array-traversals",{"path":743,"title":744,"stem":745},"\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":747,"title":748,"stem":749},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F6-arraylist-traversals","ArrayList Traversals — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.6-arraylist-traversals",{"path":751,"title":752,"stem":753},"\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":755,"title":756,"stem":757},"\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",{"id":759,"title":114,"body":760,"description":791,"extension":1074,"meta":1075,"navigation":1078,"path":113,"seo":1079,"stem":115,"__hash__":1080},"lessons\u002Fshockwave-curriculum\u002Flessons\u002Fch06-strings\u002F6.2-string-algorithms.md",{"type":761,"value":762,"toc":1066},"minimark",[763,767,772,785,850,860,871,879,927,939,943,946,978,982,1025,1029,1051,1062],[764,765,114],"h1",{"id":766},"string-algorithms",[768,769,771],"h2",{"id":770},"scanning-a-string-character-by-character","Scanning a String Character by Character",[773,774,775,776,780,781,784],"p",{},"A ",[777,778,779],"code",{},"for"," loop is the standard way to visit every character of a string — start at 0, stop before ",[777,782,783],{},"length()",":",[786,787,792],"pre",{"className":788,"code":789,"language":790,"meta":791,"style":791},"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","",[777,793,794,802,808,814,820,826,832,838,844],{"__ignoreMap":791},[795,796,799],"span",{"class":797,"line":798},"line",1,[795,800,801],{},"String autoName = \"BlueAlliance-Left\";\n",[795,803,805],{"class":797,"line":804},2,[795,806,807],{},"int dashCount = 0;\n",[795,809,811],{"class":797,"line":810},3,[795,812,813],{},"for (int i = 0; i \u003C autoName.length(); i++)\n",[795,815,817],{"class":797,"line":816},4,[795,818,819],{},"{\n",[795,821,823],{"class":797,"line":822},5,[795,824,825],{},"    if (autoName.substring(i, i + 1).equals(\"-\"))\n",[795,827,829],{"class":797,"line":828},6,[795,830,831],{},"    {\n",[795,833,835],{"class":797,"line":834},7,[795,836,837],{},"        dashCount++;\n",[795,839,841],{"class":797,"line":840},8,[795,842,843],{},"    }\n",[795,845,847],{"class":797,"line":846},9,[795,848,849],{},"}\n",[773,851,852,853,855,856,859],{},"Use a ",[777,854,779],{}," loop when you know you want to check every character. Use a ",[777,857,858],{},"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.",[768,861,863,864,867,868],{"id":862},"find-and-replace-with-indexof-substring","Find and Replace with ",[777,865,866],{},"indexOf"," + ",[777,869,870],{},"substring",[773,872,775,873,875,876,878],{},[777,874,858],{}," loop paired with ",[777,877,866],{}," repeatedly finds and processes one match at a time, until none remain:",[786,880,882],{"className":788,"code":881,"language":790,"meta":791,"style":791},"String name = \"Alli1ance\";\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",[777,883,884,889,894,899,903,908,913,918,923],{"__ignoreMap":791},[795,885,886],{"class":797,"line":798},[795,887,888],{},"String name = \"Alli1ance\";\n",[795,890,891],{"class":797,"line":804},[795,892,893],{},"int i = 0;\n",[795,895,896],{"class":797,"line":810},[795,897,898],{},"while (name.indexOf(\"1\") >= 0)\n",[795,900,901],{"class":797,"line":816},[795,902,819],{},[795,904,905],{"class":797,"line":822},[795,906,907],{},"    i = name.indexOf(\"1\");\n",[795,909,910],{"class":797,"line":828},[795,911,912],{},"    String firstPart = name.substring(0, i);\n",[795,914,915],{"class":797,"line":834},[795,916,917],{},"    String lastPart = name.substring(i + 1);\n",[795,919,920],{"class":797,"line":840},[795,921,922],{},"    name = firstPart + \"l\" + lastPart; \u002F\u002F replace the \"1\" with \"l\"\n",[795,924,925],{"class":797,"line":846},[795,926,849],{},[773,928,929,930,934,935,938],{},"Each pass finds the ",[931,932,933],"em",{},"next"," occurrence, because the string was already reassigned — the search always runs against the current (updated) value of ",[777,936,937],{},"name",".",[768,940,942],{"id":941},"building-a-new-string","Building a New String",[773,944,945],{},"Since strings are immutable, \"building\" one really means starting with an empty string and concatenating onto it inside a loop:",[786,947,949],{"className":788,"code":948,"language":790,"meta":791,"style":791},"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",[777,950,951,956,960,964,969,974],{"__ignoreMap":791},[795,952,953],{"class":797,"line":798},[795,954,955],{},"String reversed = \"\";\n",[795,957,958],{"class":797,"line":804},[795,959,813],{},[795,961,962],{"class":797,"line":810},[795,963,819],{},[795,965,966],{"class":797,"line":816},[795,967,968],{},"    String letter = autoName.substring(i, i + 1);\n",[795,970,971],{"class":797,"line":822},[795,972,973],{},"    reversed = letter + reversed; \u002F\u002F prepend — builds the string backwards\n",[795,975,976],{"class":797,"line":828},[795,977,849],{},[768,979,981],{"id":980},"common-pitfalls","Common Pitfalls",[983,984,985,993,1016],"ul",{},[986,987,988,992],"li",{},[989,990,991],"strong",{},"Starting a string-scanning loop at 1 instead of 0."," The first character is always at index 0 — starting at 1 skips it.",[986,994,995,1008,1009,1012,1013,938],{},[989,996,997,998,1001,1002,1005,1006,938],{},"Using ",[777,999,1000],{},"\u003C="," instead of ",[777,1003,1004],{},"\u003C"," against ",[777,1007,783],{}," ",[777,1010,1011],{},"i \u003C= autoName.length()"," reads one index past the end and throws ",[777,1014,1015],{},"IndexOutOfBoundsException",[986,1017,1018,1021,1022,1024],{},[989,1019,1020],{},"An infinite loop in a find-and-replace pattern."," If the replacement text itself still contains the thing you're searching for, ",[777,1023,866],{}," finds it again forever — make sure each pass genuinely reduces what's left to find.",[768,1026,1028],{"id":1027},"key-takeaways","Key Takeaways",[983,1030,1031,1039,1048],{},[986,1032,1033,1035,1036,1038],{},[777,1034,779],{}," loops fit scanning every character; ",[777,1037,858],{}," loops fit searching for an unknown number of matches.",[986,1040,1041,1042,1044,1045,1047],{},"A find-and-replace loop combines ",[777,1043,866],{}," (to locate) with ",[777,1046,870],{}," (to rebuild around the match), reassigning the string each pass.",[986,1049,1050],{},"Building a new string from scratch means starting empty and concatenating inside a loop — strings can't be modified in place.",[773,1052,1053,1054,1057,1058,1061],{},"Derived from ",[777,1055,1056],{},"csawesome-2026",": ",[777,1059,1060],{},"unit-2-selection-and-iteration\u002F2.10-implementing-string-algorithms.md"," (CSA 2.10)",[1063,1064,1065],"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":791,"searchDepth":804,"depth":804,"links":1067},[1068,1069,1071,1072,1073],{"id":770,"depth":804,"text":771},{"id":862,"depth":804,"text":1070},"Find and Replace with indexOf + substring",{"id":941,"depth":804,"text":942},{"id":980,"depth":804,"text":981},{"id":1027,"depth":804,"text":1028},"md",{"outlineRef":1076,"status":1077},"6.2 — String Algorithms (CSA 2.10)","new — authored lesson (fuller depth than the teaser slide)",true,{"title":114,"description":791},"ASNjq99mN4YY939D5ySBHjQ-gE2cQrIen1G6ux69Zdw",{"id":1082,"title":543,"body":1083,"description":791,"extension":1074,"meta":1470,"navigation":1078,"path":542,"seo":1473,"stem":544,"__hash__":1474},"examples\u002Fshockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F6.2-string-algorithms.md",{"type":761,"value":1084,"toc":1456},[1085,1088,1092,1099,1103,1123,1130,1166,1170,1176,1217,1230,1234,1243,1286,1303,1307,1310,1343,1354,1358,1378,1381,1389,1393,1403,1410,1427,1431,1454],[764,1086,543],{"id":1087},"string-algorithms-worked-example",[768,1089,1091],{"id":1090},"problem","Problem",[773,1093,1094,1095,1098],{},"A driver types the name of an autonomous routine into the dashboard before a match, e.g. ",[777,1096,1097],{},"\"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.",[768,1100,1102],{"id":1101},"step-1-plan-it-first","Step 1: Plan It First",[1104,1105,1106,1112,1120],"ol",{},[986,1107,1108,1109,1111],{},"Scan every character and count the spaces — a known number of characters to check, so a ",[777,1110,779],{}," loop fits.",[986,1113,1114,1115,875,1117,1119],{},"Replace spaces with underscores one at a time until none remain — an unknown number of matches, so a ",[777,1116,858],{},[777,1118,866],{}," fits.",[986,1121,1122],{},"Build a reversed copy of the cleaned name by concatenating onto a new string, one character at a time.",[768,1124,1126,1127],{"id":1125},"step-2-set-up-the-class-and-main","Step 2: Set Up the Class and ",[777,1128,1129],{},"main",[786,1131,1133],{"className":788,"code":1132,"language":790,"meta":791,"style":791},"public class RoutineNameCleaner\n{\n    public static void main(String[] args)\n    {\n        String rawName = \"Left  Start Cone\";\n    }\n}\n",[777,1134,1135,1140,1144,1149,1153,1158,1162],{"__ignoreMap":791},[795,1136,1137],{"class":797,"line":798},[795,1138,1139],{},"public class RoutineNameCleaner\n",[795,1141,1142],{"class":797,"line":804},[795,1143,819],{},[795,1145,1146],{"class":797,"line":810},[795,1147,1148],{},"    public static void main(String[] args)\n",[795,1150,1151],{"class":797,"line":816},[795,1152,831],{},[795,1154,1155],{"class":797,"line":822},[795,1156,1157],{},"        String rawName = \"Left  Start Cone\";\n",[795,1159,1160],{"class":797,"line":828},[795,1161,843],{},[795,1163,1164],{"class":797,"line":834},[795,1165,849],{},[768,1167,1169],{"id":1168},"step-3-count-the-spaces","Step 3: Count the Spaces",[773,1171,1172,1173,1175],{},"Visiting every character exactly once, in order, is exactly what a ",[777,1174,779],{}," loop is for:",[786,1177,1179],{"className":788,"code":1178,"language":790,"meta":791,"style":791},"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",[777,1180,1181,1186,1191,1195,1200,1204,1209,1213],{"__ignoreMap":791},[795,1182,1183],{"class":797,"line":798},[795,1184,1185],{},"int spaceCount = 0;\n",[795,1187,1188],{"class":797,"line":804},[795,1189,1190],{},"for (int i = 0; i \u003C rawName.length(); i++)\n",[795,1192,1193],{"class":797,"line":810},[795,1194,819],{},[795,1196,1197],{"class":797,"line":816},[795,1198,1199],{},"    if (rawName.substring(i, i + 1).equals(\" \"))\n",[795,1201,1202],{"class":797,"line":822},[795,1203,831],{},[795,1205,1206],{"class":797,"line":828},[795,1207,1208],{},"        spaceCount++;\n",[795,1210,1211],{"class":797,"line":834},[795,1212,843],{},[795,1214,1215],{"class":797,"line":840},[795,1216,849],{},[773,1218,1219,1222,1223,1226,1227,1229],{},[777,1220,1221],{},"substring(i, i + 1)"," pulls out the single character at index ",[777,1224,1225],{},"i",". The loop starts at 0 and stops before ",[777,1228,783],{},", so every index from the first character to the last gets checked exactly once.",[768,1231,1233],{"id":1232},"step-4-replace-every-space-with-an-underscore","Step 4: Replace Every Space with an Underscore",[773,1235,1236,1237,1239,1240,1242],{},"There's no way to know in advance how many spaces the driver typed, so a ",[777,1238,858],{}," loop keeps going until ",[777,1241,866],{}," reports there are none left:",[786,1244,1246],{"className":788,"code":1245,"language":790,"meta":791,"style":791},"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",[777,1247,1248,1253,1258,1262,1267,1272,1277,1282],{"__ignoreMap":791},[795,1249,1250],{"class":797,"line":798},[795,1251,1252],{},"String cleanedName = rawName;\n",[795,1254,1255],{"class":797,"line":804},[795,1256,1257],{},"while (cleanedName.indexOf(\" \") >= 0)\n",[795,1259,1260],{"class":797,"line":810},[795,1261,819],{},[795,1263,1264],{"class":797,"line":816},[795,1265,1266],{},"    int i = cleanedName.indexOf(\" \");\n",[795,1268,1269],{"class":797,"line":822},[795,1270,1271],{},"    String firstPart = cleanedName.substring(0, i);\n",[795,1273,1274],{"class":797,"line":828},[795,1275,1276],{},"    String lastPart = cleanedName.substring(i + 1);\n",[795,1278,1279],{"class":797,"line":834},[795,1280,1281],{},"    cleanedName = firstPart + \"_\" + lastPart;\n",[795,1283,1284],{"class":797,"line":840},[795,1285,849],{},[773,1287,1288,1289,1292,1293,1296,1297,1299,1300,1302],{},"Each pass reassigns ",[777,1290,1291],{},"cleanedName",", so the next ",[777,1294,1295],{},"indexOf(\" \")"," search runs against the already-partially-cleaned string and finds the ",[931,1298,933],{}," remaining space. Because ",[777,1301,1097],{}," has two spaces back to back plus one more, this loop runs three times.",[768,1304,1306],{"id":1305},"step-5-build-the-reversed-name","Step 5: Build the Reversed Name",[773,1308,1309],{},"Building a new string means starting empty and concatenating inside a loop — strings can't be edited in place:",[786,1311,1313],{"className":788,"code":1312,"language":790,"meta":791,"style":791},"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",[777,1314,1315,1320,1325,1329,1334,1339],{"__ignoreMap":791},[795,1316,1317],{"class":797,"line":798},[795,1318,1319],{},"String reversedName = \"\";\n",[795,1321,1322],{"class":797,"line":804},[795,1323,1324],{},"for (int i = 0; i \u003C cleanedName.length(); i++)\n",[795,1326,1327],{"class":797,"line":810},[795,1328,819],{},[795,1330,1331],{"class":797,"line":816},[795,1332,1333],{},"    String letter = cleanedName.substring(i, i + 1);\n",[795,1335,1336],{"class":797,"line":822},[795,1337,1338],{},"    reversedName = letter + reversedName;\n",[795,1340,1341],{"class":797,"line":828},[795,1342,849],{},[773,1344,1345,1346,1349,1350,1353],{},"Prepending each letter (",[777,1347,1348],{},"letter + reversedName",", not ",[777,1351,1352],{},"reversedName + letter",") is what builds the string backwards.",[768,1355,1357],{"id":1356},"step-6-print-and-verify","Step 6: Print and Verify",[786,1359,1361],{"className":788,"code":1360,"language":790,"meta":791,"style":791},"System.out.println(\"Spaces found: \" + spaceCount);\nSystem.out.println(\"Cleaned name: \" + cleanedName);\nSystem.out.println(\"Reversed name: \" + reversedName);\n",[777,1362,1363,1368,1373],{"__ignoreMap":791},[795,1364,1365],{"class":797,"line":798},[795,1366,1367],{},"System.out.println(\"Spaces found: \" + spaceCount);\n",[795,1369,1370],{"class":797,"line":804},[795,1371,1372],{},"System.out.println(\"Cleaned name: \" + cleanedName);\n",[795,1374,1375],{"class":797,"line":810},[795,1376,1377],{},"System.out.println(\"Reversed name: \" + reversedName);\n",[773,1379,1380],{},"Output:",[786,1382,1387],{"className":1383,"code":1385,"language":1386},[1384],"language-text","Spaces found: 3\nCleaned name: Left__Start_Cone\nReversed name: enoC_tratS__tfeL\n","text",[777,1388,1385],{"__ignoreMap":791},[768,1390,1392],{"id":1391},"what-starting-at-index-1-would-look-like","What Starting at Index 1 Would Look Like",[773,1394,1395,1396,1001,1399,1402],{},"If Step 3's loop had started at ",[777,1397,1398],{},"i = 1",[777,1400,1401],{},"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.",[768,1404,1406,1407,1409],{"id":1405},"what-would-look-like","What ",[777,1408,1000],{}," Would Look Like",[773,1411,1412,1413,1001,1416,1419,1420,1423,1424,1426],{},"If Step 3 or Step 5's condition had been written ",[777,1414,1415],{},"i \u003C= rawName.length()",[777,1417,1418],{},"i \u003C rawName.length()",", the last pass would call ",[777,1421,1422],{},"substring(length(), length() + 1)"," — one index past the end — and throw an ",[777,1425,1015],{}," instead of finishing.",[768,1428,1430],{"id":1429},"recap","Recap",[983,1432,1433,1438,1448],{},[986,1434,775,1435,1437],{},[777,1436,779],{}," loop fit counting the spaces, since every character needed exactly one check.",[986,1439,775,1440,875,1442,1444,1445,1447],{},[777,1441,858],{},[777,1443,866],{}," fit replacing the spaces, since the number of matches wasn't known ahead of time — each pass reassigned ",[777,1446,1291],{}," and searched again against the updated value.",[986,1449,1450,1451,1453],{},"Building the reversed name started from an empty string and concatenated one character at a time inside a ",[777,1452,779],{}," loop, since strings can't be modified in place.",[1063,1455,1065],{},{"title":791,"searchDepth":804,"depth":804,"links":1457},[1458,1459,1460,1462,1463,1464,1465,1466,1467,1469],{"id":1090,"depth":804,"text":1091},{"id":1101,"depth":804,"text":1102},{"id":1125,"depth":804,"text":1461},"Step 2: Set Up the Class and main",{"id":1168,"depth":804,"text":1169},{"id":1232,"depth":804,"text":1233},{"id":1305,"depth":804,"text":1306},{"id":1356,"depth":804,"text":1357},{"id":1391,"depth":804,"text":1392},{"id":1405,"depth":804,"text":1468},"What \u003C= Would Look Like",{"id":1429,"depth":804,"text":1430},{"outlineRef":1076,"pairsWith":1471,"status":1472},"[`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":543,"description":791},"r_d78eRLiKSYe8inYF_cI6cX7e6bHuaTxdzTtNLHRgQ",{"id":1476,"title":704,"body":1477,"description":791,"extension":1074,"meta":1935,"navigation":1078,"path":703,"seo":1937,"stem":705,"__hash__":1938},"exercises\u002Fshockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F6.2-string-algorithms.md",{"type":761,"value":1478,"toc":1931},[1479,1482,1486,1500,1538,1544,1549,1582,1588,1607,1624,1628,1655,1690,1693,1755,1760,1846,1929],[764,1480,704],{"id":1481},"string-algorithms-exercises",[768,1483,1485],{"id":1484},"multiple-choice","Multiple Choice",[773,1487,1488,1491,1492,1495,1496,1499],{},[989,1489,1490],{},"Question:"," A find-and-replace loop is meant to replace every ",[777,1493,1494],{},"\"0\""," in a sensor code with ",[777,1497,1498],{},"\"00\""," (doubling each zero):",[786,1501,1503],{"className":788,"code":1502,"language":790,"meta":791,"style":791},"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",[777,1504,1505,1510,1514,1519,1524,1529,1534],{"__ignoreMap":791},[795,1506,1507],{"class":797,"line":798},[795,1508,1509],{},"while (code.indexOf(\"0\") >= 0)\n",[795,1511,1512],{"class":797,"line":804},[795,1513,819],{},[795,1515,1516],{"class":797,"line":810},[795,1517,1518],{},"    int i = code.indexOf(\"0\");\n",[795,1520,1521],{"class":797,"line":816},[795,1522,1523],{},"    String firstPart = code.substring(0, i);\n",[795,1525,1526],{"class":797,"line":822},[795,1527,1528],{},"    String lastPart = code.substring(i + 1);\n",[795,1530,1531],{"class":797,"line":828},[795,1532,1533],{},"    code = firstPart + \"00\" + lastPart;\n",[795,1535,1536],{"class":797,"line":834},[795,1537,849],{},[773,1539,1540,1541,1543],{},"What happens when this runs on a code that contains at least one ",[777,1542,1494],{},"?",[773,1545,1546],{},[989,1547,1548],{},"Options:",[983,1550,1551,1564,1573,1579],{},[986,1552,1553,1554,1556,1557,1559,1560,1563],{},"A. It loops forever — the replacement text ",[777,1555,1498],{}," still contains a ",[777,1558,1494],{},", so ",[777,1561,1562],{},"indexOf(\"0\")"," keeps finding one",[986,1565,1566,1567,1569,1570,1572],{},"B. It replaces every zero with ",[777,1568,1498],{}," once each, then stops, because ",[777,1571,866],{}," only searches the original text",[986,1574,1575,1576,1578],{},"C. It throws an ",[777,1577,1015],{}," once all the zeros are gone",[986,1580,1581],{},"D. It replaces only the first zero and leaves the rest of the string unchanged",[773,1583,1584,1587],{},[989,1585,1586],{},"Answer:"," A",[773,1589,1590,1593,1594,1596,1597,1600,1601,1603,1604,1606],{},[989,1591,1592],{},"Why:"," Each pass searches ",[777,1595,777],{},"'s ",[931,1598,1599],{},"current"," value, which was just reassigned at the end of the previous pass. Since the replacement text (",[777,1602,1498],{},") still contains the character being searched for, ",[777,1605,1562],{}," 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.",[983,1608,1609,1618,1621],{},[986,1610,1611,1612,1614,1615,1617],{},"B is wrong — ",[777,1613,866],{}," always searches whatever ",[777,1616,777],{}," currently holds, not the original string; it has no memory of what's already been replaced.",[986,1619,1620],{},"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.",[986,1622,1623],{},"D is wrong — the loop keeps running (and keeps matching) instead of stopping after a single replacement.",[768,1625,1627],{"id":1626},"micro-parsons","Micro-Parsons",[773,1629,1630,1633,1634,1637,1638,1641,1642,1645,1646,1648,1649,1651,1652,1654],{},[989,1631,1632],{},"Problem:"," A limit switch's status is packed into a string of ",[777,1635,1636],{},"1","s and ",[777,1639,1640],{},"0","s, e.g. ",[777,1643,1644],{},"\"10110\"",", where ",[777,1647,1636],{}," means the switch is triggered. The class and ",[777,1650,1129],{}," method below are already set up — reorder only the fragments that go inside ",[777,1653,1129],{}," so the program counts and prints how many switches are triggered.",[786,1656,1658],{"className":788,"code":1657,"language":790,"meta":791,"style":791},"public class SwitchStatus\n{\n    public static void main(String[] args)\n    {\n        \u002F\u002F fragments go here\n    }\n}\n",[777,1659,1660,1665,1669,1673,1677,1682,1686],{"__ignoreMap":791},[795,1661,1662],{"class":797,"line":798},[795,1663,1664],{},"public class SwitchStatus\n",[795,1666,1667],{"class":797,"line":804},[795,1668,819],{},[795,1670,1671],{"class":797,"line":810},[795,1672,1148],{},[795,1674,1675],{"class":797,"line":816},[795,1676,831],{},[795,1678,1679],{"class":797,"line":822},[795,1680,1681],{},"        \u002F\u002F fragments go here\n",[795,1683,1684],{"class":797,"line":828},[795,1685,843],{},[795,1687,1688],{"class":797,"line":834},[795,1689,849],{},[773,1691,1692],{},"Reorder the fragments below:",[983,1694,1695,1701,1707,1713,1719,1725,1731,1737,1743,1749],{},[986,1696,1697,1698],{},"a. ",[777,1699,1700],{},"            }",[986,1702,1703,1704],{},"b. ",[777,1705,1706],{},"        String status = \"10110\";",[986,1708,1709,1710],{},"c. ",[777,1711,1712],{},"                triggeredCount++;",[986,1714,1715,1716],{},"d. ",[777,1717,1718],{},"        for (int i = 0; i \u003C status.length(); i++)",[986,1720,1721,1722],{},"e. ",[777,1723,1724],{},"        }",[986,1726,1727,1728],{},"f. ",[777,1729,1730],{},"            if (status.substring(i, i + 1).equals(\"1\"))",[986,1732,1733,1734],{},"g. ",[777,1735,1736],{},"        {",[986,1738,1739,1740],{},"h. ",[777,1741,1742],{},"        System.out.println(\"Triggered: \" + triggeredCount);",[986,1744,1745,1746],{},"i. ",[777,1747,1748],{},"            {",[986,1750,1751,1752],{},"j. ",[777,1753,1754],{},"        int triggeredCount = 0;",[773,1756,1757,1759],{},[989,1758,1586],{}," b, j, d, g, f, i, c, a, e, h",[786,1761,1763],{"className":788,"code":1762,"language":790,"meta":791,"style":791},"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",[777,1764,1765,1769,1773,1777,1781,1786,1791,1796,1801,1806,1812,1818,1824,1830,1836,1841],{"__ignoreMap":791},[795,1766,1767],{"class":797,"line":798},[795,1768,1664],{},[795,1770,1771],{"class":797,"line":804},[795,1772,819],{},[795,1774,1775],{"class":797,"line":810},[795,1776,1148],{},[795,1778,1779],{"class":797,"line":816},[795,1780,831],{},[795,1782,1783],{"class":797,"line":822},[795,1784,1785],{},"        String status = \"10110\";\n",[795,1787,1788],{"class":797,"line":828},[795,1789,1790],{},"        int triggeredCount = 0;\n",[795,1792,1793],{"class":797,"line":834},[795,1794,1795],{},"        for (int i = 0; i \u003C status.length(); i++)\n",[795,1797,1798],{"class":797,"line":840},[795,1799,1800],{},"        {\n",[795,1802,1803],{"class":797,"line":846},[795,1804,1805],{},"            if (status.substring(i, i + 1).equals(\"1\"))\n",[795,1807,1809],{"class":797,"line":1808},10,[795,1810,1811],{},"            {\n",[795,1813,1815],{"class":797,"line":1814},11,[795,1816,1817],{},"                triggeredCount++;\n",[795,1819,1821],{"class":797,"line":1820},12,[795,1822,1823],{},"            }\n",[795,1825,1827],{"class":797,"line":1826},13,[795,1828,1829],{},"        }\n",[795,1831,1833],{"class":797,"line":1832},14,[795,1834,1835],{},"        System.out.println(\"Triggered: \" + triggeredCount);\n",[795,1837,1839],{"class":797,"line":1838},15,[795,1840,843],{},[795,1842,1844],{"class":797,"line":1843},16,[795,1845,849],{},[773,1847,1848,1008,1851,1854,1855,1858,1859,1854,1862,1865,1866,1868,1869,1871,1872,1874,1875,1878,1879,1881,1882,1885,1886,1889,1890,1881,1893,1885,1896,1898,1899,1854,1902,1905,1906,1908,1909,1911,1912,1915,1916,1911,1918,1921,1922,1854,1925,1928],{},[989,1849,1850],{},"Why this order:",[777,1852,1853],{},"status"," (",[777,1856,1857],{},"b",") and ",[777,1860,1861],{},"triggeredCount",[777,1863,1864],{},"j",") are declared before the loop — ",[777,1867,1861],{}," needs to start at ",[777,1870,1640],{}," before anything can be added to it, and ",[777,1873,1853],{}," needs to exist before the loop calls ",[777,1876,1877],{},".length()"," on it. The ",[777,1880,779],{}," header (",[777,1883,1884],{},"d",") and its opening brace (",[777,1887,1888],{},"g",") start the scan; inside it, the ",[777,1891,1892],{},"if",[777,1894,1895],{},"f",[777,1897,1225],{},") test one character at a time, with ",[777,1900,1901],{},"triggeredCount++",[777,1903,1904],{},"c",") inside the ",[777,1907,1892],{},"'s own braces. The ",[777,1910,1892],{}," closes (",[777,1913,1914],{},"a",") before the ",[777,1917,779],{},[777,1919,1920],{},"e",") — braces have to close from the inside out. Only after the loop finishes does ",[777,1923,1924],{},"println",[777,1926,1927],{},"h",") run, since it needs the final count, not a partial one.",[1063,1930,1065],{},{"title":791,"searchDepth":804,"depth":804,"links":1932},[1933,1934],{"id":1484,"depth":804,"text":1485},{"id":1626,"depth":804,"text":1627},{"outlineRef":1076,"pairsWith":1471,"status":1936},"new — authored exercises (Multiple Choice + Micro-Parsons)",{"title":704,"description":791},"hjJzonyCVt8OQxPR5SOBgD5eXybRWG0SF9B8l3h-vGw",1790274944294]