Merge branch 'master' into powershell-strong-pw

Author: wzhouwzhou

.gitignore

@@ -253,3 +253,4 @@ Module.symvers
 Mkfile.old
 dkms.conf
 /.vs
+.Rproj.user

CONTRIBUTORS.md

@@ -445,6 +445,11 @@ Place: Nigeria </br>
 Coding Experience: Python and javaScript. </br>
 Email: [email protected] </br>
 
+Name: [Roger Seekell](https://github.com/rpstester) <br />
+Place: Earth<br />
+Coding Experience: C++, C#, Java, PowerShell<br />
+Email: [email protected]<br />
+
 Name: [Abhay yadav](https://github.com/predator21x) </br>
 place: India. </br>
 Coding Experience: a newbie in this field. Programming language: C, python. </br>
@@ -455,7 +460,12 @@ Place: India </br>
 Coding Experience: C and python. </br>
 Email: [email protected] </br>
 
-Name: [Sazeim Saheem](https://github.com/ZombieChibiXD) </br>
+Name: [Isak Rabin](https://github.com/sgirabin)
+Place: Singapore
+Coding Experience: Java
+Email: [email protected]
+
+Name: [Zombie Chibi XD](https://github.com/ZombieChibiXD) </br>
 Place: Bali, Indonesia </br>
 Field Experience: System Administrator, Junior web developer, beta-tester, and debugger </br>
 Coding Experience: 3 years of learning & coding experience in C++, Java, Javascript/NodeJS, PHP, Vue.js, Laravel Framework, GoLang and python. </br>
@@ -465,4 +475,14 @@ Name: [Oyvind Nilsen](https://github.com/turbosnute) </br>
 Place: Trondheim, Norway </br>
 Field Experience: System Admin </br>
 Coding Experience: 10 years of Powershell scripting. Also some experience with Java, Js, PHP, Python and C#. </br>
-Email: [email protected] </br>
+Email: [email protected] </br>
+
+Name: [Jay](https://github.com/TacticalTechJay) </br>
+Place: Milky Way Galaxy </br>
+Coding Experience: Semi-noob in JS. </br>
+Email: [email protected] </br>
+
+Name: [David](https://github.com/Xander1233) </br>
+Place: Frankfurt, Germany </br>
+Coding Experience: TS, JS/NodeJS, Java, C, C++, C#, Assembly, React
+Email: [email protected] </br>

README.md

@@ -8,7 +8,7 @@ Have some fun with coding every once in a while, and see how you can abuse the s
 ### Contributing
 Anyone can contribute to this repo by opening a PR, your contribution will be open-source on Github. Don't know what to make? Try coding something that logs "Hello, world!" to the console!
 
-### Hacktoberfest 2019
+### Hacktoberfest 2021
 Celebrate [Hacktoberfest](https://hacktoberfest.digitalocean.com/) together with a diverse community of developers from around the world!
 
 ### PRs not marked as spam will be counted towards **4** PRs in the month of October for your **free Hacktoberfest T-Shirt!**

coffeescript/wzhouwzhou_add.coffee

@@ -0,0 +1 @@
+add = (a, b) -> a + b

coffeescript/wzhouwzhou_subtract.coffee

@@ -0,0 +1 @@
+subtract = (a, b) -> +a - +b

cplusplus/ZombieChibiXD_Palindrome.cpp

@@ -0,0 +1,13 @@
+#include <iostream>
+#include <string>
+
+bool isPalindrome(std::string input)	{	return input == std::string(input.rbegin(), input.rend());	}
+
+int main()
+{
+  std::string input = "able was I ere I saw elba" ;
+  //std::cout << "Input : ";
+  //getline (std::cin, input);
+  std::cout << "It is " << (isPalindrome(input) ? "" : "not ") << "a palindrome";
+}
+

honorary-one-line-wonders/javascript/vetlix_array_map.js

@@ -0,0 +1,5 @@
+const map = (arr, cb) => {
+  let i = arr.length, result = Array(i);
+  while (i--) result[i] = cb(arr[i], i, arr);
+  return result;
+};

java/sgirabin_Max2Digit.java

@@ -0,0 +1,13 @@
+
+
+class Max2Digit {
+
+  public static int max(int a, int b) {
+ 	return Math.max(a,b); 
+  }
+
+  public static void main(String[] args) {
+  	System.out.println(Max2Digit.max(5,10));
+  }
+
+}

javascript/Xander1233_collatzConjecture.js

@@ -0,0 +1 @@
+const collatz = x => x <= 1 ? x : collatz((x % 2) === 0 ? x / 2 : x * 3 + 1);

javascript/Xander1233_convert_number_to_one_or_bigger.js

@@ -0,0 +1,2 @@
+// This will check if a number is 0 or smaller and then converts it. If 0, to 1. If n < 0, to -n
+const convert = (n) => { return (-(~(n ^ 0))) < 0 ? (-(~(n ^ 0))) != -1 ? (-(-(~(n ^ 0)))) + 1 : (-(-(~(n ^ 0)))) : (-(~(n ^ 0))) != 1 ? (-(~(n ^ 0))) - 1 : (-(~(n ^ 0))); }

javascript/rpxs_add.js

@@ -0,0 +1 @@
+const add = (a, b) => a + b;

javascript/rpxs_subtract.js

@@ -0,0 +1 @@
+const subtract = (a, b) => a - b

javascript/unique/wzhouwzhou_unique_values.js

@@ -0,0 +1,3 @@
+const values = [1, 2, 3, 4, 5, 1, 1, 1, 3];
+
+const unique = [void(0)].map((e, i, arr) => new Set(values).forEach(v => arr.push(v)) || arr)[0].slice(1);

javascript/vetlix_deepflat_array.js

@@ -0,0 +1 @@
+const deepFlat = arr => arr.flat(Infinity);

javascript/vetlix_empty_array.js

@@ -0,0 +1 @@
+const empty = arr => arr.length = 0;

javascript/wzhouwzhou_check_brackets.js

@@ -0,0 +1 @@
+Math.floor(Math.random() * 2) === 1 ? console.log('Heads!') : console.log('Tails!')

nodejs/tacticaltechjay_coinFlip.js

@@ -0,0 +1 @@
+(t = 1000) && Atomics.wait(new Int32Array(new SharedArrayBuffer(4)), 0, 0, t)

nodejs/wzhouwzhou_delay.js

@@ -0,0 +1,2 @@
+(Invoke-WebRequest "http://api.open-notify.org/astros.json" | ConvertFrom-Json).people
+#note, I got the idea from PowerShell.com a while ago, but I cannot find it now.

powershell/Astronaut/rpstester_ListOfPeopleInSpace.ps1

@@ -0,0 +1 @@
+[elemento**2 for elemento in range(11) if elemento%2==0]

python/mirandars_par-perfect-squares.py

@@ -0,0 +1 @@
+par = lambda x:True if x%2==0 else False

python/mirandars_parity-test.py

@@ -0,0 +1,16 @@
+#Consider the program that takes in a string and a list of numbers. 
+#It will prepend the string to each of the numbers and return a string of this new list separated by commas. 
+#For example, foo('$', range(5)) would return '$0, $1, $2, $3, $4'. 
+#A naive coder will do this-
+#
+#def foo(string, numbers):
+#  output = ''
+#  for i in range(len(numbers)):
+#    if i > 0:
+#      output += ', '
+#    output += string + str(numbers[i])
+#  return output
+#
+# Here is an elegant way with Output $0, $1, $2, $3, $4-
+
+def foo(string, numbers): return ', '.join(map(lambda s,n:s+str(n), [string for i in numbers], numbers))

python/prathimacode-hub_ordered_prepend_string_num.py

@@ -0,0 +1,3 @@
+list1 = [1,10,7,1,4]
+
+[x for idx, x in enumerate(list1) if x not in list1[:idx]]

python/unique/RaInta_unique_array.py

@@ -0,0 +1,5 @@
+is.prime <- function(n) n == 2L || all(n %% 2L:ceiling(sqrt(n)) != 0)
+
+# test
+test_vec <- 0:10
+sapply(test_vec, is.prime)