1. Codility codingtest with 2 questions on algorithms 2. Code interview with lead developer on a shared board : method with two int arrays as input that return an array as output which does not have common elements in the given two arrays after you write the solution, what will be the time complexity? 2 times o(n)*o(n). How can we reduce this time comlexity or make it memory efficient? 3. Technical interview with manager : diff between Kafka and rabbit mq, some more questions about kafka how Kafka is scaled. Difference between rational and no sql databases. How relational databases are scaled. Data structure questions. Pseudo code method with a string input returns a string output with the occurrences of duplicates input: abbcccabbbb output: a2b3ca4b
