{"id":3950,"date":"2024-08-14T12:26:27","date_gmt":"2024-08-14T11:26:27","guid":{"rendered":"https:\/\/cafe2sach.com\/?p=3950"},"modified":"2025-06-06T12:44:38","modified_gmt":"2025-06-06T11:44:38","slug":"hello-from-google-cuoc-phong-van-ky-su-phan-mem-than-thien","status":"publish","type":"post","link":"https:\/\/cafe2sach.com\/index.php\/2024\/08\/14\/hello-from-google-cuoc-phong-van-ky-su-phan-mem-than-thien\/","title":{"rendered":"Hello from Google (Cu\u1ed9c ph\u1ecfng v\u1ea5n k\u1ef9 s\u01b0 ph\u1ea7n m\u1ec1m th\u00e2n thi\u1ec7n)"},"content":{"rendered":"<p>C\u00f3 v\u00e0i chuy\u1ec7n th\u1ea5t b\u1ea1i g\u1ea7n \u0111\u00e2y khi m\u00ecnh b\u1ecb reject b\u00e0i b\u00e1o v\u00e0 kh\u00f4ng cho n\u1ed9p l\u1ea1i n\u00ean m\u00ecnh nh\u1edb l\u1ea1i cu\u1ed9c ph\u1ecfng v\u1ea5n kh\u00f4ng \u0111\u01b0\u1ee3c k\u1ef9 c\u1ee7a m\u00ecnh v\u1edbi google v\u00e0o m\u00f9a h\u00e8 n\u0103m ngo\u00e1i. Th\u00fa th\u1eadt th\u00ec m\u00ecnh \u0111\u00e3 t\u1eebng m\u01a1 \u01b0\u1edbc v\u00e0o m\u1ed9t c\u00f4ng ty l\u1edbn nh\u01b0 Google, do v\u1eeba l\u00e0 m\u1ee9c l\u01b0\u01a1ng cao v\u1eeba l\u00e0 \u0111\u1ec3 c\u00f3 \u0111\u01b0\u1ee3c c\u01a1 h\u1ed9i g\u1eb7p g\u1ee1 nh\u1eefng ng\u01b0\u1eddi th\u00f4ng minh m\u00e0 m\u00ecnh y\u00eau qu\u00fd.<\/p>\n<p>N\u00f3i chung th\u00ec l\u00ed do n\u00f3 \u0111\u01a1n gi\u1ea3n nh\u01b0 th\u1ebf \u0111\u1ea5y. Nh\u01b0ng m\u00ecnh ph\u1ecfng v\u1ea5n 1 l\u1ea7n v\u00e0 ch\u1ec9 m\u1ed9t l\u1ea7n th\u00f4i v\u00e0 n\u00f3 th\u1eadt b\u1ea1i. N\u00ean vi\u1ebft \u1edf \u0111\u00e2y v\u1ec1 c\u00e1i kinh nghi\u1ec7m th\u1ea5t b\u1ea1i c\u1ee7a m\u00ecnh ch\u1eb3ng bi\u1ebft c\u00f3 gi\u00fap g\u00ec cho m\u1ecdi ng\u01b0\u1eddi kh\u00f4ng, nh\u01b0ng ch\u1ec9 l\u00e0 m\u1ed9t c\u00e2u chuy\u1ec7n chia s\u1ebb.<\/p>\n<h1>Ph\u1ecfng v\u1ea5n k\u1ef9 s\u01b0 ph\u1ea7n m\u1ec1m \u1edf Google g\u1ed3m m\u1ea5y v\u00f2ng?<\/h1>\n<p>\u0110\u00e2y nguy\u00ean v\u1eb9n trong Email \u0111\u1ea7u c\u1ee7a Google th\u00ec n\u00f3 g\u1ed3m c\u00e1c b\u01b0\u1edbc nh\u01b0 th\u1ebf n\u00e0y:<\/p>\n<p><span style=\"font-family: arial, sans-serif;\">Recruiter screen \u2192\u00a0Technical phone interview \u2192 Onsite\u00a0interview\u00a0(4 or 5 sessions with\u00a0<\/span>4 x coding\/ds\/algo, 1 x Googleyness and Leadership) \u2192 Hiring committee review \u2192 Hiring manager team match \u2192 Offer review \u2192 offer delivery.<\/p>\n<p>C\u0169ng l\u1eb1ng nh\u1eb1ng \u0111\u1ea5y ch\u1ee9 nh\u1ec9 (th\u1eadt l\u00e0 nhi\u1ec1u b\u01b0\u1edbc) t\u1ea5t c\u1ea3 l\u00e0 c\u00f3 8 b\u01b0\u1edbc li\u1ec1n&#8230;.<\/p>\n<p>Th\u1ef1c ra th\u00ec ch\u1eafc n\u00f3 v\u1eabn l\u00e0 quan tr\u1ecdng nh\u1ea5t l\u00e0 ph\u1ecfng v\u1ea5n technical. V\u00e0 trong c\u00e1i b\u01b0\u1edbc techical th\u00ec h\u1ecd c\u0169ng c\u00f3 h\u01b0\u1edbng d\u1eabn r\u1ea5t chi ti\u1ebft c\u00e1c t\u00e0i li\u1ec7u \u0111\u1ec3 chu\u1ea9n b\u1ecb.<\/p>\n<h1>C\u00e1c t\u00e0i li\u1ec7u c\u1ea7n chu\u1ea9n b\u1ecb khi ph\u1ecfng v\u1ea5n google<\/h1>\n<p>\u0110\u00e2y l\u00e0 nguy\u1ec7n v\u1eb9n c\u00e1c b\u01b0\u1edbc m\u00e0 google g\u1eedi cho m\u00ecnh.<\/p>\n<p><b><span style=\"font-family: arial, sans-serif;\">To prepare for your\u00a0interview:<\/span><\/b><\/p>\n<p><span style=\"font-family: arial, sans-serif;\">Google\u00a0interviews\u00a0focus very heavily on algorithms, data structures, CS fundamentals, and are very academic-focused. You&#8217;ll be expected to\u00a0<i>know and apply<\/i>: l<b>ists, maps, stacks, priority queues, binary trees, graphs, bags, and sets<\/b>. You&#8217;ll need to talk about how they&#8217;re implemented and why you would choose one implementation or data structure instead of another. For algorithms you&#8217;ll want to know\u00a0<b>greedy algorithms, divide and conquer, dynamic programming, recursion, and brute force search<\/b>. You&#8217;ll definitely want to be conversant with\u00a0<b>Big\u00adO notation, time\u00adspace complexity, and real world performance\u00a0<\/b>of all of this. Most importantly you&#8217;ll need to be able to p<b>ick the right data structure and algorithm for a specific problem<\/b>.<\/span><\/p>\n<ol>\n<li><span style=\"font-family: arial, sans-serif;\">Review the attached Doc\u00a0Google\u00a0Interview\u00a0Prep Guide-Software Engineer (PDF)<br \/>\n<\/span><\/li>\n<li><span style=\"font-family: arial, sans-serif;\">Watch:<a href=\"https:\/\/youtu.be\/kvEZVsHmA34\" target=\"_blank\" rel=\"noopener noreferrer\" data-saferedirecturl=\"https:\/\/www.google.com\/url?q=https:\/\/youtu.be\/kvEZVsHmA34&amp;source=gmail&amp;ust=1723720326054000&amp;usg=AOvVaw1g1rO6hfOaAOhmBmExghMZ\"><u><i>\u00a0<\/i><\/u><\/a><a href=\"https:\/\/www.youtube.com\/watch?v=OMkfujDPpwc\" target=\"_blank\" rel=\"noopener noreferrer\" data-saferedirecturl=\"https:\/\/www.google.com\/url?q=https:\/\/www.youtube.com\/watch?v%3DOMkfujDPpwc&amp;source=gmail&amp;ust=1723720326054000&amp;usg=AOvVaw2aHlbhpGvz29O9zlOmRVNU\"><u>How to prepare for a Google Engineering\u00a0Interview<\/u><\/a>\u00a0(English subtitles available)<br \/>\n<\/span><\/li>\n<li><span style=\"font-family: arial, sans-serif;\">Watch:\u00a0Example of a\u00a0<a href=\"https:\/\/www.youtube.com\/watch?v=XKu_SEDAykw&amp;feature=em-subs_digest\" target=\"_blank\" rel=\"noopener noreferrer\" data-saferedirecturl=\"https:\/\/www.google.com\/url?q=https:\/\/www.youtube.com\/watch?v%3DXKu_SEDAykw%26feature%3Dem-subs_digest&amp;source=gmail&amp;ust=1723720326054000&amp;usg=AOvVaw2bOYUWYimK2wPMmZCUsC7N\"><u>Coding\u00a0Interview\u00a0at Google<\/u><\/a><br \/>\n<\/span><\/li>\n<li><span style=\"font-family: arial, sans-serif;\">Watch:\u00a0<a href=\"https:\/\/www.youtube.com\/watch?v=XOtrOSatBoY&amp;t=1s\" target=\"_blank\" rel=\"noopener noreferrer\" data-saferedirecturl=\"https:\/\/www.google.com\/url?q=https:\/\/www.youtube.com\/watch?v%3DXOtrOSatBoY%26t%3D1s&amp;source=gmail&amp;ust=1723720326054000&amp;usg=AOvVaw2fYeKbfOAV3NCD2_sovFRV\"><u>Interview\u00a0tips from Google Software Engineers<\/u><\/a><br \/>\n<\/span><\/li>\n<li><span style=\"font-family: arial, sans-serif;\">Practice your best programming language\u00a0<a href=\"https:\/\/google.github.io\/styleguide\/javaguide.html\" target=\"_blank\" rel=\"noopener noreferrer\" data-saferedirecturl=\"https:\/\/www.google.com\/url?q=https:\/\/google.github.io\/styleguide\/javaguide.html&amp;source=gmail&amp;ust=1723720326054000&amp;usg=AOvVaw0RkBdM5aYHnYRwL1xvuKfV\"><u>Google Style Guide<\/u><\/a>\u00a0&lt;Very Important!&gt;<br \/>\n<\/span><\/li>\n<li><span style=\"font-family: arial, sans-serif;\"><a href=\"https:\/\/github.com\/jwasham\/google-interview-university\/blob\/master\/README.md#google-interview-university\" target=\"_blank\" rel=\"noopener noreferrer\" data-saferedirecturl=\"https:\/\/www.google.com\/url?q=https:\/\/github.com\/jwasham\/google-interview-university\/blob\/master\/README.md%23google-interview-university&amp;source=gmail&amp;ust=1723720326054000&amp;usg=AOvVaw1EbYLxaAeDkNjDNdQgiPCB\"><u>This<\/u><\/a>\u00a0is a gitHub link on Computer Science (CS) fundamentals which is a good checklist on what you should master to prepare for coding at Google.<br \/>\n<\/span><\/li>\n<li><span style=\"font-family: arial, sans-serif;\"><a href=\"https:\/\/books.google.ie\/books?id=nlgWywAACAAJ&amp;dq=Cracking+the+Coding+Interview&amp;hl=en&amp;sa=X&amp;ei=hUTtUfXVCoSg4gS5v4C4BQ\" target=\"_blank\" rel=\"noopener noreferrer\" data-saferedirecturl=\"https:\/\/www.google.com\/url?q=https:\/\/books.google.ie\/books?id%3DnlgWywAACAAJ%26dq%3DCracking%2Bthe%2BCoding%2BInterview%26hl%3Den%26sa%3DX%26ei%3DhUTtUfXVCoSg4gS5v4C4BQ&amp;source=gmail&amp;ust=1723720326054000&amp;usg=AOvVaw05kyldsHP673qcXniMPb7A\"><u>Cracking the Coding\u00a0Interview<\/u><\/a>\u00a0&lt;This is one of the most helpful books you may find!&gt;<br \/>\n<\/span><\/li>\n<li><span style=\"font-family: arial, sans-serif;\">Additional reading material:<br \/>\n<\/span><\/p>\n<ol>\n<li><span style=\"font-family: arial, sans-serif;\"><i><\/i><a href=\"https:\/\/www.coursera.org\/learn\/algorithms-part1\" target=\"_blank\" rel=\"noopener noreferrer\" data-saferedirecturl=\"https:\/\/www.google.com\/url?q=https:\/\/www.coursera.org\/learn\/algorithms-part1&amp;source=gmail&amp;ust=1723720326054000&amp;usg=AOvVaw0U2N75EzUEjj2tXL-Z1Kgz\"><u><i>Coursera &#8211; Algorithms, Part 1<\/i><\/u><\/a><br \/>\n<\/span><\/li>\n<li><span style=\"font-family: arial, sans-serif;\"><i><\/i><a href=\"https:\/\/www.coursera.org\/learn\/algorithms-part2\" target=\"_blank\" rel=\"noopener noreferrer\" data-saferedirecturl=\"https:\/\/www.google.com\/url?q=https:\/\/www.coursera.org\/learn\/algorithms-part2&amp;source=gmail&amp;ust=1723720326054000&amp;usg=AOvVaw1bhytFsLmVhC9vbDebH0d2\"><u><i>Coursera &#8211; Algorithms, Part 2<\/i><\/u><\/a><br \/>\n<\/span><\/li>\n<li><span style=\"font-family: arial, sans-serif;\"><i><\/i><a href=\"https:\/\/www.udacity.com\/course\/intro-to-algorithms--cs215\" target=\"_blank\" rel=\"noopener noreferrer\" data-saferedirecturl=\"https:\/\/www.google.com\/url?q=https:\/\/www.udacity.com\/course\/intro-to-algorithms--cs215&amp;source=gmail&amp;ust=1723720326054000&amp;usg=AOvVaw1GAdiOmXwuIwGCo8FVFXgJ\"><u><i>Udacity &#8211; Intro to Algorithms<\/i><\/u><\/a><br \/>\n<\/span><\/li>\n<li><span style=\"font-family: arial, sans-serif;\"><i><\/i><a href=\"https:\/\/ocw.mit.edu\/courses\/electrical-engineering-and-computer-science\/6-006-introduction-to-algorithms-spring-2008\/\" target=\"_blank\" rel=\"noopener noreferrer\" data-saferedirecturl=\"https:\/\/www.google.com\/url?q=https:\/\/ocw.mit.edu\/courses\/electrical-engineering-and-computer-science\/6-006-introduction-to-algorithms-spring-2008\/&amp;source=gmail&amp;ust=1723720326054000&amp;usg=AOvVaw0IRFeg69ckmQXtnaVmJ7Jt\"><u><i>MIT Open courseware &#8211; Introduction to Algorithms<\/i><\/u><\/a><br \/>\n<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<p><span style=\"font-family: arial, sans-serif;\"><b>Moving onto the practice after theory:<\/b><b><br \/>\n<\/b>When you practice,\u00a0<b><i>do not use an IDE<\/i><\/b>. You need to be able to write legible, compilable code without help with regards to layout, or spelling of standard library class\/method names.\u00a0I suggest solving similar style algorithmic\/ data structure problems on a\u00a0<a href=\"https:\/\/www.google.com\/docs\/about\/\" target=\"_blank\" rel=\"noopener noreferrer\" data-saferedirecturl=\"https:\/\/www.google.com\/url?q=https:\/\/www.google.com\/docs\/about\/&amp;source=gmail&amp;ust=1723720326054000&amp;usg=AOvVaw0wAQuHl7_XO__jKCVpFvSo\"><u>google document<\/u><\/a> to simulate a real\u00a0interview with a timer.\u00a0<\/span><\/p>\n<p>&nbsp;<\/p>\n<p>M\u00ecnh c\u0169ng \u0111\u1ecbnh d\u1ecbch ra nh\u01b0ng m\u00e0 n\u00f3i chung th\u00ec t\u00f3m g\u1ecdn l\u00e0 n\u00f3 s\u1ebd t\u1eadp trung nhi\u1ec1u v\u00e0o thu\u1eadt to\u00e1n, c\u1ea5u tr\u00fac d\u1eef li\u1ec7u, c\u00e1c nguy\u00ean t\u1eafc khoa h\u1ecdc c\u1ee7a m\u00e1y t\u00ednh, th\u01b0\u1eddng l\u00e0 v\u1ec1 l\u00ed thuy\u1ebft ch\u1ee9 \u00edt khi n\u00e0o \u0111i v\u00e0o gi\u1ea3i c\u00e1c b\u00e0i to\u00e1n th\u1ec3 hi\u1ec7n kh\u1ea3 n\u0103ng code v\u00ed d\u1ee5 nh\u01b0 code website hay di \u0111\u1ed9ng (:D) n\u00ean l\u00e0 \u0111\u1eebng t\u01b0\u1edfng b\u1ea1n bi\u1ebft l\u00e0m m\u1ea5y c\u00e1i \u0111\u00f3 l\u00e0 b\u1ea1n c\u00f3 th\u1ec3 thi v\u00e0o Google.<\/p>\n<p>Anyway th\u00ec m\u00ecnh \u0111\u00e3 tr\u01b0\u1ee3t, v\u00e0 m\u00ecnh c\u0169ng ch\u1ec9 thi c\u00f3 m\u1ed9t l\u1ea7n th\u00f4i. Th\u1ef1c ra m\u00ecnh v\u1eabn \u0111\u01b0\u1ee3c g\u1ecdi l\u00e0 l\u00e0m vi\u1ec7c v\u1edbi google v\u00ec m\u00ecnh c\u00f3 v\u00e0i d\u1ef1 \u00e1n c\u00e1 nh\u00e2n nho nh\u1ecf, tuy nhi\u00ean l\u01b0\u01a1ng kh\u00f4ng cao \u0111\u01b0\u1ee3c nh\u01b0 c\u00e1c anh ch\u1ecb, c\u00e1c b\u1ea1n l\u00e0m cho c\u00f4ng ty google th\u00f4i.<\/p>\n<p>D\u00f9 sao th\u00ec, m\u1ecdi chuy\u1ec7n c\u0169ng s\u1ebd \u1ed5n th\u00f4i, ng\u00e0y mai tr\u1eddi l\u1ea1i s\u00e1ng. Trogn c\u00e1c t\u00e0i li\u1ec7u c\u1ee7a g\u1eedi \u0111\u1ec3 chu\u1ea9n b\u1ecb cho cu\u1ed9c ph\u1ecfng v\u1ea5n c\u0169ng r\u1ea5t hay, v\u00e0 m\u00ecnh bi\u1ebft \u01a1n n\u00f3, \u0111\u1ec3 n\u1ebfu c\u1ea7n c\u00e1i \u0111\u1ec3 h\u1ecdc m\u00ecnh c\u00f3 th\u1ec3 truy c\u1eadp v\u00e0o.<\/p>\n<p>Mong l\u00e0 b\u00e0i vi\u1ebft s\u1ebd h\u1eefu \u00edch cho b\u1ea1n n\u00e0o mu\u1ed1n h\u1ecdc \u0111\u1ec3 tr\u1edf th\u00e0nh K\u1ef9 S\u01b0 Ph\u1ea7n M\u1ec1m \ud83d\ude42<\/p>\n<h1><\/h1>\n","protected":false},"excerpt":{"rendered":"<p>C\u00f3 v\u00e0i chuy\u1ec7n th\u1ea5t b\u1ea1i g\u1ea7n \u0111\u00e2y khi m\u00ecnh b\u1ecb reject b\u00e0i b\u00e1o v\u00e0 kh\u00f4ng cho n\u1ed9p l\u1ea1i n\u00ean m\u00ecnh [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-3950","post","type-post","status-publish","format-standard","hentry","category-blogs"],"_links":{"self":[{"href":"https:\/\/cafe2sach.com\/index.php\/wp-json\/wp\/v2\/posts\/3950","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/cafe2sach.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/cafe2sach.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/cafe2sach.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/cafe2sach.com\/index.php\/wp-json\/wp\/v2\/comments?post=3950"}],"version-history":[{"count":1,"href":"https:\/\/cafe2sach.com\/index.php\/wp-json\/wp\/v2\/posts\/3950\/revisions"}],"predecessor-version":[{"id":3951,"href":"https:\/\/cafe2sach.com\/index.php\/wp-json\/wp\/v2\/posts\/3950\/revisions\/3951"}],"wp:attachment":[{"href":"https:\/\/cafe2sach.com\/index.php\/wp-json\/wp\/v2\/media?parent=3950"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/cafe2sach.com\/index.php\/wp-json\/wp\/v2\/categories?post=3950"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/cafe2sach.com\/index.php\/wp-json\/wp\/v2\/tags?post=3950"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}