Neoalgo: smallest Subarray with given sum

Created on 27 Aug 2020  路  10Comments  路  Source: TesseractCoding/NeoAlgo

馃殌 Feature

Given an unsorted array of integers(including negative numbers), find the smallest subarray which adds to a given number.

Have you read the Contributing Guidelines on Pull Requests?

YES

Motivation

(Please outline the motivation for the proposal.)

Pitch

(Please explain why this feature should be implemented and how it would be used.)

Assignees

  • C: @yashsahay2014
  • C++: @Joshitha18
  • Java: @sahanabalappa
  • Python: @shraddhavp
CH20 Java Python easy no-issue-activity

All 10 comments

I'd like to work on it in C++ @Kajol-Kumari

I'd like to work on it in java

I'd like to work on it in C @Joshitha18

@Joshitha18 let's tweak the issue a little bit `find the smallest sub-array that sums to the given number. Please make this modification in the issue description.

@Kajol-Kumari done

Can we work on python for this issue @Joshitha18

We are logging the scores for the Contributor's Hack 2020. If you have one or more than one PR merged during the program, make sure to fill this form

would like to take this issue in python @iamrajiv

@plazzy99 sir what is the difficulty level for this issue to fill in the form?

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Telegram or ping one of the reviewers. Thank you for your contributions!

Was this page helpful?
0 / 5 - 0 ratings

Related issues

shivangi00 picture shivangi00  路  7Comments

TEJASWI-TEJASWI picture TEJASWI-TEJASWI  路  7Comments

HarshCasper picture HarshCasper  路  11Comments

sukritidawar picture sukritidawar  路  7Comments

sharur7 picture sharur7  路  9Comments