Queen's Attack II | HackerRank Solution | Hindi c++ 

WAAH YAAR MAZE AAGAYE

Solution without using Graph - int attackcount = 0; int left = c_q - 1, right= n - c_q; int up = n - r_q, down = r_q - 1; int upleft = min(up,left),upright = min(up,right); int downleft = min(down,left),downright = min(down,right); for(int i = 0;i obstacles[i][0] && c_q == obstacles[i][1]){ down = min(down,r_q - obstacles[i][0] -1); } else if(r_q == obstacles[i][0] && c_q > obstacles[i][1]){ left = min(left,c_q-obstacles[i][1]-1); } else if(r_q == obstacles[i][0] && c_q < obstacles[i][1]){ right = min(right,obstacles[i][1]-c_q-1); } else if(r_q < obstacles[i][0] && c_q>obstacles[i][1]){ if(abs(r_q - obstacles[i][0])==abs(c_q-obstacles[i][1])){ upleft = min(upleft,obstacles[i][0]-r_q-1); } } else if(r_q obstacles[i][1]){ if(abs(r_q - obstacles[i][0])==abs(c_q-obstacles[i][1])){ downleft = min(downleft,c_q-obstacles[i][1]-1); } } else if(r_q > obstacles[i][0] && c_q < obstacles[i][1]){ if(abs(r_q - obstacles[i][0])==abs(c_q-obstacles[i][1])){ downright = min(downright,obstacles[i][1]-c_q-1); } } } attackcount = (up + down + left + right + upleft + upright + downleft + downright); return attackcount;

nc bro

Solved it just using one for loop 💀

excellent explanation sir and iam from tamilnadu south east xD :)

i am so naive... i didn't knew this question uses graph concepts .. so i solved it by using 8 while loops 10 for loops 16 if else conditions i don't even remember exact count LOL....after this much struggle i feared of time limit and as i thought it failed in 3/21 test cases.....time exceeded

thank you so much. i have 1 question that why in line 32 and 33, i code (x = obstacles) not equal (int x = obstacles); the diffrent is ( int ) but i don't know why it is??

map ke jagah pe unordered map use kyu nhi kr skte