{"id":348,"date":"2008-06-11T20:08:30","date_gmt":"2008-06-12T01:08:30","guid":{"rendered":"http:\/\/www.wiredprairie.us\/blog\/index.php\/archives\/348"},"modified":"2008-06-11T20:08:30","modified_gmt":"2008-06-12T01:08:30","slug":"technical-interview-question-9","status":"publish","type":"post","link":"https:\/\/www.wiredprairie.us\/blog\/index.php\/archives\/348","title":{"rendered":"Technical Interview Question #9"},"content":{"rendered":"<p><a href=\"http:\/\/www.wiredprairie.us\/blog\/index.php\/archives\/128\">Technical Interview Series<\/a><\/p>\n<p>The distance between two points is &#8230;<\/p>\n<p><a href=\"http:\/\/www.wiredprairie.us\/blog\/wp-content\/uploads\/2008\/06\/image10.png\"><img loading=\"lazy\" height=\"37\" alt=\"image\" src=\"http:\/\/www.wiredprairie.us\/blog\/wp-content\/uploads\/2008\/06\/image-thumb9.png\" width=\"198\" border=\"0\"\/><\/a>&nbsp;<br \/>Create a function which does the following&#8230;<\/p>\n<p>Record the last 150 points (x, y) provided to the function (bonus points for allowing a configurable number of points).<\/p>\n<p>Determine which of the previous points are less than a configured distance between the new point and the previous points.<\/p>\n<p>There may be hundreds of new points in a second&#8230; Consider the impact of time and CPU impact for your solution.<\/p>\n<p>(if your preferred programming language does not have a square root function, assume one exists.)<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Technical Interview Series The distance between two points is &#8230; &nbsp;Create a function which does the following&#8230; Record the last 150 points (x, y) provided to the function (bonus points for allowing a configurable number of points). Determine which of the previous points are less than a configured distance between the new point and the [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"spay_email":"","jetpack_publicize_message":"","jetpack_is_tweetstorm":false,"jetpack_publicize_feature_enabled":true},"categories":[4,10],"tags":[],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/pd5QIe-5C","jetpack_likes_enabled":true,"jetpack-related-posts":[{"id":447,"url":"https:\/\/www.wiredprairie.us\/blog\/index.php\/archives\/447","url_meta":{"origin":348,"position":0},"title":"Coding Challenge #16","date":"July 30, 2008","format":false,"excerpt":"Coding Challenge Series \/ Technical Interview Series You're given the size of a rectangle, with a width and a height. The X = 0 and Y = 0 point is located in the upper left with the width and height in the lower right. The function you must write takes\u2026","rel":"","context":"In &quot;Coding&quot;","img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":429,"url":"https:\/\/www.wiredprairie.us\/blog\/index.php\/archives\/429","url_meta":{"origin":348,"position":1},"title":"Coding Challenge #15","date":"July 23, 2008","format":false,"excerpt":"Coding Challenge Series \/ Technical Interview Series Create a structure which represents a binary tree. Iterate through all of the elements of the tree in any order, without using recursion. Update: Your function is only provided the root of the constructed tree. A tree node should contain no more than\u2026","rel":"","context":"In &quot;Interview&quot;","img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":144,"url":"https:\/\/www.wiredprairie.us\/blog\/index.php\/archives\/144","url_meta":{"origin":348,"position":2},"title":"Technical Interview Question #2","date":"April 23, 2008","format":false,"excerpt":"Interview Series I have an array. I need the array's element order randomized. So, if I have an array like this: a[0] = \"abc\" a[1] = \"def\" a[2] = \"ghi\" a[3] = \"jkl\" \u00a0 It might be randomized like this: a[0] = \"jkl\" a[1] = \"def\" a[2] = \"abc\" a[3]\u2026","rel":"","context":"In &quot;Coding&quot;","img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":533,"url":"https:\/\/www.wiredprairie.us\/blog\/index.php\/archives\/533","url_meta":{"origin":348,"position":3},"title":"Coding Challenge #21","date":"September 3, 2008","format":false,"excerpt":"Coding Challenge Series \/ Technical Interview Series Create a function which copies byte data from a source location to a destination location (you might use pointers or an array depending on the programming language). The function must copy using this pattern: 8 bytes, skip 8 bytes, 4 bytes, skip 8\u2026","rel":"","context":"In &quot;Coding&quot;","img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":129,"url":"https:\/\/www.wiredprairie.us\/blog\/index.php\/archives\/129","url_meta":{"origin":348,"position":4},"title":"Technical Interview Question #1","date":"April 16, 2008","format":false,"excerpt":"Interview Series I need you to build a fuzzy clock. When asked by others, \"What time is it?\" do you answer precisely, \"7:34 AM\"? I don't. Many would instead answer, \"About seven-thirty\". Write the code necessary to provide the fuzzy clock response. Consider a few of the valid responses to\u2026","rel":"","context":"In &quot;Coding&quot;","img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":688,"url":"https:\/\/www.wiredprairie.us\/blog\/index.php\/archives\/688","url_meta":{"origin":348,"position":5},"title":"Calculating the distance between two Zip Codes in C#","date":"January 24, 2009","format":false,"excerpt":"How far is it from the USA Zip code 90210 to 73487 (by drawing a line, not by driving)? Unfortunately, there are many classes built into the .NET framework, but a zip code distance calculator isn\u2019t included. So, you\u2019d be forced to roll your own if you want to programatically\u2026","rel":"","context":"In &quot;Coding&quot;","img":{"alt_text":"","src":"https:\/\/i0.wp.com\/www.wiredprairie.us\/blog\/wp-content\/uploads\/2009\/01\/image17.png?resize=350%2C200","width":350,"height":200},"classes":[]}],"_links":{"self":[{"href":"https:\/\/www.wiredprairie.us\/blog\/index.php\/wpjson\/wp\/v2\/posts\/348"}],"collection":[{"href":"https:\/\/www.wiredprairie.us\/blog\/index.php\/wpjson\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wiredprairie.us\/blog\/index.php\/wpjson\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wiredprairie.us\/blog\/index.php\/wpjson\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wiredprairie.us\/blog\/index.php\/wpjson\/wp\/v2\/comments?post=348"}],"version-history":[{"count":0,"href":"https:\/\/www.wiredprairie.us\/blog\/index.php\/wpjson\/wp\/v2\/posts\/348\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wiredprairie.us\/blog\/index.php\/wpjson\/wp\/v2\/media?parent=348"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wiredprairie.us\/blog\/index.php\/wpjson\/wp\/v2\/categories?post=348"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wiredprairie.us\/blog\/index.php\/wpjson\/wp\/v2\/tags?post=348"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}