BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//American Young Coder - ECPv6.10.1.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.ayclogic.com
X-WR-CALDESC:Events for American Young Coder
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250408T190000
DTEND;TZID=America/Los_Angeles:20250408T200000
DTSTAMP:20260430T114129
CREATED:20250408T224400Z
LAST-MODIFIED:20250409T030904Z
UID:28598-1744138800-1744142400@www.ayclogic.com
SUMMARY:7 PM - Intro to Competitive Programming - Darin
DESCRIPTION:What We Did Today:\n\nReviewed concepts and tools for basic programming in Java\nLearnt the modulus operator\nLearnt the difference between Lists and Arrays\n\nHomework:\nCreate a new file named Apr8_ArrayHomework.java\, and submit to the google drive: here when you are finished! \n\nCreate a new int array(6) (“numbers”) and add the following values: -100\,2\,3\,100\,-5\,14\nCreate a new int array(20) (“num2”) and use for loop to copy all elements from “numbers” to “num2”\nAdd code to count how many negative numbers inside the “num2” array.\nAfter you learn how to use modulus in Java\, write a code that will go through each element inside “numbers” and print all odd number inside the list using modulus (%) operator.\nRead about Java primitive data type – https://www.w3schools.com/java/java_data_types.asp\n\nNotes:\nYou can reach out to me at ddjapri@ayclogic.com if you have any questions! \nYou can find class notes here.
URL:https://www.ayclogic.com/event/7-pm-intro-to-competitive-programming-darin/
CATEGORIES:Intro To Competitive,Java
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250415T190000
DTEND;TZID=America/Los_Angeles:20250415T200000
DTSTAMP:20260430T114129
CREATED:20250416T030356Z
LAST-MODIFIED:20250416T030356Z
UID:28704-1744743600-1744747200@www.ayclogic.com
SUMMARY:7 PM – Intro to Competitive Programming – Darin
DESCRIPTION:What We Did Today:\n\nReviewed the difference between primitive/non-primitive data types\nReviewed the use of enhanced vs. regular for loop\nWe learned how to find sum of all numbers in an array\nWe learned how to find sum of every other number in an array\nWe learned how to swap two elements in an array\n\nHomework:\nContinue in your file named Apr15_ArrayAndList2.java\, and submit to the google drive: here when you are finished! \n\n// HW\n\n// EASY\n// find largest element in nums\n// find smallest element in nums\n// sum all even numbers\n// print forwards until you hit the middle of the list\n\n// MEDIUM\n// print all items in reverse\n\n// HARD\n// swap to reverse the array\n\nNotes:\nYou can reach out to me at ddjapri@ayclogic.com if you have any questions! \nYou can find class notes here.
URL:https://www.ayclogic.com/event/7-pm-intro-to-competitive-programming-darin-2/
CATEGORIES:Intro To Competitive,Java
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250422T190000
DTEND;TZID=America/Los_Angeles:20250422T200000
DTSTAMP:20260430T114129
CREATED:20250422T231119Z
LAST-MODIFIED:20250423T031452Z
UID:28788-1745348400-1745352000@www.ayclogic.com
SUMMARY:7 PM – Intro to Competitive Programming – Darin
DESCRIPTION:What We Did Today:\n\nReviewed the homework for primitive data types and primitive arrays\, and manipulating primitive arrays.\nLearnt how to create dynamic arrays (under the hood for ArrayList) using primitive arrays.\n\nHomework:\nContinue in your file named Apr22_StringManipulation.java\, and submit to the google drive: here when you are finished! \n\n// HW\n// remove from a certain position\n// it's easier to use a new array\n// you can try to remove in-place of the same array\n\nNotes:\nYou can reach out to me at ddjapri@ayclogic.com if you have any questions! \nYou can find class notes here.
URL:https://www.ayclogic.com/event/7-pm-intro-to-competitive-programming-darin-3/
CATEGORIES:Intro To Competitive,Java
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250429T190000
DTEND;TZID=America/Los_Angeles:20250429T200000
DTSTAMP:20260430T114129
CREATED:20250430T052237Z
LAST-MODIFIED:20250430T052237Z
UID:28881-1745953200-1745956800@www.ayclogic.com
SUMMARY:7 PM – Intro to Competitive Programming – Darin
DESCRIPTION:What We Did Today:\n\nReviewed the homework for manipulating Arrays of Strings.\nLearnt how to check for palindromes\, and analyzed how to create insertion and deletion operations in-place and out-of-place.\n\nHomework:\nContinue in your file named Apr29_StringManipulation2.java\, and submit to the google drive: here when you are finished! \n\n// HW\n\nProblem 1\n// Create a palindrome checker that works with empty spaces\n// race car\n// r a c e c a r\n\nProblem 2\n// Create a palindrome checker that works with every other character and empty spaces (note you have to check two cases for  "every other" character\, denoted with the capital letters below)\n// r B c D c B r - true\n// R b C d C x R - true\n\n\nNotes:\nYou can reach out to me at ddjapri@ayclogic.com if you have any questions! \nYou can find class notes here.
URL:https://www.ayclogic.com/event/7-pm-intro-to-competitive-programming-darin-4/
CATEGORIES:Intro To Competitive,Java
END:VEVENT
END:VCALENDAR