Bobinas P4G
  • Login
  • Public

    • Public
    • Groups
    • Popular
    • People

Conversation

Notices

  1. La FĂ©e Verte (absinthe@qoto.org)'s status on Thursday, 17-Oct-2019 02:20:36 UTC La Fée Verte La FĂ©e Verte
    • 🎓 Dr. Freemo :jpf: đŸ‡łđŸ‡±
    • Kyle

    @khird @freemo It is pretty well cleaned up now. and I fleshed out the list a little to make it iterable and printable and stuff. Take a peek!

    Please suggest one, just remember to include the hash tag

    #toyprogrammingchallenge

    In conversation Thursday, 17-Oct-2019 02:20:36 UTC from qoto.org permalink
    • 🎓 Dr. Freemo :jpf: đŸ‡łđŸ‡± repeated this.
    • La FĂ©e Verte (absinthe@qoto.org)'s status on Tuesday, 15-Oct-2019 16:40:58 UTC La Fée Verte La FĂ©e Verte

      #toyprogrammingchallenge

      Second Freebie!!! This one is marked as "easy"

      This problem was asked by Google.

      Given two singly linked lists that intersect at some point, find the intersecting node. The lists are non-cyclical.

      For example, given A = 3 -> 7 -> 8 -> 10 and B = 99 -> 1 -> 8 -> 10, return the node with value 8.

      In this example, assume nodes with the same value are the exact same node objects.

      Do this in O(M + N) time (where M and N are the lengths of the lists) and constant space.

      In conversation Tuesday, 15-Oct-2019 16:40:58 UTC permalink
      🎓 Dr. Freemo :jpf: đŸ‡łđŸ‡± repeated this.
    • La FĂ©e Verte (absinthe@qoto.org)'s status on Wednesday, 16-Oct-2019 00:48:44 UTC La Fée Verte La FĂ©e Verte

      #toyprogrammingchallenge

      https://git.qoto.org/Absinthe/listoverlap

      In conversation Wednesday, 16-Oct-2019 00:48:44 UTC permalink

      Attachments


      🎓 Dr. Freemo :jpf: đŸ‡łđŸ‡± repeated this.
    • Kyle (khird@qoto.org)'s status on Thursday, 17-Oct-2019 00:35:33 UTC Kyle Kyle
      • 🎓 Dr. Freemo :jpf: đŸ‡łđŸ‡±

      @Absinthe

      The code isn't that bad, you just have to be careful you don't go down a dead end with your algorithm. It's much easier to add error checking etc. at the end if you designed a versatile solution than it is to try and generalise one of the more brittle ones.

      Would you mind if I suggested a challenge? I have one involving graph manipulation, which is kind of up @freemo's alley.

      In conversation Thursday, 17-Oct-2019 00:35:33 UTC permalink
      🎓 Dr. Freemo :jpf: đŸ‡łđŸ‡± repeated this.
    • 🎓 Dr. Freemo :jpf: đŸ‡łđŸ‡± (freemo@qoto.org)'s status on Thursday, 17-Oct-2019 07:50:10 UTC 🎓 Dr. Freemo :jpf: 🇳🇱 🎓 Dr. Freemo :jpf: đŸ‡łđŸ‡±
      in reply to
      • Kyle

      @Absinthe

      Sorry been super busy but I will check it out soon.

      @khird

      In conversation Thursday, 17-Oct-2019 07:50:10 UTC permalink

Feeds

  • Activity Streams
  • RSS 2.0
  • Atom
  • Help
  • About
  • FAQ
  • Privacy
  • Source
  • Version
  • Contact

Bobinas P4G is a social network. It runs on GNU social, version 2.0.1-beta0, available under the GNU Affero General Public License.

Creative Commons Attribution 3.0 All Bobinas P4G content and data are available under the Creative Commons Attribution 3.0 license.