I hereby claim:
- I am blackfry on github.
- I am blackfry (https://keybase.io/blackfry) on keybase.
- I have a public key ASAMTlHS0KiWfsYXPWCGo8RQsnbH90EPOmOqtD-TaX6mvQo
To claim this, I am signing this object:
| """ | |
| Python code for fractional differencing of pandas time series | |
| illustrating the concepts of the article "Preserving Memory in Stationary Time Series" | |
| by Simon Kuttruf | |
| While this code is dedicated to the public domain for use without permission, the author disclaims any liability in connection with the use of this code. | |
| """ | |
| import numpy as np | |
| import pandas as pd |
| { | |
| "name": "template", | |
| "version": "0.1.0", | |
| "private": true, | |
| "dependencies": { | |
| "@testing-library/jest-dom": "^4.2.4", | |
| "@testing-library/react": "^9.3.2", | |
| "@testing-library/user-event": "^7.1.2", | |
| "react": "^16.13.1", | |
| "react-dom": "^16.13.1", |
| { | |
| "compilerOptions": { | |
| "target": "ESNext", | |
| "module": "ESNext", | |
| "lib": ["ESNext", "dom"], | |
| "allowJs": true, | |
| "jsx": "react", | |
| "sourceMap": true, | |
| "outDir": "build", | |
| "rootDir": "src", |
| [ | |
| { | |
| "key": "shift+z", | |
| "command": "type", | |
| "args": { | |
| "text": "console.log()" | |
| }, | |
| "when": "editorTextFocus" | |
| } | |
| ] |
| module.exports = { | |
| verbose: true, | |
| collectCoverage: true, | |
| collectCoverageFrom: ['**/*.{js,jsx}', '!**/node_modules/**'] | |
| }; |
| { | |
| // Use IntelliSense to learn about possible attributes. | |
| // Hover to view descriptions of existing attributes. | |
| // For more information, visit: https://go.microsoft.com/fwlink/?linkid=830387 | |
| "version": "0.2.0", | |
| "configurations": [ | |
| { | |
| "type": "node", | |
| "request": "attach", | |
| "name": "Attach", |
| { | |
| "python.pythonPath": "/Users/markdickie/.pyenv/versions/data-service/bin/python", | |
| "jest.showCoverageOnLoad": true, | |
| "files.exclude": { | |
| "out": true, | |
| "node_modules/jest-editor-support/src": false, | |
| "coverage/": true | |
| }, | |
| "search.exclude": { | |
| "out": true, |
| /** | |
| https://www.hackerrank.com/challenges/filter-elements/problem | |
| ------ | |
| Given a list of N integers A = [a1, a2, ..., aN], you have to | |
| find those integers which are repeated at least K times. | |
| In case no such element exists you have to print -1. | |
| If there are multiple elements in A which are repeated at least K times, | |
| then print these elements ordered by their first occurrence in the list. | |
| */ |
I hereby claim:
To claim this, I am signing this object: