Zigzag Conversion | Leetcode Top Interview 150

[@CodingWithAnurag-1086]

Solution code -
class Solution {
public:
string convert(string s, int numRows) {
numRows--;
int n = s.length();
int j,flag;
string ans;
if (numRows == 0) {
return s;
}
for (int i=numRows;i>=0;i--) {
if (i == numRows) {
j = 0;
while(j