William Torrez Villelmo
This file has been truncated, but you can view the full file.
This file contains hidden or 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 id="facebook" class="_9dls __fb-dark-mode" dir="ltr" lang="en"><head> |
Villelmo
/ revenus disponibles france metropolitaine - deciles.ipynb
Created
March 19, 2022 13:33
— forked from adipasquale/revenus disponibles france metropolitaine - deciles.ipynb
iPython Notebook revenus disponibles France Métropolitaine - deciles
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Villelmo
/ adjacentElements.c
Last active
March 15, 2018 00:36
Given an array of integers, find the pair of adjacent elements that has the largest product and return that product.
This file contains hidden or 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
| // Definition for arrays: | |
| //typedef struct arr_integer{ | |
| // int size; | |
| // int arr*; | |
| // } inputArray; | |
| // arr_##name alloc_arr_##name(int len) { | |
| // arr_##name a = {len, len > 0 ? malloc(sizeof(type) * len) : NULL}; | |
| // return a; | |
| // } |