- Download macOS from somewhere. Easiest way is to use an existing mac to download it from the App Store.
- Use Unibeast or terminal installer to generate a usb installer
- Download Clover EFI Bootloader and run it against the USB you generated in step 2. This will configure the EFI partition on the USB and fix anything bad Unibeast might do. I recommend selecting the UEFI options and the RC scripts on target volume options.
import { useEffect, useRef } from "react"; | |
export default function useEventListener(event, callback) { | |
const element = useRef(null); | |
useEffect(() => { | |
element.current.addEventListener(event, callback); | |
return () => element.current.removeEventListener(event, callback); | |
}, []); |
<?xml version="1.0" encoding="UTF-8"?> | |
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd"> | |
<plist version="1.0"> | |
<dict> | |
<key>Boot</key> | |
<dict> | |
<key>Arguments</key> | |
<string>keepsyms=1 dart=0 -wegbeta -lilubetaall -vsmcbeta -alcbeta</string> | |
<key>DefaultVolume</key> | |
<string>LastBootedVolume</string> |
#!/bin/bash | |
for a in $(arp -n | tail -n+2 | cut -d' ' -f1); | |
do | |
nmblookup -A $a; | |
done |
class BFSTree extends Tree { | |
traverse(callback) { | |
const queue = [this.graph]; | |
let node | |
while (queue.length > 0) { | |
node = queue.shift(); | |
callback(node.value); |
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
Good morning! Here's your coding interview problem for today.
This problem was asked by Facebook.
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.
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?
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?
% 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 |