Paprika doesn't have their API documented, so this is me reverse-engineering it from an Android device
Discover gists
#!/usr/bin/env bash | |
# Abort sign off on any error | |
set -e | |
# Start the benchmark timer | |
SECONDS=0 | |
# Repository introspection | |
OWNER=$(gh repo view --json owner --jq .owner.login) |
The Gilbert–Johnson–Keerthi (GJK) distance algorithm is a method of determining the minimum distance between two convex sets. The algorithm's stability, speed which operates in near-constant time, and small storage footprint make it popular for realtime collision detection.
Unlike many other distance algorithms, it has no requirments on geometry data to be stored in any specific format, but instead relies solely on a support function to iteratively generate closer simplices to the correct answer using the Minkowski sum (CSO) of two convex shapes.
I liked the way Grokking the coding interview organized problems into learnable patterns. However, the course is expensive and the majority of the time the problems are copy-pasted from leetcode. As the explanations on leetcode are usually just as good, the course really boils down to being a glorified curated list of leetcode problems.
So below I made a list of leetcode problems that are as close to grokking problems as possible.
# https://superuser.com/a/1434648 | |
Add-Type -AssemblyName System.Runtime.WindowsRuntime | |
$asTaskGeneric = ([System.WindowsRuntimeSystemExtensions].GetMethods() | ? { $_.Name -eq 'AsTask' -and $_.GetParameters().Count -eq 1 -and $_.GetParameters()[0].ParameterType.Name -eq 'IAsyncOperation`1' })[0] | |
Function Await($WinRtTask, $ResultType) { | |
$asTask = $asTaskGeneric.MakeGenericMethod($ResultType) | |
$netTask = $asTask.Invoke($null, @($WinRtTask)) | |
$netTask.Wait(-1) | Out-Null | |
$netTask.Result |
Ever wanted to delete all your likes/favorites from Twitter but only found broken/expensive tools? You are in the right place.
- Go to: https://twitter.com/{username}/likes
- Open the console and run the following JavaScript code:
setInterval(() => {
for (const d of document.querySelectorAll('div[data-testid="unlike"]')) {
d.click()
}
import 'dart:async'; | |
import 'package:flutter/material.dart'; | |
import 'package:provider/provider.dart'; | |
void main() { | |
runApp(MultiProvider( | |
providers: [ | |
ChangeNotifierProvider(create: (_) => Counter()), | |
ChangeNotifierProvider(create: (_) => Clock()) |
-
[CLRS Book Solutions] (https://github.com/gzc/CLRS)
-
[William Fiset] (https://www.youtube.com/watch?v=RBSGKlAvoiM&ab_channel=freeCodeCamp.org)
-
[Interview Camp] (https://drive.google.com/drive/u/0/folders/1dIeMx4tAnmTogCl5ltugfITBzJ15mVXP)
-
[Awesome-Algorithms] (https://github.com/tayllan/awesome-algorithms#readme)
-
[Interview Centered] (https://drive.google.com/drive/u/0/folders/1dIeMx4tAnmTogCl5ltugfITBzJ15mVXP)
Unoffical ESP32 Development Board Pinout Ascii Art | |
For more information: | |
https://www.espressif.com/en/products/hardware/esp32/overview | |
https://lastminuteengineers.com/esp32-arduino-ide-tutorial/#esp32-development-board-pinout | |
/* | |
* MIT License | |
* | |
* Copyright (c) 2021-2022 John "Nielk1" Klein | |
* | |
* Permission is hereby granted, free of charge, to any person obtaining a copy | |
* of this software and associated documentation files (the "Software"), to deal | |
* in the Software without restriction, including without limitation the rights | |
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | |
* copies of the Software, and to permit persons to whom the Software is |