༼ つ ◕_◕ ༽つ
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
alias base64="node -e \"console.log(Buffer.from(process.argv[1], 'utf8').toString('base64'))\"" | |
alias base64decode="node -e \"console.log(Buffer.from(process.argv[1], 'base64').toString('utf8'))\"" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
* Question: | |
* Subtract given two positive integer as string without using `atoi` or number parser `parseInt, parseFloat` and return signed integer as string. | |
* Data types: | |
* - function subtract(num1: unsigned integer as String, num2: unsigned integer as string) : signed integer as string | |
* Rules: | |
* - Don't use atoi or parseInt for inputs directly | |
* Duration: | |
* - 45 minutes | |
* Examples: |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
//******************************************************************* | |
// Welcome to CompileJava! | |
// If you experience any issues, please contact us ('More Info') --> | |
// Also, sorry that the "Paste" feature no longer works! GitHub broke | |
// this (so we'll switch to a new provider): https://blog.github.com\ | |
// /2018-02-18-deprecation-notice-removing-anonymous-gist-creation/ | |
//******************************************************************* | |
import java.lang.Math; // headers MUST be above the first class | |
import java.util.Locale; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// En basit şekilde cache mantığı ile çalışan bir vCard servisi | |
// get methodu ile servisten aldığı değeri vCards'a ekliyor | |
// o listede de varsa geri döndürüyor | |
class vCard { | |
constructor() { | |
// hazırda inmiş vCard listesi | |
this.vCards = []; | |
} | |
get(id) { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
git clone https://github.com/abdurrahmanekr/electron-react-example.git | |
cd electron-react-example | |
npm i | |
npm start |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!DOCTYPE html> | |
<html lang="en"> | |
<head> | |
<meta charset="UTF-8"> | |
<title></title> | |
<script src='https://cdnjs.cloudflare.com/ajax/libs/strophe.js/1.2.14/strophe.js'></script> | |
<script> | |
var config = { | |
uri: 'http://atomic.detaysoft.com/http-bind/' | |
}; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
test |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function versionCompare(v1, v2, options) { | |
var lexicographical = options && options.lexicographical, | |
zeroExtend = options && options.zeroExtend, | |
v1parts = v1.split('.'), | |
v2parts = v2.split('.'); | |
function isValidPart(x) { | |
return (lexicographical ? /^\d+[A-Za-z]*$/ : /^\d+$/).test(x); | |
} |
NewerOlder