I applied online and received a coding challenge. The challenge included 4 algorithm/data structure type problems.

The problems were not too hard but had a lot of parameters and edge cases, making getting points difficult.

Following this was a n

Given a square matrix of positive integers, sort the numbers in each of its diagonals parallel to the secondary diagonal.

Given two strings s and t, both consisting of lowercase English letters and digits, your task is to calculate how many ways exactly one digit could be removed from one of the strings so that s is lexicographically smaller than t after the removal.