It had one online coding round consisting of 3 questions.

The students shortlisted based on the online round had 3 one-on-one technical interviews, with each round being a knockout round.

Given an array of integers and an integer ‘k’, find the number of distinct pairs of integers whose sum is ‘k’.

Given a string s, find the number of substrings of s, when converted to an integer, that give a prime number (<= 10^6).

Given two strings s1 and s2, find the length of the shortest substring of s1 which contains all the characters of s2.

Examples:

s1 = "asfdbgdseasd", s2 = "eag" Output: 5 ("gdsea" substring)

s1 = "hackerrank", s2 = "kah" Output: 3 ("kha" substring )

Given a binary tree in which all nodes can have one of two values: 0 or 1. If the values of all leaf nodes are 0 and the value of the root is 1, change the root value to 0. Return the final value of the root of the given binary tree.