Skip to content
geeksforgeeks
  • Courses
    • DSA to Development
    • Get IBM Certification
    • Newly Launched!
      • Master Django Framework
      • Become AWS Certified
    • For Working Professionals
      • Interview 101: DSA & System Design
      • Data Science Training Program
      • JAVA Backend Development (Live)
      • DevOps Engineering (LIVE)
      • Data Structures & Algorithms in Python
    • For Students
      • Placement Preparation Course
      • Data Science (Live)
      • Data Structure & Algorithm-Self Paced (C++/JAVA)
      • Master Competitive Programming (Live)
      • Full Stack Development with React & Node JS (Live)
    • Full Stack Development
    • Data Science Program
    • All Courses
  • Tutorials
    • Data Structures & Algorithms
    • ML & Data Science
    • Interview Corner
    • Programming Languages
    • Web Development
    • CS Subjects
    • DevOps And Linux
    • School Learning
  • Practice
    • Build your AI Agent
    • GfG 160
    • Problem of the Day
    • Practice Coding Problems
    • GfG SDE Sheet
  • Contests
    • Accenture Hackathon (Ending Soon!)
    • GfG Weekly [Rated Contest]
    • Job-A-Thon Hiring Challenge
    • All Contests and Events
  • Python Tutorial
  • Interview Questions
  • Python Quiz
  • Python Glossary
  • Python Projects
  • Practice Python
  • Data Science With Python
  • Python Web Dev
  • DSA with Python
  • Python OOPs
Open In App
Next Article:
Python | Find Maximum difference pair
Next article icon

Python | Maximum Difference in String

Last Updated : 23 Apr, 2023
Comments
Improve
Suggest changes
Like Article
Like
Report

Sometimes, we might have a problem in which we require to get the maximum difference of 2 numbers from Strings but with a constraint of having the numbers in successions. This type of problem can occur while competitive programming. Let’s discuss certain ways in which this problem can be solved.

 Method #1 : Using max() + zip() + list comprehension This problem can be solved using the combination of above three function in which max function can be used to get the max value, zip and list comprehension doing the task of extending the logic to the whole list. 

Python3




# Python3 code to demonstrate
# Maximum Difference in String
# using zip() + max() + list comprehension
 
# initializing string
test_string = '6543452345456987653234'
 
# printing original string
print("The original string : " + str(test_string))
 
# using zip() + max() + list comprehension
# Maximum Difference in String
test_string = list(test_string)
res = max(abs(int(a) - int(b)) for a, b in zip(test_string, test_string[1:]))
 
# print result
print("The maximum consecutive difference is : " + str(res))
 
 
Output
The original string : 6543452345456987653234 The maximum consecutive difference is : 3

Time Complexity: O(N), Where N is the length of the given string
Auxiliary Space: O(N)

Method #2 : Using max() + map() + operator.sub The above problem can also be solved using yet another combination of functions. In this combination, map functions performs the task of extending the logic to whole list and sub operator is used to perform the difference. 

Python3




# Python3 code to demonstrate
# Maximum Difference in String
# using max() + map() + operator.sub
from operator import sub
 
# initializing string
test_string = '6543452345456987653234'
 
# printing original string
print("The original string : " + str(test_string))
 
# using max() + map() + operator.sub
# Maximum Difference in String
res = max(map(sub, map(int, test_string), map(int, test_string[1:])))
 
# print result
print("The maximum consecutive difference is : " + str(res))
 
 
Output
The original string : 6543452345456987653234 The maximum consecutive difference is : 3

Time Complexity: O(N), Where N is the length of the given string
Auxiliary Space: O(N)

Method #3 : Using max() + enumerate() + list comprehension
This problem can also be solved using the combination of max function, enumerate function and list comprehension. Enumerate function helps to generate the index of each element in the list and max helps to get the maximum value of the consecutive difference. 
 

Python3




# Python3 code to demonstrate
# Maximum Difference in String
# using max() + enumerate() + list comprehension
  
# initializing string
test_string = '6543452345456987653234'
  
# printing original string
print("The original string : " + str(test_string))
  
