**Online Assessment**\n1. Question related to binary search.\n\nCoding Round -1 \nYou\'re given a 3x3 board of a tile puzzle, with 8 tiles numbered 1 to 8, and an empty spot. You can move any tile adjacent to the empty spot, to the empty spot, creating an empty spot where the tile originally was. The goal is to find a minimum number of moves that will solve the board, i.e. get [ [1, 2, 3], [4, 5, 6], [7, 8, - ]\u2026\n\nCoding Round -2 \n\nInput is a array represent how the height of water is at each position, the number of water will be poured, and the pour position. Print the land after all water are poured.\n\nExample: input land height int[]{5,4,2,1,3,2,2,1,0,1,4,3} The land is looks like:\n\n```\n+\n++        +\n++  +     ++\n+++ +++   ++\n++++++++ +++\n++++++++++++\n012345678901\nwater quantity is 8 and pour at position 5. The land becomes:\n\n+\n++        +\n++www+    ++\n+++w+++www++\n++++++++w+++\n++++++++++++\n012345678901\n\n```\n\n**Architectural Interview**\n\n\n**Experience Interview**\n\nDiscussion regarding my current organisation project, from business requirement to development, challenges, timelines estimation, impact, my contribution, etc. Basically, they are checking if I know end to end and each and every minor info about the project. Also, few questions regarding the scalability and the scope of any improvement in the current design.

Online Assessment\n1. Question related to binary search.\n\nCoding Round -1 \nYou\'re given a 3x3 board of a tile puzzle, with 8 tiles numbered 1 to 8, and an e