addressalign-toparrow-leftarrow-rightbackbellblockcalendarcameraccwcheckchevron-downchevron-leftchevron-rightchevron-small-downchevron-small-leftchevron-small-rightchevron-small-upchevron-upcircle-with-checkcircle-with-crosscircle-with-pluscontroller-playcrossdots-three-verticaleditemptyheartexporteye-with-lineeyefacebookfolderfullheartglobegmailgooglegroupshelp-with-circleimageimagesinstagramFill 1light-bulblinklocation-pinm-swarmSearchmailmessagesminusmoremuplabelShape 3 + Rectangle 1ShapeoutlookpersonJoin Group on CardStartprice-ribbonprintShapeShapeShapeShapeImported LayersImported LayersImported Layersshieldstartickettrashtriangle-downtriangle-uptwitteruserwarningyahoo

JS Study Group: Algorithms

Every other week we will be getting together to solve one large or a series of small algorithm puzzles in pairs or small groups. This is a highly interactive and supportive group to explore our understanding of Javascript and different algorithm concepts. We welcome all levels of JS experience!

Typical Agenda

8:00-8:10 - icebreaker/introduction/announcements
8:10-8:20 - present and discuss the algorithm(s)
8:20-9:15 - pair off and solve algorithm(s)
9:15-9:30ish - discuss solutions as a group

Join or login to comment.

  • Manoj K.

    I have been thinking about the "probability" that can be assigned to a link that can help us select the good links to try first. The problem is that "probability" cannot be an attribute of just the link. It has to be a function of the final target node and the link. One possibility is that we should give more priority to those links whose immediate target node (node_next) is "closer" to the final target node (node2) in some way. The amount of "closeness" can be "computed" by considering if node_next and node2 went to same school(s), work for same company now or worked anytime before in the same company, have same interests, have joined same groups, like same pages, belongs to same family etc.

    Any more ideas how we can prioritize the list?

    December 5, 2013

  • Gregory H.

    December 3, 2013

  • Gregory H.

    For everyone who asked about the google hangout we will discuss it and post our reply here.

    December 3, 2013

  • Damien

    ery interesting solutions! Here is the Dijkstra's Algorithm video:

    December 3, 2013

  • A former member
    A former member

    Someone else in our group also made another interesting suggestion in passing. Couldn't you solve the whole thing with a few lines of very recursive code? [Bear with this pseudo code, cobbled together from a couple different languages...]

    getDistance(graph, node 1, node2) {

    function LookForNode2(nodeToCheck){
    array contacts = getContacts(nodeToCheck);
    if indexOf(contacts, node2) > -1 {return distance; exit}
    else distance ++;
    foreach(x=contacts) {

    December 3, 2013

  • Peter G.

    Super awesome and informative!

    December 2, 2013

  • A former member
    A former member

    Is there any chance this could be a Google Hangout? I'd love to join in from Atlanta!

    1 · November 27, 2013

    • Paul T.

      would also REALLY love to see the content of this meetup, all the way up here in Vancouver Canada.

      December 2, 2013

    • Crywolfe

      I would also like to participate if it is a Google Hangout... I am in North Dakota...

      December 2, 2013

  • tomas

    Oakland urban design firm seeks experienced developer/co-founder for GIS-based web app for our clients.
    Development of full stack - database + ruby + front end web - or similar w javascript, node, etc.
    We are in the early stages of concept development, and are looking to move quickly. We have prospective clients awaiting development of the technology. Will discuss details as part of our interview process.
    If interested please contact tomas [at] oppsites [dot] com

    December 2, 2013

  • A former member
    A former member

    I would love to come but I live in Seattle. I look forward to the upcoming Google Hangout session though.

    1 · November 26, 2013

35 went

People in this
Meetup are also in:

Sign up

Meetup members, Log in

By clicking "Sign up" or "Sign up using Facebook", you confirm that you accept our Terms of Service & Privacy Policy