# using max() + enumerate() + list comprehension
# Maximum Difference in String
res = max(abs(int(test_string[i]) - int(test_string[i+1]))  for i, j in enumerate(test_string) if i < len(test_string)-1)
  
# print result
print("The maximum consecutive difference is : " + str(res))
#This code is contributed by Edula Vinay Kumar Reddy
 
 
Output
The original string : 6543452345456987653234 The maximum consecutive difference is : 3

Time Complexity: O(N), Where N is the length of the given string
Auxiliary Space: O(N)

Method #4: Using itertools pairwise and max()

We can also use the pairwise() function from the itertools module to generate pairs of adjacent characters in the string. Then we can use max() to find the maximum difference between adjacent pairs.

Here are the steps:

Import the itertools module.
Define the test_string.
Generate pairs of adjacent characters using pairwise() function.
Calculate the absolute difference between the pairs using a list comprehension.
Find the maximum difference using max() function.
Print the result.

Python3




# Python3 code to demonstrate
# Maximum Difference in String
# using itertools pairwise and max()
 
# import the itertools module
import itertools
 
# initializing string
test_string = '6543452345456987653234'
 
# printing original string
print("The original string : " + str(test_string))
 
# using itertools pairwise and max()
# Maximum Difference in String
res = max(abs(int(x[0]) - int(x[1])) for x in itertools.pairwise(test_string))
 
# print result
print("The maximum consecutive difference is : " + str(res))
 
 
OUTPUT :  The original string : 6543452345456987653234 The maximum consecutive difference is : 3

Time complexity: O(n)
Auxiliary space: O(n)



Next Article
Python | Find Maximum difference pair
author
manjeet_04
Improve
Article Tags :
  • Python
  • Python Programs
  • Python string-programs
Practice Tags :
  • python

