No.
Check the documentation of the String class, for a method that searches for a substring.
.... String line = "This is example program with spaces"; String[] tokens = line.split(" "); System.out.println(tokens.length-1); .......
One way to do this is to convert the number to a String, then use the corresponding String method to find out the length of the String.
This functionality is already in Java. String.toLowerCase() and String.toUpperCase() will take care of it for you.
You find a language that can be targeted towards the .NET Framework. What you are suggesting is something related to string manipulation and you can work with delimiters.
8086 assembly language program to check wether given number is perfect or not
what is string
The location of a substring within a string in JavaScript can be found using the indexOf() method of the string type. That method will return the placement of a string as a numerical index, starting from 0. The method takes two arguments. The first is the substring you're looking for. In this case "e." The second argument is optional, and it's the "start" argument. If you define it, you define the index from which JavaScript will start looking for the substring. By default, this index is 0 (zero.) If you want to find all of the occurrences of a string using this method, you have to write a loop. To see a working example of that, check out the JSFiddle in the related links. I've also attached a good lesson on JavaScript strings in PDF.
Use the tolower() function. Example: char* a = 'X'; a = tolower(a); printf("%c", a);
i dont no string for servlate
a write the algorithm to concatenate two given string
i am sam