{"id":8800,"date":"2020-02-04T14:41:00","date_gmt":"2020-02-04T12:41:00","guid":{"rendered":"https:\/\/programmingpool.com\/join-us-for-hash-code-2020\/"},"modified":"2026-04-07T12:02:26","modified_gmt":"2026-04-07T09:02:26","slug":"join-us-for-hash-code-2020","status":"publish","type":"post","link":"https:\/\/programmingpool.com\/ro\/join-us-for-hash-code-2020\/","title":{"rendered":"Al\u0103tura\u021bi-v\u0103 nou\u0103 la Hash Code 2020"},"content":{"rendered":"\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\n\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t
<\/div>\n\t\t\t\t\t\t\t

Organiz\u0103m Hash Code 2020<\/strong><\/h2>

Dup\u0103 succesul de anul trecut, ne-am dorit s\u0103 o facem din nou. Aduna\u021bi echipele, preg\u0103ti\u021bi loca\u021bia, accepta\u021bi provocarea \u0219i scrie\u021bi cel mai bun cod! Runda de calificare online va avea loc pe 20 februarie 2020, iar noi vom fi din nou un hub.<\/p>

Ce este Hash Code?<\/h2>

Hash Code este o competi\u021bie de programare pentru echipe, organizat\u0103 de Google. Este destinat\u0103 studen\u021bilor \u0219i profesioni\u0219tilor din \u00eentreaga lume, oferindu-le oportunitatea de a-\u0219i \u00eemp\u0103rt\u0103\u0219i abilit\u0103\u021bile \u0219i de a intra \u00een contact cu al\u021bi programatori. Participan\u021bii pot alege o echip\u0103 \u0219i un limbaj de programare, iar Google stabile\u0219te o problem\u0103 de inginerie de rezolvat.<\/p>

Echipele se reunesc pentru a concura cot la cot \u00een hub-uri Hash Code coordonate local. Noi suntem unul dintre ele!
Cele mai bune echipe din aceast\u0103 rund\u0103 vor participa la Runda Final\u0103 anual\u0103 Hash Code \u00eentr-un birou interna\u021bional Google \u2013 anul acesta la sediul central Google din Irlanda.<\/p>

Cum func\u021bioneaz\u0103 Google Hash Code?<\/h2>

Odat\u0103 ce v-a\u021bi \u00eenregistrat aici: g.co\/hashcode<\/a>, ve\u021bi avea acces la un Sistem de Judecat\u0103. De acolo, pute\u021bi forma o echip\u0103, v\u0103 pute\u021bi al\u0103tura unui hub, exersa \u0219i concura \u00een timpul rundelor.


<\/p>

\u00cen timpul Rundei de Calificare Online, vom urm\u0103ri un live stream pe YouTube pentru a fi familiariza\u021bi cu problema. De acolo, echipele vor avea patru ore pentru a rezolva problema de optimizare, folosind limbajul de programare \u0219i instrumentele alese.<\/p>

Echipele pot concura dintr-un hub local sau dintr-o alt\u0103 loca\u021bie la alegere. Dac\u0103 e\u0219ti din Baia Mare, \u00ee\u021bi recomand\u0103m s\u0103 te al\u0103turi Programming Pool Hub \u2013 Str. Transilvaniei 18A, Baia Mare.<\/p>

Cele mai bune echipe din Runda de Calificare Online vor participa la Runda Final\u0103 \u00eentr-un birou Google din Irlanda. Ele vor concura pentru premii \u00een bani \u0219i vor colabora pentru a rezolva o nou\u0103 provocare.<\/p>

Dac\u0103 crezi c\u0103 ai ce trebuie, \u00eenregistreaz\u0103-te pe g.co\/hashcode<\/a> \u0219i, dac\u0103 e\u0219ti din Baia Mare, al\u0103tur\u0103-te hub-ului nostru.<\/p>

Termenul limit\u0103 pentru \u00eenscrieri este 17 februarie 2020<\/span>, iar Runda de Calificare Online va avea loc pe 20 februarie 2020.<\/span>


<\/p>

De asemenea, al\u0103tura\u021bi-v\u0103 evenimentului nostru de pe Facebook pentru program \u0219i nout\u0103\u021bi: https:\/\/www.facebook.com\/events\/2570924723232901\/<\/a><\/p>

Pentru mai multe \u0219tiri \u0219i \u00eentreb\u0103ri frecvente legate de Hash Code: https:\/\/codingcompetitions.withgoogle.com\/hashcode<\/a><\/p><\/div>\n\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"

Organiz\u0103m Hash Code 2020. Dup\u0103 succesul de anul trecut, ne-am dorit s\u0103 o facem din nou. Aduna\u021bi echipele, preg\u0103ti\u021bi loca\u021bia, accepta\u021bi provocarea \u0219i scrie\u021bi cel mai bun cod! Runda de calificare online va avea loc pe 20 februarie 2020, iar noi vom fi din nou un hub. <\/p>\n","protected":false},"author":7,"featured_media":8801,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[238,283,136],"tags":[284,275,261,363,285],"class_list":["post-8800","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-companie","category-noutati-din-companie","category-perspective","tag-competition","tag-development","tag-event","tag-google","tag-hashcode"],"acf":[],"_links":{"self":[{"href":"https:\/\/programmingpool.com\/ro\/wp-json\/wp\/v2\/posts\/8800","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/programmingpool.com\/ro\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/programmingpool.com\/ro\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/programmingpool.com\/ro\/wp-json\/wp\/v2\/users\/7"}],"replies":[{"embeddable":true,"href":"https:\/\/programmingpool.com\/ro\/wp-json\/wp\/v2\/comments?post=8800"}],"version-history":[{"count":9,"href":"https:\/\/programmingpool.com\/ro\/wp-json\/wp\/v2\/posts\/8800\/revisions"}],"predecessor-version":[{"id":10269,"href":"https:\/\/programmingpool.com\/ro\/wp-json\/wp\/v2\/posts\/8800\/revisions\/10269"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/programmingpool.com\/ro\/wp-json\/wp\/v2\/media\/8801"}],"wp:attachment":[{"href":"https:\/\/programmingpool.com\/ro\/wp-json\/wp\/v2\/media?parent=8800"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/programmingpool.com\/ro\/wp-json\/wp\/v2\/categories?post=8800"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/programmingpool.com\/ro\/wp-json\/wp\/v2\/tags?post=8800"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}