I will give the problems that were used for the algo round: 1. Given an array of integers, find all the pairs having the smallest distance between them, and print them in lexical order. 2. Given two points p, q and three points that form a triangle, determine if the points form a valid triangle, if p falls inside this triangle, and if q falls inside this triangle. 3. Given a string s, a series of queries each composed of a pair of indices (i, j) and a number of edits k, determine for each query if the substring delimited by its pair of indices indices (i, j) can be edited at most k times to form a string that can be rearranged to a palindrome