GDSC February Monthly Challenge

It is time for a monthly challenge! GDSC @ Conestoga is conducting the first monthly challenge where you will be working on a data structure or data algorithm coding question.

Feb 1, 2022, 5:00 AM – Mar 1, 2022, 4:59 AM

10
RSVP'd

RSVP Now

Key Themes

Career Development

About this event

It is time for a monthly challenge! GDSC @ Conestoga is conducting the first monthly challenge where you will be working on a data structure or data algorithm coding question.

Task

Write a function that takes a non-empty array and returns a quadruple* that matches a targeted sum. The order of returned quadruples does not matter. If no array is found that matches the target sum, return an empty array. Feel free to use any programming language.

Function Signature:

Array<Array<number>> function(Array<number> inputArray, int targetSum) {
                        // your code goes here
}

Sample Input:

inputArray = [7,6,4,-1,1,2]
targetSum = 16

Sample Output:

[[7,6,4,-1], [7,6,1,2]]

* quadruple is an array that contains only 4 elements


You can submit your solution here (put your code on your public Github repo): Monthly Challenge Submission Link. Your solution will be evaluated by the time and space complexity, and the winners will be announced at the end of the month. You will get additional points for writing tests for your code.


Any questions? Reach out to GDSC Lead (Oleksandr Levinskyi) on Discord.

We are looking forward to receiving your submissions!

Thank you,

Conestoga GDSC Team

Organizers

  • Maísa Wolff Resplande

    GDSC Lead

  • Gavin Abeele

    Vice Lead

  • Oleksandr Levinskyi

    Mentor

  • Emil Harvey

    Executive Lead

  • Cyril Kamal

    Executive Lead

  • Sanjay Sekar Samuel

    Executive Lead

  • Oscar Pinzon

    Executive Lead

  • Jun Cai

    Executive Lead

  • Ryan Dooley

    Executive Lead

  • Anish Reddy

    Executive Lead

  • Owen Garland

    Executive Lead

  • Michelle Gordon

    Executive Lead

  • Aniedi Udo-Obong

    Regional Leader

Contact Us