When using glitch.com's Download Project tool (Tools > Import and Export > Download Project), the resulting archive does not include project assets that were uploaded to the Glitch CDN.
The download does however include a metadata file .glitch-assets that lists the project's CDN files.
This script downloads the files listed in a .glitch-assets file and writes them to a local directory.
| def get_majority(A, k): | |
| """ | |
| Return the majority element in an array. O(n) time. | |
| This is an implementation of Moore's voting algorithm. | |
| """ | |
| maj_index = 0 | |
| count = 1 | |
| for i in range (1, len(A-1)): | |
| # If the current element is equal to the index of the majority element, increment count |
| # Constraints: an array of size n of integers in the range 0 to k-1, where k is a positive integer and k <= n | |
| test = [0, 1, 1, 1, 3, 17, 5, 3, 2, 1, 9] # k = 10, n = 11 | |
| get_common(test, 10) | |
| def get_common(A, k): | |
| """Return the most popular integer in an array. O(n) time, O(k) space.""" | |
| # Create a lookup array with length k to track the occurrence of each possible member. | |
| # O(k) space | |
| lookup = [0] * k |
| 'use strict' | |
| const nums = [3, 0, 2, 5, 1, 3, 0] | |
| quicksort(nums, 0, nums.length - 1) | |
| console.log(nums) | |
| const chars = ['z', 'a', 'u', 'f', 'f', 'A'] | |
| quicksort(chars, 0, chars.length - 1) | |
| console.log(chars) |
| // Average case O(n^2) | |
| function insertionSort (arr) { | |
| // Begin at position 1, because we need to compare the element at | |
| // that position to the previous element | |
| for (let i = 1; i < arr.length; i++) { | |
| let j = i | |
| // If the prior element is greater than the current element (arr[j]), swap | |
| while (j > 0 && arr[j-1] > arr[j]) { | |
| // Storing the tmp variable requires O(1) memory space |
| function processData(input) { | |
| const lines = input.split('\n') | |
| // Discard the first line | |
| lines.shift() | |
| for (line of lines) { | |
| // Split line into array of chars | |
| countMinimumDeletions(line.split('')) | |
| } |
| function onePointer (input) { | |
| const lines = input.split('\n') | |
| const k = Number(lines[0].split(' ')[1]) | |
| let nums = lines[1].split(' ').map(x => Number(x)) | |
| let count = 0 | |
| // Sort the numbers in order to limit the number of required comparisons | |
| nums.sort((a, b) => a - b) | |
| // For each element, calculate the difference between it and subsequent elements up to |
See the code in its entirety here.
This code exploits a "padding oracle" in order to decrypt a ciphertext encrypted with AES-128 in CBC mode.
The oracle decrypts a ciphertext and then determines if the resulting plaintext has valid PKCS#7 padding. This may seem innocent, but because an attacker can provide arbitrary text to the oracle, it can actually provide sufficient information to decrypt a ciphertext without knowledge of the key.
Each block of ciphertext is first decrypted with the key, then XORed with the preceding block of ciphertext (except the first block, which is XORed with the initialization vector) to produce the corresponding plaintext block.