brightlightkim

The promise will always log pending as long as its results are not resolved yet. You must call .then on the promise to capture the results regardless of the promise state (resolved or still pending): let AuthUser = function(data) { return google.login(data.username, data.password).then(token => { return token } ) } let userToken = AuthUser(data) console.log(userToken) // Promise { } userToken.th..

Question: You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that together with the x-axis form a container, such that the container contains the most water. Return the maximum amount of water a container can store. Notice that you may not slant the container. Example 1: Inp..

1.1. Implement an algorithm to determine if a string has all unique characters. What if you cannot use additional data structures? 1) Brute Force (I made this not to use additional data structure) Calculate each item by iterating the string >> result in O(n^2) boolean isUnique(String[] string){ for (int i = 0; i < string.length; i++){ //Since we compute one for i we don't have to start from i ag..

Hash Tables A data structure that maps keys to values for highly efficient lookup. 1. Compute the key's hash code, usually an int or long. Note that two different keys could have the same hash code, as there may be an infinite number of keys and a finite number of ints 2. Then, map the hash code to an index in the array. This could be done with something like hash(key) % array_length. Two differ..

Postman: - I'm able to make the env variables to make a request to http - Get a quick glimpse of data - Easy to debug with url - Environment variables (important thing is the url >> only read out of prod) - Mock servers https://learning.postman.com/docs/getting-started/introduction/ Introduction | Postman Learning Center Introduction: documentation for Postman, the collaboration platform for API..

Example: Print all positive integer solutions to the equation a^3 + b^3 = c^3 + d^3 and a, b, c, d are integers between 1 and 1000. 1. A brute force solutions n = 1000 n = 1000 for a from 1 to n for b from 1 to n for c from 1 to n for d from 1 to n if a^3 + b^3 = c^3 + d^3 print a, b, c, d This returns O(n^4) To optimize it we can make a break when we find it n = 1000 for a from 1 to n for b fro..

IceCast (Radio) - wget >> radio.byu.edu || worker in streamsaver >> save data to S3

Advices: - Make myself in the environment of pushing myself and helping others Software Engineering: - 1 / 3 - Cloud >> Software DevOps: - Automation - Software + IT - Cloud Kubernetes - Network Management - Bash or Python Scripts - IT

Step Function Check logs Increase time out for the UpdateStatusFailed.js Cloud Watch Monitor any error with log groups check media id and find the one Run in the environment variables Find the entry point and set the file. (ENVT) Make an environment (test.sh) Since it's a docker containe Use Bash Lambda Function COLD >> WARM Find a problem >> Replicate it in Local

A problem Solving Flow Chart Listen Pay very close attention to any information in the problem description. You probably need it all for an optimal algorithm. Example Most examples are too small or are special cases. Debug your example. Is there any way it's a special case? Is it big enough? Brute Force get a brute-force solution as soon as possible. Don't worry about developing an efficient alg..