I dont have screenshots of the first two, but they were something like this:

1)Given a list of strings each od length 10 find the string with minimum mismatches with all other strings.

2)given a sequence
1,2,3,5,6,7,8,9,10,11,12,13,15,16,17,18,19,20,21,22,23,25,26,27,28,29,30,31,32,33,35,36,37,38,39,50,51,52,53,55....
now you will be given a x in string format(which may also contain leading zeros) you have to find position of x in the given sequence
constarints: 1<=length(x)<=10^5
for example,
input: 12 
output: 11