

        <cite>Bryce</cite>
      <time>0:00</time>
      <p>
          Who   would   who   would   play   me   in   the   movie   of   my   life?
      </p>

        <cite>Conor</cite>
      <time>0:03</time>
      <p>
          Shia   LaBeouf.
      </p>

        <cite>Bryce</cite>
      <time>0:10</time>
      <p>
          Connor   had   no   hesitation.   Connor   just   knew.
      </p>

        <cite>Conor</cite>
      <time>0:24</time>
      <p>
          Welcome   to   ADSP   the   podcast   episode   55,   recorded   on   December   5th,   2021.   My   name   is   Connor,   and   today   with   my   co-host   Bryce,   we   live   code   a   solution   to   a   leak   code   problem   in   C.   This   is   part   one   of   a   two-part   episode   where   in   next   week&#39;s   episode   we&#39;ll   solve   the   same   problem   but   a   BQN.
      </p>

        <cite>Bryce</cite>
      <time>0:44</time>
      <p>
          Nice   shorts,   by   the   way.   Those   are   nice   shorts.   I&#39;m   admiring   your   shorts.
      </p>

        <cite>Conor</cite>
      <time>0:49</time>
      <p>
          I&#39;m   wearing   shorts?
      </p>

        <cite>Bryce</cite>
      <time>0:50</time>
      <p>
          Yeah,   I   was   admiring   your   shorts.   I   like   them.   They&#39;re   a   good   color.
      </p>

        <cite>Conor</cite>
      <time>0:54</time>
      <p>
          Yeah,   Lululemon   baby.
      </p>

        <cite>Bryce</cite>
      <time>0:56</time>
      <p>
          Yeah.   Although   it&#39;s   winter.   Why   are   you   wearing   shorts?
      </p>

        <cite>Conor</cite>
      <time>1:00</time>
      <p>
          Oh,   it&#39;s   toasty   in   my   apartment.   I   haven&#39;t   even   turned   the   heater   on.
      </p>

        <cite>Bryce</cite>
      <time>1:04</time>
      <p>
          What   is   toasty?   What   is   to   and   and   and   if   you   give   it   to   me   in   Celsius,   I&#39;m   not   gonna   be   amused.
      </p>

        <cite>Conor</cite>
      <time>1:13</time>
      <p>
          Uh   I   don&#39;t   know.   I   don&#39;t   know   how   warm   it   is   in   my   apartment.   I   have   no   idea.   But   not   cold   enough   to   require   me   uh   wearing   pants.   Are   we   recording?   Is   this   are   we   good?   Are   we   good   to   go?   Of   course   I&#39;m   recording.   Yes,   here   we   go,   Bryce.   Are   you   ready?   I   also   yeah,   are   you   ready?   In   celebration.   So   I   got   too   thirsty   because   Bryce   was   like   17   minutes   left   uh   late.
      </p>

        <cite>Bryce</cite>
      <time>1:37</time>
      <p>
          I   was   savoring   a   cupcake.   I   sent   you   a   polite   message   informing   you   that   I   was   savoring   a   cupcake.
      </p>

        <cite>Conor</cite>
      <time>1:44</time>
      <p>
          That&#39;s   true.   I&#39;m   not   sure   how   that   took   17   minutes,   but   I   had   to   open   my   grapefruit   bubbly   that   I   was   waiting.   But   because   we&#39;re   celebrating,   because   we&#39;re   celebrating   Bryce,   I   got   another   bubbly,   and   this   one&#39;s   Lyme.   Here   we   go,   folks.   Here   we   go.   Episode,   what   episode   is   this?   Is   episode   like   56?   Woo!   Right   there,   baby.   Right   there.
      </p>

        <cite>Bryce</cite>
      <time>2:07</time>
      <p>
          Alright,   so   so   so   a   couple   couple   things.   One,   clearly,   you&#39;ve   never   savored   a   cupcake   before.   Um   I&#39;ll   have   to   change   that.   Uh   two,   what   are   we   celebrating?
      </p>

        <cite>Conor</cite>
      <time>2:21</time>
      <p>
          Oh,   yeah.   So   remember   two   episodes   ago,   I   said,   oh,   I&#39;m   not   gonna   get   to   update   the   listener   on   how   my   10k   race   goes   because   we&#39;re   gonna   be   talking   to   the   Neblers.   But   I   didn&#39;t   realize   that   was   next   weekend,   so   we&#39;re   recording   today,   and   I   did   a   10K   in   Toronto   yesterday   and   a   10K   in   Vancouver   seven   days   ago,   and   I   smashed   my   personal   record   by   two   minutes.   Previously   it   was   3723,   and   it   is   now   3529.
      </p>

        <cite>Bryce</cite>
      <time>2:50</time>
      <p>
          Wow,   that   is   a   pretty   good   10k   time,   folks.   Let   me   tell   you.
      </p>

        <cite>Conor</cite>
      <time>2:55</time>
      <p>
          It&#39;s   uh   yep,   it&#39;s   good.   And   uh   I   was   beat   by   a   14-year-old.   That   doesn&#39;t   feel   good.   Um   congrats   to   Steph.   Uh   I   gotta   admit,   I   was   running   alongside   him   in   second   place,   like   tied   for   second,   from   like   kilometer   two   and   a   half   to   five,   and   I   thought   this   kid&#39;s   running   way   too   fast,   he&#39;s   gonna   gas   out,   and   then   at   the   five   kilometer   mark,   I&#39;m   the   one   that   is   starting   to   gas   out,   and   then   he   just   like   runs   away,   and   I&#39;m   like,   I   gotta   reassess   where   I&#39;m   at.   Someone   told   me   later   I   should   have   got   his   autograph   because   he&#39;s   probably   gonna   end   up   in   like   the   Olympics   or   something   later   on,   which   is   a   good   point.
      </p>

        <cite>Bryce</cite>
      <time>3:34</time>
      <p>
          So   wait,   did   you   did   you   finish   second   in   this   10K?
      </p>

        <cite>Conor</cite>
      <time>3:38</time>
      <p>
          That   10K   uh   that   was   in   Vancouver,   I   finished   third.   Uh   because   yeah,   the   the   14-year-old   beat   me.   Yep.
      </p>

        <cite>Bryce</cite>
      <time>3:46</time>
      <p>
          Um   I   have   not   I   haven&#39;t   ridden   my   bike.   I   mean,   I&#39;m   I   spin   in   the   gym,   but   I   haven&#39;t   ridden   my   bike   since   October   because   it&#39;s   cold.   But   good   news,   my   uh   something   like   happened   when   I   came   back   from   Florida.   My   like   cold   uh   adaptivity   kicked   in.   And   like   I&#39;ve   been   like   walking   around   in   like   you   know,   a   t-shirt   the   past   few   days,   and   I&#39;ve   been   like,   you   know   what?   I   I   now   I   remember   what   it   was   like   to   be   cold   in   New   England   as   a   kid,   and   I   kind   of   like   it.   It&#39;s   not   that   bad.   So   something   just   something   just   kicked   in.
      </p>

        <cite>Conor</cite>
      <time>4:19</time>
      <p>
          No   to   the   cold.   We   don&#39;t   like   the   cold.
      </p>

        <cite>Bryce</cite>
      <time>4:21</time>
      <p>
          No,   I   I   I   do   like   the   cold.   I   do   like   the   cold.   I   just   it   just   took   me   a   little   while   to   get   used   to   uh   uh   the   cold   and   uh   and   remember   that   I   did   like   it.   Oh,   I   got   my   uh   hang   on.   Let&#39;s   see.   I   got   my   COVID   booster   today.
      </p>

        <cite>Conor</cite>
      <time>4:36</time>
      <p>
          Ooh,   how   you   feeling?
      </p>

        <cite>Bryce</cite>
      <time>4:38</time>
      <p>
          Uh   I&#39;m   feeling   fine   thus   far.   Uh   my   my   arm&#39;s   a   little   bit   sore.   I   imagine   I&#39;m   gonna   feel   not   not   as   good   tomorrow.   Yeah.   But   what   about   you?   Have   you   got   you   you   gotten   your   booster   yet?   Are   they   giving   out   boosters   in   Canada?
      </p>

        <cite>Conor</cite>
      <time>4:53</time>
      <p>
          Uh   I   know   that   uh   my   grandmother   got   her   booster   in   Vancouver   months   ago,   at   least.   Um,   so   I   know   that   they   are   giving   them   out,   but   definitely   I   don&#39;t   think   um   it&#39;s   you   know   white   dudes   in   their   30s   are   allowed   to   get   them   yet.   Um   at   least   if   at   least   I   haven&#39;t   heard   anything   about   it.   Um   and   I   would   have   heard   because   I&#39;ve   been   first   through   the   door   every   opportunity   they&#39;ve   when   they&#39;ve   opened   it   up   for   me   to   get   it.
      </p>

        <cite>Bryce</cite>
      <time>5:23</time>
      <p>
          So   well,   you   should   m   move   on   down   to   move   on   down   to   America   and   you   can   get   yourself   a   COVID   booster.
      </p>

        <cite>Conor</cite>
      <time>5:30</time>
      <p>
          Um   yeah,   we&#39;ll   think   about   it.   I   mean,   I&#39;ve   got   a   race   in   Austin,   Texas.
      </p>

        <cite>Bryce</cite>
      <time>5:35</time>
      <p>
          Um   you&#39;re   going   to   Austin,   Texas?
      </p>

        <cite>Conor</cite>
      <time>5:38</time>
      <p>
          I   know,   so   that&#39;s   the   thing.   I&#39;m   not   sure   I&#39;m   going   because   of   Omicron.   Um   and   uh   it&#39;s   on   January   23rd.   We&#39;re   recording   this   today.   Is   what   the   December   5th?   Um   so   depending   on   how   things   unfold.
      </p>

        <cite>Bryce</cite>
      <time>5:52</time>
      <p>
          Connor,   it&#39;s   like   2022.   Like,   has   that   hit   you   yet?
      </p>

        <cite>Conor</cite>
      <time>5:58</time>
      <p>
          What   does   that   mean?
      </p>

        <cite>Bryce</cite>
      <time>5:59</time>
      <p>
          Like,   it&#39;s   like   2022.   Like,   that&#39;s   the   year   that   it   basically   is.
      </p>

        <cite>Conor</cite>
      <time>6:04</time>
      <p>
          I   mean,   that   is   that   is   one   plus   2021.
      </p>

        <cite>Bryce</cite>
      <time>6:08</time>
      <p>
          You&#39;re   not,   you&#39;re   not,   you&#39;re   not   understanding,   you&#39;re   not   understanding   what   I&#39;m   saying.
      </p>

        <cite>Conor</cite>
      <time>6:13</time>
      <p>
          Break   it   down   for   me,   Bryce.   Break   it   down   for   me.
      </p>

        <cite>Bryce</cite>
      <time>6:15</time>
      <p>
          In   my   mind,   last   year   was   like   2011.
      </p>

        <cite>Conor</cite>
      <time>6:19</time>
      <p>
          2011?
      </p>

        <cite>Bryce</cite>
      <time>6:21</time>
      <p>
          Yeah.   Like,   where   did   like   the   past   10   years   go?   We&#39;re   like   old   men   now.
      </p>

        <cite>Conor</cite>
      <time>6:28</time>
      <p>
          2011   feels   like   doesn&#39;t   feel   like   yesterday,   it   feels   like   three   decades   ago   for   me.
      </p>

        <cite>Bryce</cite>
      <time>6:34</time>
      <p>
          Yeah,   it   does   it.   It   is   starting   to   feel   that   way.
      </p>

        <cite>Conor</cite>
      <time>6:37</time>
      <p>
          Like   in   2011,   I   guess   it   depends   on   what   month   you   want   to   choose,   but   like   I   was   in   like   halfway   through   university,   I   had   moved   to   Toronto   for   the   first   time   and   was   working   for   an   insurance   company   called   John   Hancock,   which   is   a   subsidi   at   the   time   it   was   a   subsidiary   of   Manulife.   I   mean,   that&#39;s   what   I   did   for   eight   months   of   that   year.
      </p>

        <cite>Bryce</cite>
      <time>6:56</time>
      <p>
          In   2011,   that   that   was   my   that   was   my   second,   that   was   my   first   year   at   LSU.   So   I   had   just   come   back   from   my   first   time   at   the   supercomputing   conference,   which   was   in   Seattle.   Um,   and   that   was   like   the   third   tech   conference   I   went   to.   I&#39;d   already   been   to   the   I   fun   fact,   most   people   think   that   the   first   conference   that   I   went   to   is   BoozCon   2011   because   I   talk   about   how   it   was   such   a   life-changing   experience   for   me.   But   actually,   I   went   to   Linux,   the   Linux   Foundation   Collaboration   Summit,   um,   or   some   some   it   was   something   with   that   sort   of   title   um   in   San   Francisco,   like   a   month   before   that,   to   talk   about   compiling   the   Linux   kernel   with   uh   Clang   and   LLVM.   Um   and   I   met   I   met   Marshall   Clow   at   the   Linux   uh   foundation   summit   thing,   and   then   I   went   to   BoostCon   2011,   and   I   also   saw   Marshall   Clow,   and   they   were   like   two   very   different   communities.   So   I   was   just   like,   oh,   this   guy   just   goes   to   every   tech   conference.
      </p>

        <cite>Conor</cite>
      <time>7:56</time>
      <p>
          What   was   the   first   conference   that   you   spoke   at?
      </p>

        <cite>Bryce</cite>
      <time>7:59</time>
      <p>
          That   that   Linux   um   uh   foundation   that   God,   I   I   won&#39;t   remember   what   the   name   is,   but   that   Linux   uh   foundation   collaboration   summit   was   the   first   conference   I   spoke   to.
      </p>

        <cite>Conor</cite>
      <time>8:08</time>
      <p>
          In   2011?
      </p>

        <cite>Bryce</cite>
      <time>8:09</time>
      <p>
          Yeah,   yeah,   it   was   the   first   conference   I   attended,   the   first   one   I   spoke   at   because   they   wanted   me   to   talk   about   um   uh   LLVM,   compiling   LLVM,   compiling   Linux   with   LLVM.   Um   that&#39;s   that&#39;s   crazy.   Hang   on,   but   you   spoke   at   the   first   conference   that   you   went   to.
      </p>

        <cite>Conor</cite>
      <time>8:25</time>
      <p>
          Yeah,   but   that&#39;s   what   I&#39;m   saying   is   that   like   so   10   years   ago   for   you,   you   were   sort   of   already   in   the   C   community.   I   was   in   a   whole   different   uh   education   path/slash   career   path.   I   didn&#39;t   speak   or   go   to   a   tech   conference   until   2019,   which   was   two   years   ago.
      </p>

        <cite>Bryce</cite>
      <time>8:42</time>
      <p>
          I   know,   I   remember   I   was   there   poking   you   with   a   stick,   making   you   speak.
      </p>

        <cite>Conor</cite>
      <time>8:48</time>
      <p>
          It&#39;s   just   crazy   to   think   that   of   the   last   decade,   like   80%   of   it   wasn&#39;t   doing   any   of   this   stuff,   but   like   you   skip   back   a   decade   and   you   were   you   were   starting   that   like   it&#39;s   it&#39;s   uh   we   do   share   a   lot,   you   know.   We&#39;ve   mentioned   this   a   couple   times   about   our   first   languages,   TI   Basic   and   Quasi   dropping   out.   I   mean,   you   actually   did   drop   out   or   kick   got   kicked   out,   and   I   kind   of   got   kicked.   Anyways,   there&#39;s   a   lot   of   similarities,   but   when   you   look,   when   you   compare   the   last   decade   and   where   we   were   at,   that&#39;s   totally   different.   Um   I   was   not   expecting   you   to   say   oh.   I   like   for   some   reason   I   thought   you   were   gonna   say,   Oh,   my   first   time   I   spoke   was   like   at   you   know,   CPPCon   2015   or   16   or   something,   because   I   feel   like   that&#39;s   the   first   YouTube   talk   that   I&#39;ve   seen.   No,   like   that   goes   that   far.
      </p>

        <cite>Bryce</cite>
      <time>9:33</time>
      <p>
          There   is   somewhere   a   recording   of   the   first   talk   that   I   gave   at   BoozCon,   not   the   first,   not   the   talk   I   gave   at   the   the   Linux   Foundation   thing.   Um   there   is   a   recording   of   that   talk   that   I   gave   at   BoozCon   somewhere,   uh,   but   like   very   well   hidden   because   it   was   bad.   I   stayed   up,   I   I   was   up   until   4   a.m.   the   night   before.   It   was   an   8   a.m.   talk   because   I   was   still   making   slides,   and   I&#39;m   I   recall   I   made   a   bunch   of   really   bad   Star   Wars   references.   Yeah,   that   was   a   YouTube?
      </p>

        <cite>Conor</cite>
      <time>10:03</time>
      <p>
          Is   this   on   YouTube?
      </p>

        <cite>Bryce</cite>
      <time>10:04</time>
      <p>
          It   might   be   on   YouTube.   All   right.
      </p>

        <cite>Conor</cite>
      <time>10:06</time>
      <p>
          And   what   year   is   this?   What   year   is   this?
      </p>

        <cite>Bryce</cite>
      <time>10:08</time>
      <p>
          BoostCon   2011.   I   was   talking   about   um   uh   Boost   Spirit   U   Tree,   um   uh   which   was   uh   an   AST   data   type   for   um   Boost   Spirit,   which   is   a   parser   framework,   which   is   the   first   not   not   the   first   thing   I   worked   on   in   Boost,   but   uh   a   project   that   I   rapidly   gravitated   towards.   Um   because   when   I   my   first   exposure   to   Boost   was   I   was   using   it   for   this,   you   know,   as   I   we&#39;ve   discussed   before,   I   you   know   started   learning   to   program   to   write   this   game.   Um   and   then   I   got   you   know,   I   learned   about   Boost   because   I   was   using   it   for   this   game   project,   and   um   I   very   quickly   got   sidetracked   working   on   you   know   Boost.   Um   the   thing   that   I   for   my   first   exposure   to   Boost   was   Boost   String   Algorithms   Split.   Um   I   don&#39;t   remember   why   I   needed   it,   but   it   was   a   text-based   game   that   I   was   working   on.   Uh   they&#39;re   called   MUDs,   multi-user   dungeons   or   dimensions.   And   uh   I   think   I   was   using   BoostString   Algos   Split   to   do   some   tokenization   of   input   lines.   Um   and   there   was   some   bug   in   it,   and   I   like   reported   the   bug   and   like   sent   a   patch   to   fix   the   bug.   Um,   but   then   I   think   from   there   somebody   must   have   told   me   to   use   Boost   Spirit   instead   for   my   parsing   needs,   and   like   that&#39;s   sort   of   how   I   I   got   from   submitting   this   bug   about   um   boost   format   or   boost   boost   string   algorithm   split   to   um   uh   working   on   Boost   Spirit.   Um   and   then   that&#39;s   that&#39;s   how   I   met   Hartmett   Kaiser,   because   he,   you   know,   while   he&#39;s   known   these   days   as   being   the   guy   who   uh   runs   the   HPX   project,   the   parallel   runtime,   um   he   was   also   one   of   the   maintainers   and   founders   of   Boost   Spirit.   And   so   that&#39;s   how   we   initially   connected   was   that   I   was   contributing   to   Boost   Spirit,   and   then   that&#39;s   you   know,   I   randomly   asked   him   for   a   job   on   IRC   having   never   met   him,   and   that&#39;s   when   he   said   you   should   fly   on   down   to   Louisiana.   Yeah.
      </p>

        <cite>Conor</cite>
      <time>12:10</time>
      <p>
          Damn,   ma&#39;am,   you   got   started   so   early.
      </p>

        <cite>Bryce</cite>
      <time>12:12</time>
      <p>
          I   it   was   it   was   really   it   was   really   weird.   I   um   I   like   started   learning   C   ⁇ ,   and   then   three   months   later   I   was   like   I   had   like   commit   access   to   Boost.   And   then   three   months   after   that,   I   was   um,   you   know,   I   was   the   the   the   release   um   manager   for   one   of   the   Boost   Spirit   releases,   and   then   like   three   months   after   that   I   was   speaking   at   BoostCon,   and   then   three   months   after   that   I   was   at   LSU,   and   then   three   months   after   that   Hartman   and   I   were   starting   our   own   research   group,   and   I   had   like   more   responsibilities   than   than   I   uh   I   I   should   have   had   as   a   19   or   20-year-old   college   dropout.   It   was   a   very   it   was   a   very   crazy   period   of   my   life.
      </p>

        <cite>Conor</cite>
      <time>13:02</time>
      <p>
          They   should   make   a   movie.   I&#39;d   watch   it.
      </p>

        <cite>Bryce</cite>
      <time>13:05</time>
      <p>
          I   I   I   I   would   watch   it   too.   Who   would   who   would   play   me   in   the   movie   of   my   life?
      </p>

        <cite>Conor</cite>
      <time>13:10</time>
      <p>
          Shia   LaBeouf.
      </p>

        <cite>Bryce</cite>
      <time>13:16</time>
      <p>
          I   like   how   Connor   had   no   hesitation.   Connor   just   knew.
      </p>

        <cite>Conor</cite>
      <time>13:22</time>
      <p>
          I   just   it&#39;s   it&#39;s   funny   too,   because   like   I   did   not   have   that   pre-prepared,   but   like   it&#39;s   it&#39;s   uh   if   we&#39;re   playing   like   the   young   version   though,   unfortunately   he&#39;s   a   bit   too   old   now.
      </p>

        <cite>Bryce</cite>
      <time>13:32</time>
      <p>
          But   like   No,   no,   no,   but   like   young   Shia   LaBeouf   would   be   perfect   too.
      </p>

        <cite>Conor</cite>
      <time>13:36</time>
      <p>
          Yeah,   would   he   he   would   absolutely   be   perfect?   Um   I   don&#39;t   know   why   that   came   to   mind   so   quickly.   I   don&#39;t   know.   A   young   Tom   Cruise?
      </p>

        <cite>Bryce</cite>
      <time>13:48</time>
      <p>
          I   was   I   was   thinking   Brad   Pitt.   I   was   thinking   Brad   Pitt.   Brad   Pitt?   Yeah.
      </p>

        <cite>Conor</cite>
      <time>13:54</time>
      <p>
          I&#39;m   not   I&#39;m   not   that&#39;s   generous   of   you,   Bryce.
      </p>

        <cite>Bryce</cite>
      <time>13:56</time>
      <p>
          Uh   you   are   a   very   good   looking,   a   very   good   looking   individual.   I   mean,   that&#39;s   uh   I   mean   I   mean   you   said   that&#39;s   very   generous   of   you,   but   you   but   you   led   with   Tom   Cruise.
      </p>

        <cite>Conor</cite>
      <time>14:09</time>
      <p>
          So   uh   that&#39;s   only   because   there   was   a   girl   in   university   that   called   me   Tom   because   she   said   I   looked   like   Tom   Cruise.
      </p>

        <cite>Bryce</cite>
      <time>14:16</time>
      <p>
          Oh   speaking   speaking   of   girls,   speaking   of   girls.   Alright,   well   we   should   probably   we   should   probably   uh   get   to   the   podcast.
      </p>

        <cite>Conor</cite>
      <time>14:24</time>
      <p>
          We   can   we   can   uh   do   something   real   brief   to   round   out   our   talking   about   whatever   we   were   talking   about   um   by   doing   another   real   brief   leak   code   and   BQN   if   you   want.   Um   it&#39;s   a   it&#39;s   a   very   short   solution,   and   I   was   just   I   was   so   in   love   with   it.   Um   I&#39;ve   just   been   I&#39;ve   been   on   a   a   tear   lately.   But   let   me   share   screens   first.   And   actually,   maybe   we&#39;ll   do   it,   we&#39;ll   see   how   quickly   we   can   do   this.   What   is   it?   8   637.   We   probably   chatted   for   15   minutes.   Let&#39;s   see   if   we   can   solve   this   in   both   C.   I&#39;ll   type,   you   tell   me   what   to   type   in   Godbolt.   Oh   yeah.   So   here&#39;s   the   here&#39;s   the   problem.
      </p>

        <cite>Bryce</cite>
      <time>15:12</time>
      <p>
          Yeah.
      </p>

        <cite>Conor</cite>
      <time>15:12</time>
      <p>
          Find   or   do   you   want   to   read   it?   I&#39;ll   read   it.   Uh   find   target   indices   after   sorting   array.   You&#39;re   given   a   zero   index   integer,   array   nums,   and   a   target   element   target.   A   target   index   is   an   index.
      </p>

        <cite>Bryce</cite>
      <time>15:26</time>
      <p>
          Okay.
      </p>

        <cite>Conor</cite>
      <time>15:27</time>
      <p>
          A   target   index   is   an   index   i   such   that   uh   the   index   of   your   array   nums   is   equal   to   the   target.   And   the   question   asks   you   to   return   a   list   of   the   target   indices   of   your   array   nums   after   sorting   nums   in   non-decreasing   order.   Um   and   if   there&#39;s   no   target   indices,   just   return   an   empty   list.   So   for   example,   I&#39;m   so   confused.   If   your   list   is   one,   two,   five,   two,   three,   and   your   target   is   two,   after   sorting   your   uh   array   nums,   it   would   be   one,   two,   two,   three,   five,   and   then   you   just   need   to   return   all   the   indices   that   are   equal   to   your   target   value.   So   because   two   is   your   target   value,   that   corresponds   to   index   one   and   index   two.
      </p>

        <cite>Bryce</cite>
      <time>16:12</time>
      <p>
          Alright,   I   understand.   You&#39;re   only   ever   given   one   target?
      </p>

        <cite>Conor</cite>
      <time>16:14</time>
      <p>
          Correct,   one   target.   Um   and   so   the   second   example   is   the   same   list,   one,   two,   five,   two,   three.   Your   target   now   is   three.   And   if   you   sort   this,   once   again,   it&#39;s   one,   two,   two,   three,   five,   and   the   three   is   in   index   three,   so   that&#39;s   your   answer.   The   third   example   is   uh   target   equal   to   five,   same   list.   If   you   sort   it,   five   is   gonna   be   the   last   number   in   the   list,   which   will   be   equal   to   index   four.   And   then   if   your   target   is   four,   that   value   doesn&#39;t   show   up   in   one,   two,   five,   two,   three.   So   you   end   up   with   an   empty   list.   Let&#39;s   head   over   to,   so   let&#39;s   copy.   Let&#39;s   copy.   Or   actually,   we   can   do   it   straight   in   here.   What   are   we   talking   about?   What   are   we   talking   about?   Um   let&#39;s   zoom   in   and   change   this   to   auto.   Um,   so   we&#39;ve   got   target   indices   as   a   function.   It   takes   a   vector.
      </p>

        <cite>Bryce</cite>
      <time>17:07</time>
      <p>
          Why   is   there   a   class   here?   I&#39;m   I&#39;m   so   confused.
      </p>

        <cite>Conor</cite>
      <time>17:10</time>
      <p>
          Um   that&#39;s   just   the   way   that   it   works   for   lead   code.
      </p>

        <cite>Bryce</cite>
      <time>17:13</time>
      <p>
          That&#39;s   it   should   be   a   function.   And   actually   who   do   I   who   do   I   call   about   that?
      </p>

        <cite>Conor</cite>
      <time>17:20</time>
      <p>
          The   lead   code   folks.   Um   Java   nonsense.   How   do   you   want   to   solve   this,   man?   What   do   you   want   to   do?
      </p>

        <cite>Bryce</cite>
      <time>17:28</time>
      <p>
          Well,   so   I   mean,   my   first   thought   is   that   we   want   to   sort   the   array,   but   I   was   actually   I   was   actually   wondering   whether   we   could   um   I   wonder   if   they   have   that.
      </p>

        <cite>Conor</cite>
      <time>17:39</time>
      <p>
          I   wonder   if   they   have   um   C   ⁇   20.   What   do   you   think?
      </p>

        <cite>Bryce</cite>
      <time>17:45</time>
      <p>
          So   I   I   mean   I   mean   obviously   we   have   to   sort   the   array,   but   I   I&#39;m   just   wondering   whether   we   can   whether   we   can   somehow   we   have   to   go   through   we   have   to   perform   the   work   that   would   be   involved   in   sorting   the   array,   but   I   wonder   whether   whether   um   calling   std   sort   is   actually   the   the   best   way   to   do   this.   Connor   tried   calling   std   ranges   sort   um   and   discovered   that   leak   code.
      </p>

        <cite>Conor</cite>
      <time>18:10</time>
      <p>
          Yeah,   I   think   they   only   have   C   plus   plus   17.
      </p>

        <cite>Bryce</cite>
      <time>18:13</time>
      <p>
          Um   have   C20,   which   is   not   shocking   to   me   given   that   the   like   leak   code   structure   for   a   problem   is   like   very   clearly   like   90s   um   object-oriented   C.   Uh   no   offense   to   anybody   that   works   at   lead   code,   but   a   little   bit   of   offense   was   intended.
      </p>

        <cite>Conor</cite>
      <time>18:32</time>
      <p>
          So   we&#39;ve   sorted   our   array.   What   do   we   want   to   do   next?   Go   back   up   to   the   problem.   Actually,   you   know   what?   We   definitely   we&#39;re   switching,   we&#39;re   switching   to   C   we&#39;re   switching   to   gobble,   because   I   want   C20.   I   ain&#39;t   messing   around.
      </p>

        <cite>Bryce</cite>
      <time>18:47</time>
      <p>
          So   you   want   to   find   I   mean,   call   std   find.
      </p>

        <cite>Conor</cite>
      <time>18:52</time>
      <p>
          Why   do   we   need   stdfind?
      </p>

        <cite>Bryce</cite>
      <time>18:54</time>
      <p>
          We&#39;d   we&#39;d   call   std   find   because   we   need   to   figure   out   where   the   uh   we   need   we   need   to   find   the   first   element   in   the   sorted   list   that   matches   um   the   target.   And   what   we   really   need   is   like   an   equal   range.   Something   like   that.   An   algorithm.
      </p>

        <cite>Conor</cite>
      <time>19:20</time>
      <p>
          It   is   an   algorithm.
      </p>

        <cite>Bryce</cite>
      <time>19:22</time>
      <p>
          There   we   go.   CI   know   stuff.
      </p>

        <cite>Conor</cite>
      <time>19:25</time>
      <p>
          Uh   I   guess   we   need   to   do   include   range.
      </p>

        <cite>Bryce</cite>
      <time>19:29</time>
      <p>
          Although   Yeah,   for   forget   find.   We   should   just   be   calling   equal   range,   right?   Which   is   not   actually   uh   a   C20   thing.   Equal   range   was   an   algorithm   uh   pre-C   plus   plus   20.   Um   before   there   was,   you   know,   a   notion   of   ranges   in   the   language.   Or   a   no   a   no   the   notion   of   ranges   in   the   language   that   we   currently   have.   Equal   range,   you   give   it   um   you   give   it   uh   uh   a   pair   of   iterators   and   a   value,   and   it   returns   you   a   pair   of   iterators,   which   is   um   all   the   elements   uh   that   are   equal   to   the   value,   and   it   expects   that   the   input   sequence   is   partially   ordered   with   respect   to   the   value,   um,   which   is   gonna   be   the   case   here   because   we&#39;ve   we&#39;ve   done   this   sort.   Wait,   okay,   hang   on,   hang   on,   hang   on.   Um   we   only   we   only   need   to   sort   until   I&#39;m   not   convinced   that   we   need   to   sort   the   entire   array,   right?   Because   we   only   need   to   like   sort   up   until   we&#39;ve   gotten   to   gotten   to   the   the   the   the   target   that   we&#39;re   looking   for.   And   I&#39;m   wondering   if   there&#39;s   some   clever   sorting   algorithm   that   lets   us   only   sort.
      </p>

        <cite>Conor</cite>
      <time>20:50</time>
      <p>
          Um   so   what   is   this   gonna   return?   This   is   gonna   return   us   probably   a   pair?
      </p>

        <cite>Bryce</cite>
      <time>20:54</time>
      <p>
          A   pair,   yeah,   a   pair.   What   are   you   doing,   D?   Aren&#39;t   you   gonna   be   destructuring   that?
      </p>

        <cite>Conor</cite>
      <time>20:59</time>
      <p>
          They&#39;re   gonna   be   iterators,   but   yeah,   we   probably   can   do   that.   So   let&#39;s   do   first.
      </p>

        <cite>Bryce</cite>
      <time>21:03</time>
      <p>
          Okay,   so   so   we   have   the   iterators   and   it   wants   us   to   return   the   indices.
      </p>

        <cite>Conor</cite>
      <time>21:07</time>
      <p>
          Yeah.
      </p>

        <cite>Bryce</cite>
      <time>21:09</time>
      <p>
          Um   well   then   uh   we&#39;re   gonna   take   those   iterators,   those   are   gonna   be   random   access   iterators,   so   we   can   just   um   we   can   just   do   some   some   pointer   arithmetic.
      </p>

        <cite>Conor</cite>
      <time>21:26</time>
      <p>
          Um   yeah,   we   have   currently   we   have   std   colon   ranges,   colon   colon   sort,   and   then   we&#39;ve   got   structured   bindings,   uh   f   comma   l   equals   std   colon   ranges,   colon   colon   equal   range,   and   if   we   dereference   both   F   and   L,   it   gives   us   the   values   two   and   three.   And   so   now   we   just   need   to   get   the   indices   which   correspond   to   basically   what?
      </p>

        <cite>Bryce</cite>
      <time>21:52</time>
      <p>
          Wait,   why   is   it   given   it&#39;s   giving   us   two?   Yeah,   so   so   so   what   we   need   to   do   is   we   need   to   um   uh   just   do   some   uh   some   Iterator   arithmetic   here.   Yeah,   yeah,   sure.   You   can   call   distance.   Sure.   Oh,   you   just   want   to   figure   out   like   how   many   there   are.   Sure,   fine.   That&#39;s   okay.   Oh,   actually   we   can   we   can   um   we   can   use   iota   here.
      </p>

        <cite>Conor</cite>
      <time>22:18</time>
      <p>
          That   was   what   I   was   thinking.
      </p>

        <cite>Bryce</cite>
      <time>22:20</time>
      <p>
          Yeah,   because   if   if   the   answer   is   more   than   one   element,   um   then   it&#39;s   gonna   be   they&#39;re   gonna   be   consecutive.   Um   so   we   just   need   to   figure   out   um   we   just   need   to   figure   out   uh   the   starting   value   for   iota,   which   is   gonna   be   um   the   distance   from   uh   the   beginning   of   uh   the   input   to   that   first   element   that   we   found.   Um   and   the   we   want   I   we   we&#39;ll   want   iota   for   um   the   the   the   size   of   the   output   is   gonna   be   because   we&#39;ll   we&#39;ll   just   we&#39;ll   just   yeah   yeah   you   I   see   what   you&#39;re   doing   there.   So   you&#39;re   you&#39;re   creating   a   std   vector   with   default   initialized   ints.   Um   and   then   uh   uh   and   you   figure   out   how   many   there   are   by   taking   the   distance   of   from   the   the   uh   start   of   the   equal   range   to   the   end   of   the   equal   range.   Um   and   then   it   that   start   should   be   S   there.   Um   I&#39;m   not   doing   a   great   job   of   explaining   this   for   the   listener.   Um   but   uh   but   yeah,   okay.   So   I   mean   there&#39;s   there&#39;s   two   things   that   you   gotta   figure   out   here,   um,   which   is   how   many   um   how   many   indices   are   you   returning,   and   you   do   that   by   computing   the   distance   between   the   uh   the   uh   iterator   to   the   start   of   the   equal   range   and   the   iterator   to   the   end   of   the   equal   range.   And   then   you   need   to   figure   out   what   is   the   first   indices   index   that   you&#39;re   returning,   um,   and   you   figure   that   out   by   computing   the   distance   from   the   first   iterator   in   the   input   to   the   first   iterator   that   that   matched   the   first   iterator   of   the   equal   range.   Um   and   then   you   create   a   vector   of   n   elements,   which   is   however   many   elements   uh   uh   you&#39;ve   determined   are   in   this   equal   range.   Um   and   then   you   do   a   std   iota   on   that   vector,   and   the   initial   value   for   the   iota   is   the   distance   from   uh   that   starting   distance   that   you   computed,   which   was   the   distance   from   uh   the   beginning   uh   iterator   to   the   input   to   the   first   iterator   from   the   equal   range.   Yeah,   that   made   sense   to   me.   I&#39;m   not   sure   that   anybody   that&#39;s   listening   is   gonna   follow   anything   that   I   just   I   think   it   was   pretty   clear.
      </p>

        <cite>Conor</cite>
      <time>24:44</time>
      <p>
          You   know,   you   sort,   you   stood   range   is   sort,   then   you   stood   range   is   equal   range.   Then   you   yeah,   you   have   to   do   a   little   sort   of   figuring   out   what   is   the   index   of   the   start   of   your   equal   range,   and   then   you   need   to   create   a   vector   and   then   use   iota   to   fill   the   indices   using   that   sort   of   start.
      </p>

        <cite>Bryce</cite>
      <time>25:01</time>
      <p>
          Um   But   but   do   you   do   you   really   need   to   sort   the   entire   thing?
      </p>

        <cite>Conor</cite>
      <time>25:06</time>
      <p>
          You   don&#39;t   need   to   sort   it   at   all   technically,   but   I   mean   this   is   the   direction   I   was   hoping   you&#39;d   go   because   it&#39;s   it&#39;s   I   mean,   if   you   look   at   the   input.
      </p>

        <cite>Bryce</cite>
      <time>25:14</time>
      <p>
          In   my   defense,   the   first   thing   I   said   is,   well,   my   nit   my   my   intuition   is   to   sort   it,   but   I&#39;m   wondering   if   we   don&#39;t   have   to   do   that.   So   when   you   tell   me   later   that   I   don&#39;t   need   to   actually   sort   this   thing,   I   just   want   it   on   the   record   that   my   first   gut   reaction   was,   I   don&#39;t   think   we   have   to   sort   this.
      </p>

        <cite>Conor</cite>
      <time>25:30</time>
      <p>
          Yeah.
      </p>

        <cite>Bryce</cite>
      <time>25:31</time>
      <p>
          The   reason   that   I   don&#39;t   think   that   we   need   to   sort   this   and   that   it&#39;s   inefficient   to   sort   this   is   um   you   don&#39;t   care   about   the   order   of   the   things   after   the   the   target   index.
      </p>

        <cite>Conor</cite>
      <time>25:42</time>
      <p>
          You   don&#39;t   even   really   care   about   the   order   before   either.
      </p>

        <cite>Bryce</cite>
      <time>25:45</time>
      <p>
          Right.   That&#39;s   that   also   is   true.   Right,   right,   right,   right,   right.   All   you   care   about   all   you   care   about   is   how   many   are   in   each   of   those.
      </p>

        <cite>Conor</cite>
      <time>25:55</time>
      <p>
          Exactly,   exactly.   So   you   can   technically   do   this   in   l   in   linear   time.
      </p>

        <cite>Bryce</cite>
      <time>25:58</time>
      <p>
          Um   but   do   we   use   partition   here?
      </p>

        <cite>Conor</cite>
      <time>26:02</time>
      <p>
          I   mean,   if   I   were   gonna   solve   it   in   the   linear   time   method,   I&#39;d   just   do   two   count   ifs.   Count   if   less,   count   if   equal.   Then   you&#39;ve   got   your   values   that   you   need   in   order   to   use   iota.
      </p>

        <cite>Bryce</cite>
      <time>26:15</time>
      <p>
          Walk   me   through   that.
      </p>

        <cite>Conor</cite>
      <time>26:16</time>
      <p>
          So   say   so   here   your   target   value   is   two,   count   if   less   than   two   is   gonna   give   you   one.   And   then   count   if   equal.   What?
      </p>

        <cite>Bryce</cite>
      <time>26:26</time>
      <p>
          Bastard.   That&#39;s   very   clever.
      </p>

        <cite>Conor</cite>
      <time>26:28</time>
      <p>
          And   then   count   if   equal   gives   you   your   basically   so   you   so   here   in   our   solution   that   we&#39;re   looking   at,   we   have   n,   which   is   the   number   of   equal   elements,   and   then   start,   which   is   the   distance   between   the   equal   range,   beginning   of   the   equal   range,   result   of   equal   range,   and   the   start   of   the   array.   You   can   get   those   two   values   by   just   doing   count   ifs   with   uh   lambdas,   one   that   checks   less   than   target   value,   one   that   checks   equal   to.   However,   I&#39;m   glad   you   went   with   the   sort   because   we&#39;re   gonna   hop   over   to   BQN   now.   And   we&#39;re   looking   at   one,   two,   three,   four,   five,   six,   seven   lines.   But   you   know,   you   could   code   golf   this   if   we   had   access   to   like   thrusts   um   uh   counting   iterator.   We   could   just   we   could   reduce   the   last   three   lines   into   a   single   line   with   a   range   constructor   and   sort   of   creating   this   in   place   in   a   constructor   instead   of   having   a   constant   iota.
      </p>

        <cite>Bryce</cite>
      <time>27:17</time>
      <p>
          Why   aren&#39;t   we   returning   an   iota   view   here?
      </p>

        <cite>Conor</cite>
      <time>27:19</time>
      <p>
          Um   because   the   question   asks   you   to   turn   a   vector   and   those   are   not   implicitly.
      </p>

        <cite>Bryce</cite>
      <time>27:24</time>
      <p>
          The   question   is   ill   form.   You   can&#39;t   do   anything   with   views.
      </p>

        <cite>Conor</cite>
      <time>27:34</time>
      <p>
          That&#39;s   true.   We   can   we   can   uh   let&#39;s   see   what   happens   if   we   go,   we   delete   these   last   three   lines   and   we   go   return   uh   stud.   Is   it   views   or   view?   View   um   iota,   and   we&#39;re   gonna   go   with   start   and   start   plus   n.   And   you   said   it   was   views,   but   um   actually   maybe   that&#39;s   because   I&#39;m   not   including   the   range   header.   Compiling,   compiling,   and   it   looks   like   that   is   correct.   So   yeah,   we&#39;ve   we&#39;ve   reduced   it   if   we   loosen   the   restrictions   of   this   to   one,   two,   three,   four,   five   lines   of   code.   First   one   sort,   second   one   is   ranges   equal   range.   Um   then   there&#39;s   two   std   distances   to   get   n   and   start,   and   then   we&#39;re   returning   a   view   Ziota   using   start   and   start   plus   n.   So   not   too   bad.   Five   lines,   pretty,   pretty   nice   in   my   opinion.   Um,   sure   there&#39;s   more   performant   code   uh   doing   the   linear   stuff,   but   I   like   this   solution   quite   a   bit.   And   now   let&#39;s   do   go   and   do   something   similar   in   BQM.   So   let&#39;s   hop   over   to   our   next   gen   APL.   Stay   tuned   for   part   two   next   week.   Thanks   for   listening.   We   hope   you   enjoyed   and   have   a   great   day.
      </p>