Pinned Repositories
Binary_sum
convierte numeros a binario; suma de dos numeros binarios en binario
countingValleys
countingValleys
Find_the_number
Find_the_number
Jumping_on_the_Clouds
Falla en algunos casos - Jumping_on_the_Clouds
ltes_make_a_clon
ltes_make_a_clon
memoria-peliculas-musica-imagenes-otros
recibe una lista de archivos {tipos: mp3, mp4, txt, ...}y muestra el total de uso de disco clasificado por: peliculas-musica-imagenes-otros
menor_numero_que_no_pertenece
Write a function: class Solution { public int solution(int[] A); } that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A. For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5. Given A = [1, 2, 3], the function should return 4. Given A = [−1, −3], the function should return 1. Write an efficient algorithm for the following assumptions: N is an integer within the range [1..100,000]; each element of array A is an integer within the range [−1,000,000..1,000,000].
modificaciones-para-ser-0
modifca un numero mediante , dividir / 2 y restar 1, para que sea 0
MYcalculator
MYcalculator
odderNumber
odderNumber
Test Hackton's Repositories
testa-review/Binary_sum
convierte numeros a binario; suma de dos numeros binarios en binario
testa-review/countingValleys
countingValleys
testa-review/Find_the_number
Find_the_number
testa-review/Jumping_on_the_Clouds
Falla en algunos casos - Jumping_on_the_Clouds
testa-review/ltes_make_a_clon
ltes_make_a_clon
testa-review/memoria-peliculas-musica-imagenes-otros
recibe una lista de archivos {tipos: mp3, mp4, txt, ...}y muestra el total de uso de disco clasificado por: peliculas-musica-imagenes-otros
testa-review/menor_numero_que_no_pertenece
Write a function: class Solution { public int solution(int[] A); } that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A. For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5. Given A = [1, 2, 3], the function should return 4. Given A = [−1, −3], the function should return 1. Write an efficient algorithm for the following assumptions: N is an integer within the range [1..100,000]; each element of array A is an integer within the range [−1,000,000..1,000,000].
testa-review/modificaciones-para-ser-0
modifca un numero mediante , dividir / 2 y restar 1, para que sea 0
testa-review/MYcalculator
MYcalculator
testa-review/odderNumber
odderNumber
testa-review/repeatedString
repeatedString
testa-review/searh_replace_and_comment_line
BUSCA Y REEMPLAZA 'console.warn' POR '//' PARA COMENARLO RECURSIVAMENTE, EN LOS SUBDIRECTORIOS, SOLO PARA LOS ARCHIVOS *.js
testa-review/Sock_merchant
Sock_merchant