This question already has answers here:
In ruby how do you tell if a string input is in uppercase or lowercase?
(3 answers)
Closed 8 years ago.
How to detect in Ruby if a sentence has all lower case letters? Likewise, how to detect if a sentence has all uppercase letters?
You can assume this is an English sentence with no foreign characters.
Simple question, I know. Please excuse brevity.
'string' == 'string'.downcase
If the string is equal to the string with all letters lowercased, then all letters are lowercased.
See here and here.
Related
Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 2 years ago.
Improve this question
Design an algorithm to determine how many numbers are in a string. Example, given the string "Hello people from the 4 worlds, this is my only 1 program", the output must be 2.
Basically you need to write a simple parser to parse out the numbers in your string. To do that you need to be able to recognise a number correctly, which is a little more complicated than just recognising digits. Something like "-12,348.971" is a number, but contains the characters -,. which are not digits. However, the string "-,." is not itself a number.
Read through the string, character by character. When the parser finds the start of a number, count one more number found, and read through all the characters that form that number. Read '123' as a single number, not three numbers. When you reach the end of the number skip over non-number characters until either you find the next number or you reach the end of the file.
You might want to read up on writing a simple parser in the language of your choice.
Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 5 years ago.
Improve this question
I have a situation where I need to grab a large number from a string. The two cases I'm working with are:
1) when the number is made up of only numbers, like 265038960
2) When the number has a letter appended to it, like 69235M
I've been using the regex pattern
(\d.+)[A-Z]
This works for the second case and grabs '69235' without the 'M', but breaks on the first case where a letter is not found.
How can I use a condition within the regex to only parse out the number whether or not a letter is present at the end of the string?
(\d+[A-Z]?) # capture any number of digits, together with 0 or 1 uppercase letter
It's not clear if you want to capture the letter or not. In the case you want to dispose of the letter:
(\d+)[A-Z]? # capture any number of digits, followed by 0 or 1 uppercase letter
Look at example
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 6 years ago.
Improve this question
On what language is more easy to code that kind of algorithm and make it more flexible to changes.
It's pretty easy to do, at least in widely used programming languages that I'm aware of (e.g. C++, Java, etc).
Store all possible characters in an ordered collection like array or a string. For example, you can make a string that contains all letters and digits like so:
// Exact syntax depends on your programming language.
//
// I used a string for simplicity here but some languages don't allow
// you to access individual string characters so you'll need an array.
//
string a = "abcdefghijklmnopqrstuvwxyz0123456789";
Generate a random number between 0 and length(a) - 1 (size of your character set array minus one).
Use the number you generated as an index and extract the character from the array at that index.
Congratulations! You've just generated one random character from your character set. Go back to step #2 and repeat N - 1 times (N is here the total number of characters you want to generate).
This question already has an answer here:
Difference between String.scan and String.split
(1 answer)
Closed 9 years ago.
What is the difference between ".scan" and ".split" in Ruby language?
Can someone give me an example?
i am really got confused about it!
scan extracts substrings that match the given regex.
split extracts substrings that do not match the given regex (and optionally, substrings that match as well).
This question already has answers here:
Reverse the ordering of words in a string
(48 answers)
Closed 9 years ago.
I was recently asked this question in an interview.
Initially, I was asked to reverse a sentence without using inbuilt String api methods like split etc.
I/p : I like god
O/p : god like I
I did this using a stack. His next question was to accomplish this without using additional memory.
How do we achieve this in java?
Thanks!
Reverse the sentence in-place on a character-by-character basis, then reverse each word in the sentence in-place on a character-by-character basis.