{"id":782,"date":"2020-04-01T11:28:54","date_gmt":"2020-04-01T09:28:54","guid":{"rendered":"https:\/\/devpath.pro\/?p=782"},"modified":"2020-04-01T11:28:54","modified_gmt":"2020-04-01T09:28:54","slug":"tech-challenge-explained","status":"publish","type":"post","link":"https:\/\/fabiocicerchia.it\/career\/tech-challenge-explained","title":{"rendered":"Tech Challenge Explained"},"content":{"rendered":"<p>The tech challenged I&#8217;ve used in Skuola.net was designed in order to be submitted by any developer, regardless the experience level or the programming language.<\/p>\n<p>So the easiest choice was to do an algorithm test, and amongst the infinite list of test you can find online, I&#8217;ve picked one based on anagrams.<\/p>\n<p>Another self-imposed constraint was about simplicity, no-one should&#8217;ve worked on it for more than a couple of days. The tests could&#8217;ve been solved in a couple of hours with no problems (in fact, the fastest candidate took half an hour).<\/p>\n<p>Here&#8217;s the task:<\/p>\n<blockquote><p><em>Objective: <\/em>Check that an anagram of a string is contained in another string.<\/p>\n<p><em>Task:<\/em> Prepare a command-line script which accepts 2 strings in input, checks if a given string A is any anagram contained in a string B, and prints out &#8220;true&#8221; or &#8220;false&#8221; based on the result of such comparison.<\/p>\n<p><em>Assume that:<\/em><\/p>\n<ul>\n<li>The code will be implemented preferably in PHP.<\/li>\n<li>A is a string no longer than 1024 characters.<\/li>\n<li>B is a string no longer than 1024 characters.<\/li>\n<li>No native language functions will be used to anagram a string.<\/li>\n<li>The comparison will be case-insensitive.<\/li>\n<\/ul>\n<p>Example: Given 2 strings A = &#8220;abc&#8221; and B = &#8220;itookablackcab&#8221;, the scripts will print out &#8220;true&#8221;, because by anagramming A it can be found an occurrence of &#8220;cab&#8221; in the string B.<\/p><\/blockquote>\n<p><!--more--><\/p>\n<p>It&#8217;s an easy one, or so I thought. Then, once started getting the source-codes I&#8217;ve began to see all the possible weird things:<\/p>\n<ul>\n<li>No coverage for edge cases (that was the normality)<\/li>\n<li>No commented code (many many examples)<\/li>\n<li>Many solutions with no OOP<\/li>\n<li>7+ level of nesting<\/li>\n<li>Requirements misunderstood, and even got simply a <code>strpos<\/code> match<\/li>\n<li>Lots of copy&amp;paste from all over the internet (even code that wasn&#8217;t doing what requested)<\/li>\n<li>Scripts that didn&#8217;t returned the expected result for the example provided<\/li>\n<li>My laptop stuck frozen (with subsequent hard-reboot) by infinite loops sucking all the RAM they could possibly allocate<\/li>\n<li>Scripts that weren&#8217;t CLI at all, instead a HTML form<\/li>\n<li>Source code copy&amp;pasted in the email body, one solution even in Word!<\/li>\n<\/ul>\n<p>But instead I was expecting something more like this:<\/p>\n<ul>\n<li>Source code versioned in a git repo<\/li>\n<li>Unit Testing<\/li>\n<li>Some sort of CI<\/li>\n<li>Package Management via composer<\/li>\n<li>A simple README file<\/li>\n<\/ul>\n<p>Thanks God, there were few solutions that really stood out in a way I didn&#8217;t expect at the start:<\/p>\n<ul>\n<li>Quick&amp;Dirty CLI Script (i.e. one file straight to the point &#8211; aka procedural code) + Clean Version (i.e. a very structured solutions with all my expectation mentioned earlier satisifed)<\/li>\n<li>Additional explanation of the approach followed to get to the solution<\/li>\n<li>Scripts with really good performances, i.e. O(n)<\/li>\n<\/ul>\n<p>Kudos to those guys!<\/p>\n<p>So I began to ask myself the efficacy of this kind of tests, how high should we raise the bar (or lower it), whether it should be adapted based on the candidate. In particular what are the requirements for the bare minimum in order to pass the stage.<\/p>\n<p>So with the time I&#8217;ve build kind of a thing around it, I&#8217;ve started with a bash script to quickly validate all the responses received and verify against a custom suite of tests. Then, we&#8217;ve built a <a href=\"https:\/\/fabiocicerchia.github.io\/code-challenge-review-checklist\/\">checklist<\/a> of aspects that the source code could\/should\/must have in order to score a pass. Also, started to expand and cover all the possible things one could have used in the challenge: from unicode to UML, from DDD to a dockerized version, from i18n to buffer overflow.<\/p>\n<p>With the time, I became more aware of the importance of a tech test, not a live one face-to-face (to avoid pressure and blank stares) nor a mid-size project (at which the candidate had to work after-work for a week). A simple, quick and offline test, in order to see to what extent they are going to stretch my assignment.<\/p>\n<p>Want to jump in the challenge and give it a try? Go ahead and send me the link back to your repo, I want to know how you approached to it! \ud83d\ude09<\/p>\n<p>I took myself the challenge back then, I took the challenge now, and you can find on <a href=\"https:\/\/github.com\/fabiocicerchia\/skuola-tech-test\">GitHub<\/a> my version of it.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>The tech challenged I&#8217;ve used in Skuola.net was designed in order to be submitted by any developer, regardless the experience level or the programming language. So the easiest choice was to do an algorithm test, and amongst the infinite list of test you can find online, I&#8217;ve picked one based on anagrams. Another self-imposed constraint [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"advgb_blocks_editor_width":"","advgb_blocks_columns_visual_guide":"","footnotes":""},"categories":[5],"tags":[113,114],"aioseo_notices":[],"author_meta":{"display_name":"fabio","author_link":"https:\/\/fabiocicerchia.it\/author\/fabio"},"featured_img":null,"coauthors":[],"tax_additional":{"categories":{"linked":["<a href=\"https:\/\/fabiocicerchia.it\/category\/career\" class=\"advgb-post-tax-term\">Career<\/a>"],"unlinked":["<span class=\"advgb-post-tax-term\">Career<\/span>"]},"tags":{"linked":["<a href=\"https:\/\/fabiocicerchia.it\/category\/career\" class=\"advgb-post-tax-term\">interview<\/a>","<a href=\"https:\/\/fabiocicerchia.it\/category\/career\" class=\"advgb-post-tax-term\">test<\/a>"],"unlinked":["<span class=\"advgb-post-tax-term\">interview<\/span>","<span class=\"advgb-post-tax-term\">test<\/span>"]}},"comment_count":"0","relative_dates":{"created":"Posted 4 years ago","modified":"Updated 4 years ago"},"absolute_dates":{"created":"Posted on April 1, 2020","modified":"Updated on April 1, 2020"},"absolute_dates_time":{"created":"Posted on April 1, 2020 11:28 am","modified":"Updated on April 1, 2020 11:28 am"},"featured_img_caption":"","series_order":"","_links":{"self":[{"href":"https:\/\/fabiocicerchia.it\/wp-json\/wp\/v2\/posts\/782"}],"collection":[{"href":"https:\/\/fabiocicerchia.it\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/fabiocicerchia.it\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/fabiocicerchia.it\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/fabiocicerchia.it\/wp-json\/wp\/v2\/comments?post=782"}],"version-history":[{"count":0,"href":"https:\/\/fabiocicerchia.it\/wp-json\/wp\/v2\/posts\/782\/revisions"}],"wp:attachment":[{"href":"https:\/\/fabiocicerchia.it\/wp-json\/wp\/v2\/media?parent=782"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fabiocicerchia.it\/wp-json\/wp\/v2\/categories?post=782"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fabiocicerchia.it\/wp-json\/wp\/v2\/tags?post=782"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}