can you please provide the code as some error is coming in mine 's.
Staircase search problem
this code is not working.
please send the correct code again.
Again there is error in this code too.
please first run the code by yourself and then give.
provide correct solution only.
if have already checked it and it is working fine on my machine
it is showing compilation error in coding blocks’s IDE and also in online compiler and code blocks.
please send the code again which Prateek bhaiya is talking to implement in the video.
make sure u r copying properly ,
this code is working evrywhere
it is not working.
and i am not copying it anywhere.
first i am opening in coding block’s IDE only (the link which you are providing).
it is showing error there.
give input as well before running ,
i m also running at same place and it is working totally fine
it is showing compilation error.
i just open the link and click on run.
it showing compilation error.
what language have u chosen in that ide
c++ obviously
please provide simple code of staircase search in which we cin an array and search for an element in that 2d array.
print yes and position of the element if present and print no otherwise.
please reply to the post atleast.
i am not satisfied by the answer as it is giving error everytime.
cant help u with technical issue,
please write an email to support team with appropriate screenshots
email-> [email protected]
no not technical issue.
sir please help me in this:
please provide simple code of staircase search in which we cin an array and search for an element in that 2d array.
print yes and position of the element if present and print no otherwise.
this one is also working from my side.
if again u face any issue then pls contact to support team
thank you sir.
This one is working.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.