brightlightkim

Prime Numbers: Divisibility: The prime number law stated above means that, in order for a number x to divide a number y (written x/y, or mod(y, x) = 0), all primes in x's prime factorization must be in y's prime factorization. Or, more specifically, Let x = Let y = if x/y, then for all I, ji

You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also bad. Suppose you have n versions [1, 2, ..., n] and you want to find out the first bad one, which causes all the following ones to be..

Given two binary strings a and b, return their sum as a binary string. Example 1: Input: a = "11", b = "1" Output: "100" Example 2: Input: a = "1010", b = "1011" Output: "10101" Constraints: 1 =0){ if(i>=0){ sum = sum + a.charAt(i) - '0'; i--; } if(j>=0){ sum = sum + b.charAt(j) - '0'; j--; } sb.append(sum%2); sum = sum/2; } if(sum!=0) sb.append(sum); return sb.reverse().toString(); } }

yarn init: npm init - name - version - entry point - repository url - package.json file yarn config set init-license ISC - change the setting (default) yarn config get init-license - Shows that it's ISC yarn add [package name] - npm install yarn remove [package] - remove the name and from the dependency yarn add [package]@[version number] - creates the specific package yarn outdated [Conditition..

Bit Manipulation by Hand: ^ means XOR, ~ is a Not (Negation) - XOR: If it's a different bit, it will be 1. EX) 1101 ^ (~1101) = 1111 - If you XOR a bit with its own negated value, you will always get 1. Therefore, the solution to a^(~a) will be a sequence of 1s. EX) 1011 & (~0

Given two integer arrays arr1 and arr2, and the integer d, return the distance value between the two arrays. The distance value is defined as the number of elements arr1[i] such that there is not any element arr2[j] where |arr1[i]-arr2[j]| d=2 |4-9|=5 > d=2 |4-1|=3 > d=2 |4-8|=4 > d=2 For arr1[1]=5 we have: |5-10|=5 > d=2 |5-9|=4 > d=2 |5-1|=4 > d=2 |5-8|=3 > d=2 For arr1[2]=8 we have: |8-10|=2

Given a positive integer num, write a function which returns True if num is a perfect square else False. Follow up: Do not use any built-in library function such as sqrt. Example 1: Input: num = 16 Output: true Example 2: Input: num = 14 Output: false Constraints: 1

I had some issues getting the v3 AWS SDK for JavaScript to communicate with localstack S3, but I found a solution! With the V2 JS SDK, the configuration object for the S3 client looks like: { "region": "eu-west-1", "endpoint": "http://localhost:4566", "s3ForcePathStyle": true } The last field tells the sdk not to use .hostname style connections, and instead puts the bucket in the path. For local..

Let's call an array arr a mountain if the following properties hold: arr.length >= 3 There exists some i with 0 arr[i+1] > ... > arr[arr.length - 1] Given an integer array arr that is guaranteed to be a mountain, return any i such that arr[0] arr[i + 1] > ... > arr[arr.length - 1..

STRUCTURE OF A MONOREPO A monorepo can contain multiple applications (here: apps) whereas each application has access to shared set of packages. Bear in mind that this is already an opinionated monorepo structure: - apps/ --- app-one --- app-two - packages/ --- package-one --- package-two --- package-three A package, which is just a folder, can be anything from UI components (e.g. framework spec..