{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:59:25Z","timestamp":1750309165829,"version":"3.41.0"},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Queue"],"published-print":{"date-parts":[[2023,12,31]]},"abstract":"<jats:p>\n            Top tech interviews test coding and CS knowledge overtly, but they also evaluate a deeper technical instinct so subtly that candidates seldom notice the appraisal. We'll learn how interviewers\n            <jats:italic>create<\/jats:italic>\n            questions to covertly measure a skill that sets the best programmers above the rest. Equipped with empathy for the interviewer, you can prepare to shine on the job market by seizing camouflaged opportunities.\n          <\/jats:p>","DOI":"10.1145\/3639444","type":"journal-article","created":{"date-parts":[[2024,1,15]],"date-time":"2024-01-15T23:03:36Z","timestamp":1705359816000},"page":"16-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Programmer Job Interviews: The Hidden Agenda"],"prefix":"10.1145","volume":"21","author":[{"given":"Terence","family":"Kelly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,1,15]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"73","volume-title":"Programming Pearls","author":"Bentley J.","unstructured":"Bentley, J. 2000. Programming Pearls, second edition. ACM Press (See page 73 for Little's Law)."},{"key":"e_1_2_1_2_1","first-page":"24","volume-title":"On the cruelty of really teaching computer science. EWD 1036 (See page 11 for the software engineering quote and","author":"Dijkstra E.","unstructured":"Dijkstra, E. 1988. On the cruelty of really teaching computer science. EWD 1036 (See page 11 for the software engineering quote and pages 23?24 for the brain teaser); http:\/\/www.cs.utexas.edu\/users\/EWD\/ewd10xx\/EWD1036.PDF."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1511\/2006.59.200"},{"key":"e_1_2_1_4_1","volume-title":"Compressed sparse row format for representing graphs. Usenix ;login: 45(4), 76?82","author":"Kelly T.","year":"2020","unstructured":"Kelly, T. 2020. Compressed sparse row format for representing graphs. Usenix ;login: 45(4), 76?82; https:\/\/www.usenix.org\/publications\/login\/winter2020\/kelly."},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Kelly T. 2020. Efficient graph search: stop when done. acmqueue 18(4); https:\/\/queue.acm.org\/detail.cfm?id=3424304.","DOI":"10.1145\/3424302.3424304"},{"key":"e_1_2_1_6_1","volume-title":"Hand-over-hand locking for highly concurrent collections. Usenix ;login: 45(4), 61?66","author":"Kelly T.","year":"2020","unstructured":"Kelly, T. Hand-over-hand locking for highly concurrent collections. Usenix ;login: 45(4), 61?66; https:\/\/www.usenix.org\/publications\/login\/fall2020\/kelly."},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Kelly T. 2020. Offline algorithms in low-frequency trading: clearing combinatorial auctions. acmqueue 18(6); https:\/\/queue.acm.org\/detail.cfm?id=3448307.","DOI":"10.1145\/3442632.3448307"},{"volume-title":"The Practice of Programming","author":"Kernighan B. W.","key":"e_1_2_1_8_1","unstructured":"Kernighan, B. W., Pike, R. 1999. The Practice of Programming. Addison-Wesley."},{"volume-title":"The Art of Computer Programming","author":"Knuth D.","key":"e_1_2_1_9_1","unstructured":"Knuth, D. The Art of Computer Programming. Addison-Wesley (In several volumes; new volumes are in progress); https:\/\/www-cs-faculty.stanford.edu\/~knuth\/taocp.html."},{"key":"e_1_2_1_10_1","unstructured":"Mongan J. Suojanen N. Errata sheet for Programming Interviews Exposed; https:\/\/www.wiley.com\/legacy\/compbooks\/programminginterview\/errata.html."},{"key":"e_1_2_1_11_1","unstructured":"Sedgewick R. 2023. Algorithms series (a family of textbooks that includes specialized variants in several programming languages); https:\/\/sedgewick.io\/books\/algorithms\/."}],"container-title":["Queue"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639444","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3639444","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:53:37Z","timestamp":1750287217000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639444"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12,31]]}},"alternative-id":["10.1145\/3639444"],"URL":"https:\/\/doi.org\/10.1145\/3639444","relation":{},"ISSN":["1542-7730","1542-7749"],"issn-type":[{"type":"print","value":"1542-7730"},{"type":"electronic","value":"1542-7749"}],"subject":[],"published":{"date-parts":[[2023,12,31]]},"assertion":[{"value":"2024-01-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}