During Algorithmic interview at first I was asked about common things related to Computer Science: - what happens when user inputs query in the browser and presses Enter. This leaded us to DNS, 7 OSI levels, https/http, TLS, TCP/UDP connections, json/xml - how HashMap works and what's the time complexity of adding/getting an element. This leaded us to hash functions and collisions - OOP, inheritance and composition (advantages and disadvantages). The second part was the algorithmic task itself: "You are given an array A of non-negative numbers and a target sum S. Write an efficient function that finds one continuous sub-sequence of elements which sum up to precisely S. The return value should be a pair of array indices or an empty array."
