ho gya just enter counts >0 for a row in a vector and multiply and insert adj elements :D
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int numberOfBeams(vector<string>& bank) {\n    vector<int>cou;\n    int count;\n        for(int i=0;i<bank.size();i++)\n        {  \n            count=0;\n            for(int j=0;j<bank[i].length();j++)\n            {\n                 if(bank[i][j]==\'1\')\n                    count++;\n            }\n            if(count>0)\n            cou.push_back(count);\n        }\n        int ans=1;\n        int cnt=0;\n        int sum=0;\n        for(int i=1;i<cou.size();i++)\n        {\n          sum+=cou[i]*cou[i-1];\n\n        }\n        return sum;\n  \n    }\n};\n```
['C++']