paulndam's repositories

BMarket-II

An E-commerce website made for simple user interfaces such as, users can select items or products they want to purchase and place the order for the item. Users can checkout using payment methods such as paypal and stripe and as well as track their orders , including many other functionalities as well. Please check out the live site below

Language:JavaScriptStargazers:0Issues:0Issues:0
Language:JavaScriptStargazers:0Issues:0Issues:0
Language:JavaScriptStargazers:0Issues:0Issues:0
Language:HTMLStargazers:0Issues:0Issues:0
Language:JavaScriptStargazers:0Issues:0Issues:0

collatz-conjecture

The Collatz Conjecture or 3x+1 problem can be summarized as follows: Take any positive integer n. If n is even, divide n by 2 to get n / 2. If n is odd, multiply n by 3 and add 1 to get 3n + 1. Repeat the process indefinitely. The conjecture states that no matter which number you start with, you will always reach 1 eventually. Given a number n, return the number of steps required to reach 1.

Language:JavaScriptStargazers:0Issues:0Issues:0
Language:JavaScriptStargazers:0Issues:0Issues:0
Language:JavaScriptStargazers:0Issues:0Issues:0
Language:JavaScriptStargazers:0Issues:0Issues:0
Language:JavaStargazers:0Issues:0Issues:0
Language:JavaStargazers:0Issues:0Issues:0
Language:JavaStargazers:0Issues:0Issues:0
Language:JavaStargazers:0Issues:0Issues:0
Language:JavaStargazers:0Issues:0Issues:0
Language:JavaStargazers:0Issues:0Issues:0
Language:JavaStargazers:0Issues:0Issues:0
Language:JavaStargazers:0Issues:0Issues:0
Language:JavaStargazers:0Issues:0Issues:0
Language:JavaScriptStargazers:0Issues:0Issues:0
Language:JavaScriptStargazers:0Issues:0Issues:0
Language:JavaScriptStargazers:0Issues:0Issues:0
Language:JavaScriptStargazers:0Issues:0Issues:0
Language:JavaScriptStargazers:0Issues:0Issues:0
Language:JavaScriptStargazers:0Issues:0Issues:0
Language:HTMLStargazers:0Issues:0Issues:0
Language:JavaScriptStargazers:0Issues:0Issues:0
Language:JavaScriptStargazers:0Issues:0Issues:0
Language:JavaScriptStargazers:0Issues:0Issues:0

Two-Sums

Given an array of numbers, with a given target as well, write a function that determines if the numbers in the array will result to the given target number.

Language:JavaScriptStargazers:0Issues:0Issues:0

Unique-Values

function that adds two m=numbers in an array, if the sum of those numbers added is zero , then it return the array with those numbers. function that accepts a sorted array and counts the unique values in the array, negative numbers can be included in the array.

Language:JavaScriptStargazers:0Issues:0Issues:0