An online assessment included two coding questions. Both were fairly standard programming tasks. I can't replicate them in words, but I can give a general direction. They were LeetCode style.

A LeetCode question on DFS and with memoization. Given an undirected tree, you're asked to find the maximum node value sum on any path (a path comprising of connected nodes) which goes in one direction (in other words, two nodes in the path don't have the same height or depth).

A binary search question where it's tricky to find whether it indeed is binary search, but it is. You have to binary search on the final answer (low = 0 and high = 1e9, guessed as per the variable constraints). The final answer is calculated in N log N.