**Question 1:**\nhttps://leetcode.com/problems/custom-sort-string/\nGiven one string (\'abbceeeg\') sort it based on another string (\'egbca\')\nResult will be: \'eeegbbca\'\n\nSolved in nlog(n) and O(n) space. Was hinted there could be better run time. Struggled for a bit, was asked to code nlog(n). During the final step realized that right now my solution could blow up to O(n^2). Mentioned it. Was told "that\'s a good observation. Can you still stick to nlog(n)?" Managed to do it by introducing another data structure, thus, bringing space complexity to O(2n). At the end was told it\'s ok\n\n**Question 2:**\n[Given a sequence of positive integers nums and an integer k, return whether there is a continuous sequence of nums that sums up to exactly k.](https://leetcode.com/discuss/interview-question/algorithms/124820/continuous-sequence-against-target-number)\n\nDidn\'t solve efficiently. The link above has a nice solution with a set. I did with a dictionary (excessive) and didn\'t have enough time to dry run it but was told that the solution "looks reasonable and accurate."\n\nThank god i\'m not a programmer and don\'t have to do programming interviews anymore

Question 1:\nhttps://leetcode.com/problems/custom-sort-string/\nGiven one string (\'abbceeeg\') sort it based on another string (\'egbca\')\nResult will be: \'e