Got this opporutnity through campus, but it is available externally as well. You just need to go to their website and apply for the "Code For Good" programme which according to my understanding, is the only way they hire freshers.

How does it work?
Online coding test -> Hirevue interview -> Hackathon -> selected for job

In the online coding test there were 2 questions and a total time of 1 hour to solve both.

Q.1 Delete Anagrams
An anagram of a word, is another word that is of the same length as the original word but with a change in the order the characters.
You are given an array of Strings. You read the array from left to right, if you read a word that is an anagram of any previous word, delete the current word. Return the array with all anagrams deleted by following the above mentioned method. Return the array in ascending alphabetical order.

eg) arr = ["code" , "dcoe" , "timer", "timerr", "remit"]
answer = ["code", "timer", "timerr"]

Q.2 Match Expression with minimum number of operations

An expression is said to be matched if for every '>' there is a corresponding '<' to the left it. Example of a matched expression is <<><>>.
Say you have an unmatched expression eg <>>, then can you convert it to a matched expression if the only operation you can do is replace a '>' with a '<>'.
Two arrays were given: expressionsArray, maxReplacements both were of the same length.
We had to iterate through the expressionsArray and check if we can return a balanced expression (say for expressionsArray[i] if we are allowed to execute the above mentioned operation only maxReplacements[i] number of times.
Return a boolean array indicating if it is possible.

eg)
expressionsArr = ["<<>" , "<<><><<>>", "<>>>"]
maxReplacements = [1,0,2]
Answer = [False, True, True]

If you guys are looking to practice problems similar to the above problems then I would suggest
Valid Paranthesis and any anagram related quesetions on leetcode (marked easy) .
https://leetcode.com/problems/find-resultant-array-after-removing-anagrams/