Question d’entretien chez Cians Analytics

Given an array , find first repeated string. Given an array return a value which has most frequency.. Coding round in hackerrank was medium level Given a number N , find how many BST can be formed using digits 1 to N Given two string S and P find if P occurs in S. Given an array find the longest subarray whose sum is maximum, Client round was mostly Aptitude and design round. Given a game simulation scenrio , I was required to come up with an algorithm to play that game optimally as much as possible. Basic APIs and time and space complexity.