Houssam El

Ranch Hand
+ Follow
since Jul 11, 2020
Cows and Likes
Cows
Total received
2
In last 30 days
0
Total given
0
Likes
Total received
9
Received in last 30 days
0
Total given
4
Given in last 30 days
0
Forums and Threads
Scavenger Hunt
expand Ranch Hand Scavenger Hunt
expand Greenhorn Scavenger Hunt

Recent posts by Houssam El

rahul vishwakarma wrote: I did as you said but again it doesn't generate the project.



Do you have Eclipse IDE? if yes, File -> New -> other -> type  maven project -> click next (don't forget to tune your project into eclipse workspace) -> add archetype

Group id: co.netier
Artifcat : spring-mvc-archetype
version 1.0.2

2 weeks ago
I would suggest adding a archetype using the following information, it works for me fine, next step you would fix such issues, don't panic when you read "issues", they are easy to fix

Group id: co.netier
Artifcat : spring-mvc-archetype
version 1.0.2
2 weeks ago
@Jesse, I've succeeded to represent it in the following form "5.4", however, I struggled to flip 0's to 1's, it doesn't matter if I didn't succeed to solve this problem, but I think God that I've achieved 50% of the problem, the recruiter may take this in consideration, I wish that,
You going to encounter many problems similar to this one, and you would know how to deal with them,

who never struggle is the one who never tried something new, Albert Einstein said,



Thanks, Jesse for everything, I genuinely appreciate your help, much relief to me
2 weeks ago
@Jesse,
Counting all paths from the top left to right bottom is easy even without using BFS, moreover, I don't think that Brute Force could help here, according to my knowledge BRUTE FORCE could be used in computing, I'm still learning algorithms and data structures, you know that the field of algorithms and data structures is hard to master it you should practice more in order to get an acceptable level

if you want a program that prints available paths in the matrix I can write one, with two methods using Dynamic Programming, in short PP, and other one using Recursion.
2 weeks ago
@Jesse
BFS allows you to traverse the path from the top left to the bottom rof the matrix (as shown below), the exercise doesn't ask you to count all possible paths on the matrix(counting the possible paths on the matrix is easy), however, it wants you to determine a certain path, and if this path filled with 1's return true otherwise you program should flip 0's to 1's along traversing the path.

2 weeks ago
@Jesse
I think that the best solution for this issue is BFS, I've succeeded to visit each point or location in the matrix with respect to the direction moves that have been revealed in the description of the problem, however, I struggled to check each point pop out if it equals 1, in addition, how would I flip 0's to 1's during iterations in the path with the respect of the directions moves (up, down, right, and left)
2 weeks ago
@Jesse
Sorry for the delay, I was tired in recent days, although, I've passed two tests, the first one that characterized by the matrix problem, I've solved all questions except the matrix problem, I'm currently looking for an internship to be associated with it to flourish my skills, I've got accepted by one to pass the video test (interview) tomorrow,

Thanks, Jesse, I'm really thrilled that the Coderanch forum has a member like you

I wish success and best life
2 weeks ago
@Jesse, I knew that many questions roll up in your mind,

Q-where that question comes from?
A-It's a question that I've been interviewing during the interview

I have passing two interviews today, my mind is burning now, hahahah

the second interview was nearly easiest than the first, however, I found myself the first interview has taken much times than the second, for the second, I've resolve 4 questions out of 6

@Jesse, don't forget to send me your FB, Twitter, or whatever you want


I want to thank everybody that help me even with a single comment or views
2 weeks ago
Thanks a lot @Jesse, I really appreciate your help, furthermore, I will try to use your solutions and reply back later, if you don't mind Jesse send me your twitter. FB, or whatever you want  
2 weeks ago

Jesse Silverman wrote:My wife made me watch a whole episode of "The Wall" with her while eating lunch, and then the dog demanded not ONE but TWO walks, so this isn't an accurate assessment of my speed.

I am still in testing, but here is how I adapted the code to give the full answer.

Hey, where is this answer for?  If I can fix any stupid bugs in this I might enter myself?

//code here



No issue, Jesse, there was a French proverb that said,

who women want, God wants it too

 

I've used another approach to solve it, but, it was fill only the need of the problem, it isn't general, in other words, it doesn't work for all lengths of matrices, it works only for 3x3, I've passed two cases out of 10.
2 weeks ago
@Jesse

Yeah, no issue, I knew that it's an awkward question or even a riddle question, I hope I will find the solution today, although, tomorrow is the last day    

Thanks, Norm for your help
2 weeks ago

Norm Radder wrote:Sorry, that section of code will not compile and execute for testing.  It needs a class declaration and some  methods.


Is there a problem with providing full code that will compile and execute?
How are you compiling and testing the code?



It compiles properly on my machine, I didn't declare some special or helper class, just copy and past it on your own machine
2 weeks ago

Please post the full code that will compile and execute for testing to make sure that all code being used is EXACTLY the same here and for you.  If I use my code for parts of the test, the code could be different





Output : 1 1 1 1 1 the path that forms 1's


2 weeks ago

Sorry, I do not see any of your code with a main method or any where a 2 dim int array has values for testing.

Also I do not see any code that defines a class to hold the methods for testing.



the last message that I wrote, I've copied from main method you can copy and past it to your machine inside main method and it will work fine
2 weeks ago
@Jesse

the following code gives me one path that forms 1's, you can test in your own machine

2 weeks ago