{{ message }}

Instantly share code, notes, and snippets.

🐦
Feathering

# Vincent Taverna vinnymac

🐦
Feathering
Last active Feb 13, 2021
Amazon Interview Islands Question (Daily Coding Problem)

Good morning! Here's your coding interview problem for today.

This problem was asked by Amazon.

Given a matrix of 1s and 0s, return the number of "islands" in the matrix. A 1 represents land and 0 represents water, so an island is a group of 1s that are neighboring whose perimeter is surrounded by water.

For example, this matrix has 4 islands.

1 0 0 0 0
Last active Jan 22, 2021
Pokemon Names
View fetchNames.js
 #!/usr/bin/env node const http = require('http') const fs = require('fs') const url = 'http://pokeapi.co/api/v2/pokemon-species/' let results = [] const receivedAllResults = () => { const filename = './names.json'
Last active Oct 13, 2020
Guide to Hackintosh (specifically for Z390i/9900K/Vega64 build)
Created Feb 18, 2020
View whoisblogger.txt
 % IANA WHOIS server % for more information on IANA, visit http://www.iana.org % This query returned 1 object refer: whois.verisign-grs.com domain: COM organisation: VeriSign Global Registry Services address: 12061 Bluemont Way
Created Sep 16, 2019
Daily Coding Problem #2

# Problem 2

This problem was asked by Uber.

Given an array of integers, return a new array such that each element at index i of the new array is the product of all the numbers in the original array except the one at i.

For example, if our input was [1, 2, 3, 4, 5], the expected output would be [120, 60, 40, 30, 24]. If our input was [3, 2, 1], the expected output would be [2, 3, 6].

Follow-up: what if you can't use division?

Created Sep 16, 2019
Daily Coding Problem #1

Problem 1

Given a list of numbers, return whether any two sums to k. For example, given [10, 15, 3, 7] and k of 17, return true since 10 + 7 is 17.

Bonus: Can you do this in one pass?

Last active Sep 16, 2019
Daily Coding Problem: Problem #85 [Medium]

Good morning! Here's your coding interview problem for today.

Given three 32-bit integers x, y, and b, return x if b is 1 and y if b is 0, using only mathematical or bit operations. You can assume b can only be 1 or 0.

Created Sep 11, 2019
Tree Traversal DFS vs BFS JavaScript
View bfs.js
 class BFSTree extends Tree { traverse(callback) { const queue = [this.graph]; let node while (queue.length > 0) { node = queue.shift(); callback(node.value);
Created Feb 5, 2019
10.14 Hackintosh Z390i, i9-9900K, and Vega 64 Configuration File
View config.plist
 Boot Arguments keepsyms=1 dart=0 -wegbeta -lilubetaall -vsmcbeta -alcbeta DefaultVolume LastBootedVolume
Created Mar 16, 2017
All the pokemon names
View names.json
 { "names": [ "bulbasaur", "ivysaur", "venusaur", "venusaur", "charmander", "charmeleon", "charizard", "charizard",