C++ Simple and short solution.
Intuition\nSimply traverse in given vector and keep track of the position.\n\n# Approach\nCreate a 2-D vector for answer and then traverse in given matrix and s
# Intuition\nSimply traverse in given vector and keep track of the position.\n\n# Approach\nCreate a 2-D vector for answer and then traverse in given matrix and simultanelously place the stone or stationary obstacle accordingly and return the final matrix.(It\'s simple can be done easily).\n\n# Complexity\n- Time complexity:\nO(m*n)\n\n- Space complexity:\nO(m*n)\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    vector<vector<char>> rotateTheBox(vector<vector<char>>& box) {\n        int m=box.size(),n=box[0].size();\n        vector<vector<char>> ans(n,vector<char>(m,\'.\'));\n        int i=0;\n        while(i<m){\n            int j=n-1,a=j,b=m-i-1;\n            while(j>=0){\n                if(box[i][j]==\'#\'){\n                    ans[a][b]=\'#\';\n                    a--;\n                }\n                else if(box[i][j]==\'*\'){\n                    ans[j][b]=\'*\';\n                    a=j-1;\n                }\n                j--;\n            }\n            i++;\n        }\n        return ans;\n    }\n};\n```
['Array', 'Two Pointers', 'Matrix', 'C++']