The online assessment was on hackerank platform , 2 DSA problems I would say both were medium to hard. 1. Almost sorted -> You have been given an array and you need to tell the minimum number of elements on removing of which the array become almost sorted . Here almost sorted means the array becomes completely sorted on removing just one more element. wasnt able to even attempt even though I knew it was from binary search. 2 . I second question was table of contents -> detailed descriptiion and the exact same question : https://studyx.ai/questions/4lqdtni/design-a-system-to-extract-a-table-of-contents-toc-from-a-document-written-in-a-simple?utm_source=chatgpt.com