10 : Pattern Printing | Hackerrank C Solutions

preview_player
Показать описание
Started this Channel in March 2020
Please Subscribe us we r needed 1k subscribers as fast as we do till March 2021.....

Please Please Please
Thanks if u are Watching us...
Go For next Solution....
#HackerSolutions #Coding#Programming #HackerRank #C #Dev19 #C++
Рекомендации по теме
Комментарии
Автор

No difficulties after you taught!! Thanks...

arunaagt
Автор

everything is perfect and clear, except the last part, you should explain that
in line 42 : printf("\n"); should come after the brackets in line 43.
then the output will be perfect.
Thanks, man.

Ashok-mhdf
Автор

Thank you so much, brother. You made the code in a simple and easily understandable way

muralibehera
Автор

Thxs...bro....We will help to share ur channel...!!!
Thxs for explaining ❤️❤️❤️😘

aaryansj
Автор

How did you built logic and how you approached to this kind of problem .
I find my self difficult while doing this 🙏🙏🙏

biswajitrout
Автор

Super bro I too thought of this logic but I coulnt implement it. I looked for the web for codes but they were quite confusing. Yours is easy. Thanks

karthikbs
Автор

Bro you taught really well . Your cide was simple to understand though it has greater time complexity.

varunjain
Автор

Thank you so much for this video!! very well explained...

nikhilmahajan
Автор

thank you so much bro, your code is very easier to understand :)

rajands
Автор

you are most help for solve hacker rank problems thank you so

CODEINFINITY
Автор

Very clear explanation sir...Thank you soo much

samyukthasrinivasan
Автор

Very nice explanation. Thank you so much.

yasminsaleem
Автор

Abey Answer print toh karde last video pause karke problem solve kar diya lekin hum log aese nhi kar sakte :(

ezkakashi
Автор

The complete and correct solution 👍👍👍👍

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int main() {
int n;
scanf("%d", &n);
int size = 2 * n - 1;
int start = 0;
int end = size - 1;
int a[size][size];

while (n != 0) {
for (int i = start; i <= end; i++) {
for (int j = start; j <= end; j++) {
if (i == start || i == end || j == start || j == end)
a[i][j] = n;
else
a[i][j] = n - 1;
}
}
++start;
--end;
--n;
}

for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++)
printf("%d ", a[i][j]);
printf("\n");
}

return 0;
}

vishallazrus
Автор

I tried to solve it for 3-4hrs and i gave up and checked for solution in YouTube after watching this video i realised i have 0 common sense 😢

karthik-pkzh
Автор

Easiest explanation ever it took me 2 hours to decode this after looking at the explanation I am now getting sad ;😂 mere dimag me kyu nahi aaya ye

thefourhourtalk
Автор

Thanks a lot bro. I was just searching someone to understand how to implement it. Codes on Google were very confusing.

alien
Автор

I really appreciate your work. Thanks alot!

ibrahimhafez
Автор

Nicely explained, try hindi for better explanation

rhan-py
Автор

Bro u really helped me understand this question 🙏 thnks a lot man ❤️

geheron