Quote:This is not true. If you are good, many places do not care if you got a degree in something unrelated or never even attended university.
Well it certainly increases your chances, a lot.
Quote:Actually I only need to search for uppercase characters, so would only need 26 elements.
The problems are as follows:
a) The internet has told me to use a hashmap instead of an array. I have no clue what the difference is, and no clue how to implement one.
b) I don't know exactly how to do the comparing a specific location in a string to another string. I only learned this afternoon how to compare the whole of a string to another string @(as stringName != "y" apparently always evaluates to true, even when the string is "y").
c) The example code I can find doesn't do this exactly how you say. There's a faster way to do it (there may be a library function that gives the total count of a character in a string, but the code I've seen was poorly formatted, so I struggled reading it).
I'm guessing you got ninja'd by shuffle.
"Normally if given a choice between doing something and nothing, I’d choose to do nothing. But I would do something if it helps someone else do nothing. I’d work all night if it meant nothing got done."
-Ron Swanson
"I shall be a good politician, even if it kills me. Or if it kills anyone else for that matter. "
-Mark Antony
-Ron Swanson
"I shall be a good politician, even if it kills me. Or if it kills anyone else for that matter. "
-Mark Antony