Laste Update: Fri 05 Jun 2020 02:22:05 PM UTC
With hardware, you could intercept traffic.
- Download APK
Laste Update: Fri 05 Jun 2020 02:22:05 PM UTC
With hardware, you could intercept traffic.
#!/usr/bin/env python3 | |
# DATE: 2020.08.08 | |
# My initial solution for: | |
# https://web.archive.org/web/20200618185144/https://techdevguide.withgoogle.com/resources/compress-decompression/ | |
# | |
# Time complexity: O(length of input string). | |
# Storage complexity: I think my storage complexity is related to recursion (stack) depth and string length. | |
# I don't recall how python passes strings, but I hope it is passed by reference instead of by value. | |
# If by reference, then I think I have a O(length of input string) |
#!/usr/bin/env python3 | |
# DATE: 2020.08.08 | |
# Initial attempt at solving https://web.archive.org/save/https://techdevguide.withgoogle.com/resources/coding-question-minesweeper | |
# NOTE: Untested | |
""" | |
# Initial impressions | |
*Task:* | |
- Construct the playing field given the size [of the field] and a number of mines. | |
*Questions:* |
/* Analysis: | |
- Storage is O(1) | |
- Time is O(2*N) | |
Post-morten after looking up alternate solutions: | |
* https://www.geeksforgeeks.org/clone-linked-list-next-random-pointer-o1-space/ | |
- new list is created interleaved with old nodes | |
- first pass creates the new nodes and a second pass is used to disconnect the old and new lists | |
- next pointers of the original node is clobbered and then restored -- a better solution than mine | |
- Time complexity is the same as mine. Space complexity is slightly better than mine. |
I hereby claim:
To claim this, I am signing this object:
Although iOS (and macOS) is based on a flavor of nix, changing the network settings
from the command line is not as simple as executing ifconfig
. Changing system
wide persistent proxy settings, for example, is not done by modifying a file.
To persist network configuration changes, use the Apple scutil
cli tool (see
man scutil
).