There were four rounds. \n\n**Round 1**\n* Remove duplicates from a sorted array, exact problem: [Problem-26](https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/)\n* Given an unbalanced/invalid bracket string, *add* minumum braces to balance it and return balanced string. Variation of [Problem-301](https://leetcode.com/problems/remove-invalid-parentheses/description/), such that instead of removing braches, you need to rather add braces.\n\n**Round2**\n* Compute intersection of 2  arrays. [Problem-350](https://leetcode.com/problems/intersection-of-two-arrays-ii/description/)\n* Clone Graph - [Problem-133](https://leetcode.com/problems/clone-graph/description/)\n\n\n**Round3**\n* Behaviourial questions.\n* Multiply 2 sparse vectors, each vector is 1 x N, 1 x M array. This is bascially 1D version of [Problem-311](https://leetcode.com/problems/sparse-matrix-multiplication/description/).\n\n**Round4**\n* This was system design round. I was asked to design a realtime fb comments update system.

There were four rounds. \n\nRound 1\n Remove duplicates from a sorted array, exact problem: Problem-26\n Given an unbalanced/invalid bracket string, add minumum