Skip to content

kupras06/dailyCodingProblemSolutions

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

14 Commits
 
 
 
 

Repository files navigation

dailyCodingProblemSolutions

This is my first Repository after understanding GitHub(partially though). I have subscribed to the https://www.dailycodingproblem.com/ site (this is where i recieve questions from). I have only the basic version though (no Bucks).I try the solutions but have no place to check it (if exists i am unaware of it when i started this repo). I would appreciate the pro of this world to improve it if it is naive(of course cause it would help me grow). If you area beginner like me I encurage you to subscribe there (premium version if possible,cause it will be better). HAPPY CODING

Problem 1: Given a list of numbers and a number k, return whether any two numbers from the list add up to k. For example, given [10, 15, 3, 7] and k of 17, return true since 10 + 7 is 17. Challenge : Can you do this in one pass?

Solution

Problem 2: Given an array of integers, return a new array such that each element at index i of the new array is the product of all the numbers in the original array except the one at i. For example, if our input was [1, 2, 3, 4, 5], the expected output would be [120, 60, 40, 30, 24]. If our input was [3, 2, 1], the expected output would be [2, 3, 6]. Challenge : what if you can't use division?

Solution

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages