BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:Canada/Eastern
BEGIN:DAYLIGHT
DTSTART:20210314T030000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:EDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20211107T010000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:EST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20211025T182448Z
UID:6EE6EEFE-96AA-40EA-BD5E-0ADCDB2865F7
DTSTART;TZID=Canada/Eastern:20211022T150000
DTEND;TZID=Canada/Eastern:20211022T160000
DESCRIPTION:[IEEEXtreme](https://ieeextreme.org/) is a global challenge in 
 which teams of student members\, supported by an IEEE Student Branch\, adv
 ised and proctored by an IEEE Member\, compete in a 24-hour time span\, st
 arting on October 23rd\, 2021\, at 00:00:00 UTC and ending at 23:59:59 UTC
 \, against each other to solve a set of programming problems. The Xtreme 1
 5.0 is around the corner\, and we’re having a tutorial session this Frid
 ay from 3 PM to 4PM on Zoom.\n\nWe are also pleased to anounce that up to 
 ~10 people can join us In Person at the McConnel Engineering Building in R
 oom 603 for the tutorial. Please be advised that you must be vaccinated to
  attend in person and you must follow all [McGill COVID Protocols](https:/
 /www.mcgill.ca/coronavirus/health-guidelines). Furthermore\, we will also 
 be offering drinks during this tutorial with a surprise little snack treat
  at the end of the tutorial. To attend in person\, please register for thi
 s event here!\n\nDuring the tutorial we will cover multiple topics from th
 e CS Academy IEEE Xtreme problem bank as following:\n\n- [Subsequebce Quer
 ies](https://csacademy.com/contest/archive/task/subsequence-queries/): Har
 d\, Dynamic Programming\, Struct\n- [Max Score Tree](https://csacademy.com
 /contest/archive/task/max-score-tree/): Medium\, Recursive Programming\, T
 ree Data Structre\n- [One Letter Problem](https://csacademy.com/contest/ar
 chive/task/one_letter/): Easy\, Sorting Algorithms\, Strings\n\nSpeaker(s)
 : Sogol Masoumzadeh\, \n\nRoom: 603\, Bldg: McConnell Engineering Building
 \, 3480 Rue University\, Montreal\, Quebec\, Canada\, H2X2G6\, Virtual: ht
 tps://events.vtools.ieee.org/m/286639
LOCATION:Room: 603\, Bldg: McConnell Engineering Building\, 3480 Rue Univer
 sity\, Montreal\, Quebec\, Canada\, H2X2G6\, Virtual: https://events.vtool
 s.ieee.org/m/286639
ORGANIZER:ieee.mcgill@gmail.com
SEQUENCE:8
SUMMARY:IEEE Xtreme 15.0 Tutorial Session
URL;VALUE=URI:https://events.vtools.ieee.org/m/286639
X-ALT-DESC:Description: <br /><p class="x_xmsonormal"><a href="https://ieee
 xtreme.org/">IEEEXtreme</a> is a global challenge in which teams of studen
 t members\, supported by an IEEE Student Branch\, advised and proctored by
  an IEEE Member\, compete in a 24-hour time span\, starting on October 23<
 sup>rd</sup>\, 2021\, at 00:00:00 UTC and ending at 23:59:59 UTC\, against
  each other to solve a set of programming problems. The Xtreme 15.0 is aro
 und the corner\, and we&rsquo\;re having a tutorial session this Friday fr
 om 3 PM to 4PM on Zoom.</p>\n<p class="x_xmsonormal">We are also pleased t
 o anounce that up to ~10 people can join us&nbsp\;<strong>In Person</stron
 g>&nbsp\;at the McConnel Engineering Building in Room 603 for the tutorial
 . Please be advised that you must be vaccinated to attend in person and yo
 u must follow all <a title="https://www.mcgill.ca/coronavirus/health-guide
 lines" href="https://www.mcgill.ca/coronavirus/health-guidelines">McGill C
 OVID Protocols</a>. Furthermore\, we will also be offering drinks during t
 his tutorial with a surprise little snack treat at the end of the tutorial
 . To attend in person\, please register for this event here!</p>\n<p class
 ="x_MsoNormal">During the tutorial we will cover multiple topics from the 
 CS Academy IEEE Xtreme problem bank as following:</p>\n<ol>\n<li><a title=
 "https://csacademy.com/contest/archive/task/subsequence-queries/" href="ht
 tps://csacademy.com/contest/archive/task/subsequence-queries/">Subsequebce
  Queries</a>: Hard\, Dynamic Programming\, Struct</li>\n<li><a title="http
 s://csacademy.com/contest/archive/task/max-score-tree/" href="https://csac
 ademy.com/contest/archive/task/max-score-tree/">Max Score Tree</a>: Medium
 \, Recursive Programming\, Tree Data Structre</li>\n<li><a title="https://
 csacademy.com/contest/archive/task/one_letter/" href="https://csacademy.co
 m/contest/archive/task/one_letter/">One Letter Problem</a>: Easy\, Sorting
  Algorithms\, Strings</li>\n</ol>
END:VEVENT
END:VCALENDAR