[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-391129-105":59,"doc-detail-391129-en":130},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":123,"head_meta":125,"extra_data":127,"updated_unix":129},105,"en","3-technical-interview-questions","3 Technical Interview Questions","","Set of three technical interview questions with guiding explanations and solution outlines for evaluating candidate problem-solving and coding skills. Question 1 covers computing the intersection of two integer lists, comparing brute-force nested loops, sorting with two pointers, and an optimal hash-table counting approach while highlighting duplicate handling. Question 2 focuses on implementing a queue using two stacks with enqueue/dequeue logic and exception behavior. Question 3 targets higher-level system design for a parking garage, including ticketing, capacity tracking, and identifying classes or tables.",{"@graph":69,"@context":122},[70,84,105],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":20,"@type":76,"position":81},"https://docshare.wps.com/document/exam/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/3-technical-interview-questions/391129/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/3-technical-interview-questions/391129.png","ImageObject",300,407,{"name":92,"@type":93},"Chumphorn","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-11-09","2026-09-25",true,{"@type":102,"interactionType":103,"userInteractionCount":81},"InteractionCounter",{"@type":104},"ViewAction",{"@type":106,"mainEntity":107},"FAQPage",[108,114,118],{"name":109,"@type":110,"acceptedAnswer":111},"How should duplicates be handled when intersecting two integer lists?","Question",{"text":112,"@type":113},"The intersection must respect duplicate counts. For example, [1,2,2,3] and [2,2,3,4] should intersect as [2,2,3], not just [2,3].","Answer",{"name":115,"@type":110,"acceptedAnswer":116},"What is the core idea of implementing a queue using two stacks?",{"text":117,"@type":113},"Use one stack for enqueue (entryStack) and another for dequeue (exitStack). Dequeue pops from exitStack; if exitStack is empty, move all items from entryStack to exitStack first, otherwise the queue is empty and an exception is thrown.",{"name":119,"@type":110,"acceptedAnswer":120},"What components should be considered when designing a parking garage software system?",{"text":121,"@type":113},"Plan for the ticketing system and for tracking when the garage is full. As the discussion progresses, map out the classes or database tables needed to store and manage the relevant data, and optionally dive into ticketing and billing coding if time allows.","https://schema.org",{"og:url":83,"og:type":124,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":126,"canonical":83},"index,follow",{"doc_id":128,"site_id":62},391129,1792634178,{"code":4,"msg":5,"data":131},{"doc_id":128,"user_id":132,"nickname":92,"user_avatar":133,"doc_module":4,"category_id":19,"category_name":20,"doc_title":65,"doc_description":67,"doc_content":134,"file_id":135,"file_url":136,"file_type":137,"file_size":138,"view_count":81,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":14,"language":139,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":140,"faqs":141,"seo_title":142,"seo_description":67,"update_tm":143,"read_time":24,"preview_page_count":4},2336475401981,"https://ap-avatar.wpscdn.com/avatar/22000c94efd8d5204d?x-image-process=image/resize,m_fixed,w_180,h_180&k=1786935347598174694","3 Technical Interview Questions  \nQuestion 1  \nGiven 2 different lists of integers, write a function that will return their intersection.  \nI love this question because there are several possible solutions, each with different performance characteristics. When the candidate arrives at a solution you can ask them how fast it is and see if they can solve if with additional constraints.  \nSolution 1  \nA doubly nested for loop.  \nRuntime O(n2)  \nIt’s ok if this is the first solution the candidate comes up with, it’s pretty easy, but not optimal. This is a good opportunity to ask them if they can make it faster.  \nSolution 2  \nSort both lists, then traverse them with 2 pointers (one per list) . Increment the pointer that points at the smaller value. If both pointers point at the same value, insert it into the result and increment both pointers. Runtime O(nlogn)  \nThis solution has the advantage of using less space than the final solution, while still being pretty fast.  \nSolution 3  \nIterate the first list, put the values into a hashtable, using the value as the key, and the count as the value (if it’s already in the list increment count by one, else insert a count of 1) . Then iterate list2 , if the value is in the hashtable and > 0 insert that value into the result array, decrementing the value in the hash table.  \nRuntime O(n)  \nThis is the optimal solution. A common mistake will be forgetting to keep a counter and neglecting any duplicates in the result list ([1,2,2,3] and [2,2,3,4] should intersect as [2,2,3] and not just [2,3]).  \nmeasure developer skill over the phone  \n3 Technical Interview Questions  \nQuestion 2  \nImplement a queue using 2 stacks. Specifically, implement the enqueue and dequeue methods.  \nThis question is good because it shows how well the candidate knows their data structures. It also forces them to write a class with some internal state.  \nSolution  \nIn the constructor initialize 2 stacks, “entryStack” and “exitStack”. The enqueue method pushes the value onto entryStack. The dequeue method pops from exitStack if it’s not empty, otherwise pop all items from entryStack onto exitStack. If they’re both empty throw an exception.  \nQuestion 3  \nDesign the software system for a parking garage. You’ll want to handle the ticketing system and keeping track of when the garage is full.  \nI like this question because there are a lot of different directions you can go with it. It’s good for a higher level design discussion, but as it progresses you can ask the candidate to start mapping out some of the classes or tables that will be necessary to track the data. You can also get into coding with the ticketing and billing system, depending on how much time you have.  \nSolution  \nLots of possible solutions, but the goal is to have a conversation, not just get to an answer.  \nmeasure developer skill over the phone","cbCaikuQ0PrCsQWK","https://ap.wps.com/l/cbCaikuQ0PrCsQWK","pdf",141352,"English","# Question 1\n## Solution 1\n## Solution 2\n## Solution 3\n# Question 2\n## Solution\n# Question 3\n## Solution","[{\"question\":\"How should duplicates be handled when intersecting two integer lists?\",\"answer\":\"The intersection must respect duplicate counts. For example, [1,2,2,3] and [2,2,3,4] should intersect as [2,2,3], not just [2,3].\"},{\"question\":\"What is the core idea of implementing a queue using two stacks?\",\"answer\":\"Use one stack for enqueue (entryStack) and another for dequeue (exitStack). Dequeue pops from exitStack; if exitStack is empty, move all items from entryStack to exitStack first, otherwise the queue is empty and an exception is thrown.\"},{\"question\":\"What components should be considered when designing a parking garage software system?\",\"answer\":\"Plan for the ticketing system and for tracking when the garage is full. As the discussion progresses, map out the classes or database tables needed to store and manage the relevant data, and optionally dive into ticketing and billing coding if time allows.\"}]","3 Technical Interview Questions | PDF",1790349563]