wordfind | small javascript library for generating and solving word | Learning library

You need to add a solved condition like this

What is size_t and when should we use them exactly?(All I know is that we should use them for array indexing and loop counting)

size_t is an unsigned integer type large enough to represent the size of any object in C++, including array types. (size as in how much memory it occupies in bytes).

Why did we use size_t here?

Because it is typically large enough, and using something like int wouldn't be enough if the string is larger than the maximum number int can store. Pedantically, you should have used std::string::size_type, which is guaranteed to be capable of holding the size of a std::string, no matter how large it is.

couldn't it be like this?: position = s1.find(wordFind);

No, you have to specify the type of position. Alternatively you can use auto: auto position = s1.find(wordFind);

What is position exactly?(I mean is it made up or is it a part of C++?)

Just a variable representing the index of the substring (word) you are searching for.

Does the if condition mean to search the word untill the end of the string?

It's checking to see if the word is found. std::string::npos is a special number std::string::find returns when the sought substring is not found.

You have to count the line number and position of the words while iterating. Therefore you should use scanner.hasNextLine() and scanner.nextLine(). After that you can split the line:

I also get a stack overflow when I try to run the deconstructor.

This is because of this line:

Here's a quick modification to your code to make it work. Read a line as a string, then iterate over the characters in the string and place them in the char[][] array.

This is most likely because your Hadoop cluster is busy, and there just isn't space to start new yarn containers.

If you ask for N nodes, then you either get all N nodes, or the launch process times out like you are seeing. You can optionally use the -timeout command line flag to increase the timeout.

Answer should be 4, not 2, correct? My interpretation of "all possible paths" and "unique set of coordinates" is that the same coordinate cannot be reused in a single path, but different paths may use coordinates from other paths.

Your code takes quite a bit of time because of the numerous loops it runs through, and the fact that it opens a file each time it passes through the loop. Let's try to simplify the code here.

Let word_list be the list of words you would like to pass to the program, and test_list the list you want to test the newly formed words against.

The following code will print each word in word_list that has a new form in test_list, and print each of those words.

Use Glide library to load images in image view.

Glide is a fast and efficient open source media management and image loading framework for Android that wraps media decoding, memory and disk caching, and resource pooling into a simple and easy to use interface

You can use Glide like below