I hereby claim:
- I am imjpfeliciano on github.
- I am jonathancerby (https://keybase.io/jonathancerby) on keybase.
- I have a public key ASDujQxIvjwSfpMBTUw189xi7eYpSNDUvC7jKwmSQ6luvAo
To claim this, I am signing this object:
I hereby claim:
To claim this, I am signing this object:
{ | |
"data": [ | |
{ | |
"id": "d4a3e373-e814-4568-a0ae-f838edd61fdb", | |
"username": "Kary", | |
"handler": "metus", | |
"createdAt": "2020-11-28T05:31:37Z", | |
"message": "morbi odio odio elementum eu interdum eu tincidunt in leo maecenas pulvinar lobortis est phasellus", | |
"picture": "https://robohash.org/eumquoaut.png?size=50x50&set=set1" | |
}, |
#include <iostream> | |
using namespace std; | |
#define MAX 2002 | |
int colors[MAX]; | |
int components[MAX]; | |
int N, M; | |
int a, b; | |
long long int sum; |
/** | |
* Given an String S with a set of instructions that can be grouped create a program that executes that command | |
* | |
* Now the programs can have two additional characters “[“ and “]” to group a list of commands | |
* into a single command. For example, 3[FF2[FR]R]. | |
*/ | |
function simpleDecode(str) { | |
let result = [] |
/** | |
* Given a smaller string S and a bigger string B, | |
* design an algorithm to find all permutations of the shorter string | |
* within the longer one. Print the location of each permutation. | |
* Example: | |
* s: abbc | |
* b: cbabadcbbabbcbabaabccbabc | |
* 1000001001011000000011 | |
* | |
* output: |
#include <iostream> | |
#include <stack> | |
using namespace std; | |
string str; | |
int n; | |
string reverseString(stack<char> s) { | |
string res = ""; |
3 4 | |
1 1 3 3 | |
1 2 1 2 | |
3 2 2 2 |
I hereby claim:
To claim this, I am signing this object:
#include <iostream> | |
using namespace std; | |
#define MAX 3002 | |
bool costales[MAX], naranjas[MAX]; | |
int n, m; | |
int pos; | |
int total; | |
int main(){ |