fulminmaxi

function WillBe(Class){
  return class AsyncConstructor extends Class {
    constructor(...values) {
      super(...values);
      this.willBe = (async () => { 
           let resolvedThis = await promiseAllObj(this);
           //Remove this.willBe to avoid circular promises
           return Object.keys(resolvedThis)
                  .reduce((acc,key) => (key === 'willBe' 
                  ? acc 

aditiohri

#include <cs50.h>
#include <stdio.h>
#include <math.h>

int main(void)
{
    //create a variable to hold value of coins
    int coins = 0;
    //get change amount
    float change = get_float("Change owed: ");

spuds51

A curated list of AWS resources to prepare for the AWS Certifications

A curated list of awesome AWS resources you need to prepare for the all 5 AWS Certifications. This gist will include: open source repos, blogs & blogposts, ebooks, PDF, whitepapers, video courses, free lecture, slides, sample test and many other resources.

---

cypher-nullbyte

Point to Point
Shyam is standing in Point A. He has to reach Point B. There are m number of divisions 

between Point A and point B. 

These division may or may not have a stone. One can jump only on the stone.

Given a list of stones positions (in division) in sorted ascending order, 

determine whether Shyam can reach Point B.

IngeFrodo

class ValidPerfectSquare {
    public boolean isPerfectSquare(int num) {
        if (num < 2) {
            return true;
        }
        long left = 1l;
        long right = num;
        long mid, product;
        while (left <= right) {
            mid = left + (right - left) / 2;

TheGloriousGenesis

public static String operators = "+-^*/";

public static void main(String[] args){
    System.out.println(evaluatePostFix("6 2 3 + - 3 8 2 / + * 2 ^ 3 +"));
}

private static int evaluatePostFix(final String infix) {
    Stack<Integer> numberStack = new Stack<>();
    String[] infixCharacters = infix.split("");
    for (String i: infixCharacters) {

heffcodex

DIR 		= ./.build
EXECUTABLE  	= app

GOARCH		= amd64
GOOSWIN		= windows
GOOSX		= darwin
GOOSLINUX	= linux
GOMOD		= on
CGO_ENABLED 	= 0

bladebhs

-module(first).
-export([double/1, mult/2, area/3, square/1, treble/1]).

mult(X, Y) ->
  X * Y.

double(X) ->
  mult(2, X).

area(A, B, C) ->

fabriziobagala

using System;

class Solution
{
    public int solution(int N)
    {
        const int mask = 1;
        var binaryGap = 0;
        int? currentBinaryGap = null;
        

prakharshibu

#include <bits/stdc++.h>

using namespace std;

int main()
{
  int n,sum=0;
  cin>>n;
  int a[n];
  for(int i=0;i<n;i++)