Most Useful String Functions in Python

Most Useful String Functions in Python



1. len(str) :  Returns Length of String

str=input("Enter String : ")

print("LENGTH OF ",str," : ",len(str))

--------------------------------------------

2. str.upper() : Converts all characters in the string to uppercase.

str=input("Enter String in Lower Case Letter : ")

print(str.upper())

 --------------------------------------------

3. str.lower() : Converts all characters in the string to lowercase.

str=input("Enter String in UPPER Case Letter : ")

print(str.lower())

 --------------------------------------------

4. str.capitalize() : Capitalizes the first letter of the string and converts all other characters to lowercase.

str=input("Enter String in lower Case Letter : ")

print(str.capitalize())

  --------------------------------------------

5. str.title() : Capitalizes the first letter of each word in the string.

str=input("Enter String in lower Case Letter : ")

print(str.title())

--------------------------------------------

6. str.strip() : Removes any leading and trailing whitespaces.

str=input("Enter String with some whitw spaces before and after string : ")

print(str.strip())

--------------------------------------------

7. str.split(separator) : Splits the string into a list of substrings based on the specified separator.

str=input("Enter String with separator : ")

print(str.split(","))

--------------------------------------------

8. str.join(iterable) : Joins the elements of an iterable (e.g., list) into a single string, with the specified separator

",".join(["hello", "world"])  # Output: "hello,world" - Can Execute on REPL Directly

str=input("Enter String with separator : ")

print(str.split(","))

---------------------------------------------

9. str.replace(old, new): Replaces all occurrences of a substring with another substring.

str="Hello World"

print(str.replace('World','Python'))

---------------------------------------------

10. str.find(substring) : Returns the index of the first occurrence of the substring, or -1 if not found.

 str=input("ENTER STRING  : ")

indexString=input("ENTER SUBSTRING YOU WANT TO SEARCH : ")

index=str.find(indexString)

print(index)

---------------------------------------------

11. str.startswith(prefix) : Checks if the string starts with the specified prefix.

str="Hello World"

print(str.startswith('Hell'))  # Returns True

 ---------------------------------------------

12. str.endswith(suffix) : Checks if the string ends with the specified suffix.

str="Hello World"

print(str.endswith('ld'))  # Returns True

 ---------------------------------------------

13. str.isdigit() : Checks if all characters in the string are digits.

 str="123456"

print(str.isdigit())  # Returns True


 14. str.isalpha() : Checks if all characters in the string are alphabetic.

 str="Atharva"

print(str.isalpha())  # Returns True


15. str.isalnum() : Checks if all characters in the string are alphanumeric (letters and numbers).

str="emp001cse"

print(str.isalnum())  # Returns True


16. Reversing a String : You can reverse a string using slicing with a negative step.

The slice [::-1] starts from the end of the string and steps backwards.

 str="Hello World..!"

print(str[::-1])

 ======== End of Article========


Thanks and Regards

Prof. Shivling G. Swami.
Head of Computer Science and Engineering, 
Sant Gajanan Maharaj College of Engineering, Mahagaon.
Whats app and Contact Number : 99 22 970 696



Comments

Post a Comment

Popular posts from this blog

Data Structures : Time Complexity

 Time Complexity Time complexity is a way to describe how the execution time of an algorithm increases as the size of the input grows. It is a measure of algorithm efficiency. Time complexity is usually expressed using Big O notation. ✅ Key Concepts ----------------------- Input Size (n):  Represents the amount of data the algorithm is processing.  Number of Operations:  Refers to the basic steps the algorithm takes (like comparisons, assignments, arithmetic operations, etc).  Big O Notation:  A mathematical notation used to classify algorithms based on their time complexity.  ✅ Common Time Complexities ---------- O(1): Constant Time: The algorithm takes the same amount of time regardless of the input size. Example: Accessing an element in an array by its index.  O(log n): Logarithmic Time: The runtime increases logarithmically with the input size. Example: Binary search...
Read more

If Statements in C

Image
  Decision Making/Control Statements In C Introduction Sometimes, while writing code, programmer has to take decision like, which statements or block of code to be executed and which statements or block of code to be skipped during execution. Such kind of decisions programmer can take using Decision Making Statements in C. for example if user age is above or equal to 18, user will be eligible for voting. if account balance is below minimum, user cannot withdraw money. user having multiple options and one of option has to be executed. and so on.... So, these kind of conditions decides flow of program. Decision Making Statements in C can be divided into following types 1. if statement 2. switch case statement 3. Conditional/Ternary Operator 4. goto Statement. In this Article we will see if Statements in c if Statement in C if statements are divided into following types 1. Simple if 2. if else statement 3. Nested if else statement 4. if else ladder 1. Simple if Statement : Simple...
Read more