Similar Reads

  • Python | Find Maximum difference pair
    Sometimes, we need to find the specific problem of getting the pair which yields the maximum difference, this can be solved by sorting and getting the first and last elements of the list. But in some case, we don't with to change the ordering of list and perform some operation in a similar list with
    5 min read
  • Maximum Frequency Character in String - Python
    The task of finding the maximum frequency character in a string involves identifying the character that appears the most number of times. For example, in the string "hello world", the character 'l' appears the most frequently (3 times). Using collection.CounterCounter class from the collections modu
    3 min read
  • Python - Maximum of String Integer list
    Sometimes, while working with data, we can have a problem in which we receive a series of lists with data in string format, which we wish to find the max of each string list integer. Let’s discuss certain ways in which this task can be performed. Method #1 : Using loop + int() This is the brute forc
    4 min read
  • Python - Maximum difference across lists
    Given two lists, the task is to write a Python program to find maximum difference among like index elements.  Examples: Input : test_list1 = [3, 4, 2, 1, 7], test_list2 = [6, 2, 1, 9, 1]Output : 8Explanation : 9 - 1 = 8 is maximum difference across lists in same index. Input : test_list1 = [3, 4, 2,
    4 min read
  • Python - Dual Element row with Maximum difference
    Sometimes, while working with Python Matrix, we can have Matrix with its elements to be rows with just two elements and we may desire to get row with elements having maximum difference. This can have application in many domains. Lets discuss certain ways in which this task can be performed. Method #
    6 min read
  • Python | Minimum Difference in Matrix Columns
    This particular article focuses on a problem that has utility in competitive as well as day-day programming. Sometimes, we need to get the minimum difference between the like indices when compared with the next list. The minimum difference between the like elements in that index is returned. Let’s d
    3 min read
  • Python - Get minimum difference in Tuple pair
    Sometimes, while working with data, we might have a problem in which we need to find minimum difference between available pairs in list. This can be application to many problems in mathematics domain. Let’s discuss certain ways in which this task can be performed.Method #1 : Using min() + list compr
    4 min read
  • Python | Find Maximum difference between tuple pairs
    Sometimes, while working with data, we might have a problem in which we need to find maximum difference between available pairs in list. This can be application to many problems in mathematics domain. Let's discuss certain ways in which this task can be performed.Method #1 : Using max() + list compr
    5 min read
  • Python - Ranged Maximum Element in String List
    Sometimes, while working with Python data, we can have a problem in which we have data in form of String List and we require to find the maximum element in that data, but that also in a certain range of indices. This is quite peculiar problem but can have application in data domains. Let's discuss c
    5 min read
  • Python | Difference in Record Lists
    Sometimes, while working with data, we may have a problem in which we require to find the difference records between two lists that we receive. This is a very common problem and records usually occurs as a tuple. Let’s discuss certain ways in which this problem can be solved. Method #1 : Using list
    5 min read
geeksforgeeks-footer-logo
Corporate & Communications Address:
A-143, 7th Floor, Sovereign Corporate Tower, Sector- 136, Noida, Uttar Pradesh (201305)
Registered Address:
K 061, Tower K, Gulshan Vivante Apartment, Sector 137, Noida, Gautam Buddh Nagar, Uttar Pradesh, 201305
GFG App on Play Store GFG App on App Store
Advertise with us
  • Company
  • About Us
  • Legal
  • Privacy Policy
  • In Media
  • Contact Us
  • Advertise with us
  • GFG Corporate Solution
  • Placement Training Program
  • Languages
  • Python
  • Java
  • C++
  • PHP
  • GoLang
  • SQL
  • R Language
  • Android Tutorial
  • Tutorials Archive
  • DSA
  • Data Structures
  • Algorithms
  • DSA for Beginners
  • Basic DSA Problems
  • DSA Roadmap
  • Top 100 DSA Interview Problems
  • DSA Roadmap by Sandeep Jain
  • All Cheat Sheets
  • Data Science & ML
  • Data Science With Python
  • Data Science For Beginner
  • Machine Learning
  • ML Maths
  • Data Visualisation
  • Pandas
  • NumPy
  • NLP
  • Deep Learning
  • Web Technologies
  • HTML
  • CSS
  • JavaScript
  • TypeScript
  • ReactJS
  • NextJS
  • Bootstrap
  • Web Design
  • Python Tutorial
  • Python Programming Examples
  • Python Projects
  • Python Tkinter
  • Python Web Scraping
  • OpenCV Tutorial
  • Python Interview Question
  • Django
  • Computer Science
  • Operating Systems
  • Computer Network
  • Database Management System
  • Software Engineering
  • Digital Logic Design
  • Engineering Maths
  • Software Development
  • Software Testing
  • DevOps
  • Git
  • Linux
  • AWS
  • Docker
  • Kubernetes
  • Azure
  • GCP
  • DevOps Roadmap
  • System Design
  • High Level Design
  • Low Level Design
  • UML Diagrams
  • Interview Guide
  • Design Patterns
  • OOAD
  • System Design Bootcamp
  • Interview Questions
  • Inteview Preparation
  • Competitive Programming
  • Top DS or Algo for CP
  • Company-Wise Recruitment Process
  • Company-Wise Preparation
  • Aptitude Preparation
  • Puzzles
  • School Subjects
  • Mathematics
  • Physics
  • Chemistry
  • Biology
  • Social Science
  • English Grammar
  • Commerce
  • World GK
  • GeeksforGeeks Videos
  • DSA
  • Python
  • Java
  • C++
  • Web Development
  • Data Science
  • CS Subjects
@GeeksforGeeks, Sanchhaya Education Private Limited, All rights reserved
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox
Improvement
Suggest Changes
Help us improve. Share your suggestions to enhance the article. Contribute your expertise and make a difference in the GeeksforGeeks portal.
geeksforgeeks-suggest-icon
Create Improvement
Enhance the article with your expertise. Contribute to the GeeksforGeeks community and help create better learning resources for all.
geeksforgeeks-improvement-icon
Suggest Changes
min 4 words, max Words Limit:1000

Thank You!

Your suggestions are valuable to us.

What kind of Experience do you want to share?

Interview Experiences
Admission Experiences
Career Journeys
Work Experiences
Campus Experiences
Competitive Exam Experiences