Skip to content
    geeksforgeeks
    • Interview Prep
      • DSA
      • Interview Corner
      • Aptitude & Reasoning
      • Practice Coding Problems
      • All Courses
    • Tutorials
      • Python
      • Java
      • ML & Data Science
      • Programming Languages
      • Web Development
      • CS Subjects
      • DevOps
      • Software and Tools
      • School Learning
    • Tracks
      • Languages
        • Python
        • C
        • C++
        • Java
        • Advanced Java
        • SQL
        • JavaScript
        • C#
      • Interview Preparation
        • GfG 160
        • GfG 360
        • System Design
        • Core Subjects
        • Interview Questions
        • Interview Puzzles
        • Aptitude and Reasoning
        • Product Management
        • Computer Organisation and Architecture
      • Data Science
        • Python
        • Data Analytics
        • Complete Data Science
        • Gen AI
        • Agentic AI
      • Dev Skills
        • Full-Stack Web Dev
        • DevOps
        • Software Testing
        • CyberSecurity
        • NextJS
        • Git
      • Tools
        • Computer Fundamentals
        • AI Tools
        • MS Excel & Google Sheets
        • MS Word & Google Docs
      • Maths
        • Maths For Computer Science
        • Engineering Mathematics
        • School Maths
    • Python Tutorial
    • Data Types
    • Interview Questions
    • Examples
    • Quizzes
    • DSA Python
    • Data Science
    • NumPy
    • Pandas
    • Practice
    • Django
    • Flask
    • Projects
    Open In App

    Python | Remove Kth character from strings list

    Last Updated : 12 Apr, 2023
    Comments
    Improve
    Suggest changes
    1 Likes
    Like
    Report
    See More

    Sometimes, while working with data, we can have a problem in which we need to remove a particular column, i.e the Kth character from string list. String are immutable, hence removal just means re creating a string without the Kth character. Let's discuss certain ways in which this task can be performed. 

    Method #1: Using list comprehension + list slicing This is the shorthand that can be used to perform this task. In this we just recreate the required string using slicing and extend logic to each string element in list using list comprehension. 

    Python3
    # Python3 code to demonstrate working of
    # Remove Kth character from strings list
    # using list comprehension + list slicing
    
    # initialize list 
    test_list = ['akash', 'nikhil', 'manjeet', 'akshat']
    
    # printing original list 
    print("The original list : " + str(test_list))
    
    # initialize K 
    K = 3
    
    # Remove Kth character from strings list
    # using list comprehension + list slicing
    res = [ele[:K] + ele[K + 1:] for ele in test_list]
    
    # printing result
    print("List after removal of Kth character of each string : " + str(res))
    
    Output : 
    The original list : ['akash', 'nikhil', 'manjeet', 'akshat']
    List after removal of Kth character of each string : ['akah', 'nikil', 'maneet', 'aksat']

    Time Complexity: O(n), where n is the length of the input list. 
    Auxiliary Space: O(n), as the new list 'res' has the same length as the input list.

    Method #2: Using map() + slicing This method is similar to above one, only difference is that the extension of logic part to each element of list is done with the help of map(). 

    Python3
    # Python3 code to demonstrate working of
    # Remove Kth character from strings list
    # using list comprehension + list slicing
    
    # initialize list 
    test_list = ['akash', 'nikhil', 'manjeet', 'akshat']
    
    # printing original list 
    print("The original list : " + str(test_list))
    
    # initialize K 
    K = 3
    
    # Remove Kth character from strings list
    # using list comprehension + list slicing
    res = list(map(lambda ele: ele[ :K] + ele[K + 1 : ], test_list))
    
    # printing result
    print("List after removal of Kth character of each string : " + str(res))
    
    Output : 
    The original list : ['akash', 'nikhil', 'manjeet', 'akshat']
    List after removal of Kth character of each string : ['akah', 'nikil', 'maneet', 'aksat']

    Time complexity: O(n*k), where n is the length of the input list and k is the length of the string at index K.

    Auxiliary space: O(n), where n is the length of the input list.

    Method#3: Using a For Loop and String Slicing

    1. Initialize an empty list "res".
    2. Loop through each string in the input list "test_list".
    3. For each string, remove the Kth character using string slicing.
    4. Append the modified string to the "res" list.
    5. Return the modified list.
    Python3
    # Python3 code to demonstrate working of
    # Remove Kth character from strings list
    # using a for loop and string slicing
    
    # initialize list 
    test_list = ['akash', 'nikhil', 'manjeet', 'akshat']
    
    # printing original list 
    print("The original list : " + str(test_list))
    
    # initialize K 
    K = 3
    
    # Remove Kth character from strings list
    # using a for loop and string slicing
    res = []
    for string in test_list:
        new_string = string[:K] + string[K+1:]
        res.append(new_string)
    
    # printing result
    print("List after removal of Kth character of each string : " + str(res))
    

    Output
    The original list : ['akash', 'nikhil', 'manjeet', 'akshat']
    List after removal of Kth character of each string : ['akah', 'nikil', 'maneet', 'aksat']

    Time complexity:
    The time complexity of this approach is O(n*k), where n is the number of strings in the input list and k is the length of each string. The time complexity of string slicing is O(k), and this operation is performed n times in the loop.

    Auxiliary space complexity:
    The auxiliary space complexity of this approach is O(n*k), as we are creating a new list to store the modified strings. However, since we are only storing the modified strings and not the entire input list, the space complexity is still linear with respect to the size of the input.

    Method#4: Using Recursive method.

    Algorithm:

    1. Define a function named "remove_kth_character" that takes two arguments, test_list and K.
    2. Check if the list is empty, return an empty list.
    3. If the list is not empty, take the first string from the list.
    4. Create a new string by concatenating the characters from the start of the original string up to the Kth character and from the K+1th character to the end of the string.
    5. Add the new string to a new list.
    6. Recursively call the "remove_kth_character" function with the remaining strings in the list and the same value of K.
    7. Concatenate the new list generated by the function calls and return the final list.
    Python3
    def remove_kth_character(test_list, K):
        if not test_list:
            return []
        else:
            string = test_list[0]
            new_string = string[:K] + string[K+1:]
            return [new_string] + remove_kth_character(test_list[1:], K)
    # initialize list 
    test_list = ['akash', 'nikhil', 'manjeet', 'akshat']
    
    # printing original list 
    print("The original list : " + str(test_list))
    
    # initialize K 
    K = 3
    res = remove_kth_character(test_list, K)
    # printing result
    
    print("List after removal of Kth character of each string : " + str(res))
    

    Output
    The original list : ['akash', 'nikhil', 'manjeet', 'akshat']
    List after removal of Kth character of each string : ['akah', 'nikil', 'maneet', 'aksat']

    Time complexity: O(n * m), where n is the length of the input list and m is the length of the longest string in the list. This is because the function needs to iterate through each string in the list and then create a new string by concatenating two parts of each string. The time complexity of string concatenation in Python is O(m).
    Auxiliary space: O(n * m), as it creates a new list to store the modified strings.

    Method #5: Using for loops

    Approach

    1. Initiate a nested for loop and create a new string every time without adding K index character
    2. Append new string to output list
    3. Display output list
    Python3
    # Python3 code to demonstrate working of
    
    # Remove Kth character from strings list
    
    # initialize list
    test_list = ['akash', 'nikhil', 'manjeet', 'akshat']
    # printing original list
    print("The original list : " + str(test_list))
    # initialize K
    K = 3
    # Remove Kth character from strings list
    
    res=[]
    for i in test_list:
        s=""
        for j in range(0,len(i)):
            if(j!=K):
                s+=i[j]
        res.append(s)
    
    # printing result
    print("List after removal of Kth character of each string : " + str(res))
    

    Output
    The original list : ['akash', 'nikhil', 'manjeet', 'akshat']
    List after removal of Kth character of each string : ['akah', 'nikil', 'maneet', 'aksat']

    Time Complexity: O(n*m) n - length of strings list m - length of each string
    Auxiliary space: O(n) n - length of strings list

    Method 6: Using join() + list comprehension

    • Initialize list 
    • Printing original list 
    • Initialize K 
    • Remove Kth character from strings list using join() and list comprehension
    • Printing result
    Python3
    # Python3 code to demonstrate working of
    # Remove Kth character from strings list
    # using join() and list comprehension
    
    # initialize list 
    test_list = ['akash', 'nikhil', 'manjeet', 'akshat']
    
    # printing original list 
    print("The original list : " + str(test_list))
    
    # initialize K 
    K = 3
    
    # Remove Kth character from strings list
    # using join() and list comprehension
    res = [''.join([s[i] for i in range(len(s)) if i != K-1]) for s in test_list]
    
    # printing result
    print("List after removal of Kth character of each string : " + str(res))
    

    Output
    The original list : ['akash', 'nikhil', 'manjeet', 'akshat']
    List after removal of Kth character of each string : ['aksh', 'nihil', 'majeet', 'akhat']

    Time complexity: O(n*m), where n is the number of strings in the list and m is the length of the longest string.
    Auxiliary space: O(n*m), where n is the number of strings in the list and m is the length of the longest string, because we are creating a new list of modified strings with the same length as the original list.

    Create Quiz

    M

    manjeet_04
    Improve

    M

    manjeet_04
    Improve
    Article Tags :
    • Python
    • Python Programs
    • Python list-programs

    Explore

      Python Fundamentals

      Python Introduction

      2 min read

      Input and Output in Python

      4 min read

      Python Variables

      4 min read

      Python Operators

      4 min read

      Python Keywords

      2 min read

      Python Data Types

      8 min read

      Conditional Statements in Python

      3 min read

      Loops in Python - For, While and Nested Loops

      5 min read

      Python Functions

      5 min read

      Recursion in Python

      4 min read

      Python Lambda Functions

      5 min read

      Python Data Structures

      Python String

      5 min read

      Python Lists

      4 min read

      Python Tuples

      4 min read

      Python Dictionary

      3 min read

      Python Sets

      6 min read

      Python Arrays

      7 min read

      List Comprehension in Python

      4 min read

      Advanced Python

      Python OOP Concepts

      11 min read

      Python Exception Handling

      5 min read

      File Handling in Python

      4 min read

      Python Database Tutorial

      4 min read

      Python MongoDB Tutorial

      3 min read

      Python MySQL

      9 min read

      Python Packages

      10 min read

      Python Modules

      3 min read

      Python DSA Libraries

      15 min read

      List of Python GUI Library and Packages

      3 min read

      Data Science with Python

      NumPy Tutorial - Python Library

      3 min read

      Pandas Tutorial

      4 min read

      Matplotlib Tutorial

      5 min read

      Python Seaborn Tutorial

      3 min read

      StatsModel Library - Tutorial

      3 min read

      Learning Model Building in Scikit-learn

      6 min read

      TensorFlow Tutorial

      2 min read

      PyTorch Tutorial

      6 min read

      Web Development with Python

      Flask Tutorial

      8 min read

      Django Tutorial | Learn Django Framework

      7 min read

      Django ORM - Inserting, Updating & Deleting Data

      4 min read

      Templating With Jinja2 in Flask

      6 min read

      Django Templates

      5 min read

      Build a REST API using Flask - Python

      3 min read

      Building a Simple API with Django REST Framework

      3 min read

      Python Practice

      Python Quiz

      1 min read

      Python Coding Practice

      1 min read

      Python Interview Questions and Answers

      15+ min read
    top_of_element && top_of_screen < bottom_of_element) || (bottom_of_screen > articleRecommendedTop && top_of_screen < articleRecommendedBottom) || (top_of_screen > articleRecommendedBottom)) { if (!isfollowingApiCall) { isfollowingApiCall = true; setTimeout(function(){ if (loginData && loginData.isLoggedIn) { if (loginData.userName !== $('#followAuthor').val()) { is_following(); } else { $('.profileCard-profile-picture').css('background-color', '#E7E7E7'); } } else { $('.follow-btn').removeClass('hideIt'); } }, 3000); } } }); } $(".accordion-header").click(function() { var arrowIcon = $(this).find('.bottom-arrow-icon'); arrowIcon.toggleClass('rotate180'); }); }); window.isReportArticle = false; function report_article(){ if (!loginData || !loginData.isLoggedIn) { const loginModalButton = $('.login-modal-btn') if (loginModalButton.length) { loginModalButton.click(); } return; } if(!window.isReportArticle){ //to add loader $('.report-loader').addClass('spinner'); jQuery('#report_modal_content').load(gfgSiteUrl+'wp-content/themes/iconic-one/report-modal.php', { PRACTICE_API_URL: practiceAPIURL, PRACTICE_URL:practiceURL },function(responseTxt, statusTxt, xhr){ if(statusTxt == "error"){ alert("Error: " + xhr.status + ": " + xhr.statusText); } }); }else{ window.scrollTo({ top: 0, behavior: 'smooth' }); $("#report_modal_content").show(); } } function closeShareModal() { const shareOption = document.querySelector('[data-gfg-action="share-article"]'); shareOption.classList.remove("hover_share_menu"); let shareModal = document.querySelector(".hover__share-modal-container"); shareModal && shareModal.remove(); } function openShareModal() { closeShareModal(); // Remove existing modal if any let shareModal = document.querySelector(".three_dot_dropdown_share"); shareModal.appendChild(Object.assign(document.createElement("div"), { className: "hover__share-modal-container" })); document.querySelector(".hover__share-modal-container").append( Object.assign(document.createElement('div'), { className: "share__modal" }), ); document.querySelector(".share__modal").append(Object.assign(document.createElement('h1'), { className: "share__modal-heading" }, { textContent: "Share to" })); const socialOptions = ["LinkedIn", "WhatsApp","Twitter", "Copy Link"]; socialOptions.forEach((socialOption) => { const socialContainer = Object.assign(document.createElement('div'), { className: "social__container" }); const icon = Object.assign(document.createElement("div"), { className: `share__icon share__${socialOption.split(" ").join("")}-icon` }); const socialText = Object.assign(document.createElement("span"), { className: "share__option-text" }, { textContent: `${socialOption}` }); const shareLink = (socialOption === "Copy Link") ? Object.assign(document.createElement('div'), { role: "button", className: "link-container CopyLink" }) : Object.assign(document.createElement('a'), { className: "link-container" }); if (socialOption === "LinkedIn") { shareLink.setAttribute('href', `https://www.linkedin.com/sharing/share-offsite/?url=${window.location.href}`); shareLink.setAttribute('target', '_blank'); } if (socialOption === "WhatsApp") { shareLink.setAttribute('href', `https://api.whatsapp.com/send?text=${window.location.href}`); shareLink.setAttribute('target', "_blank"); } if (socialOption === "Twitter") { shareLink.setAttribute('href', `https://twitter.com/intent/tweet?url=${window.location.href}`); shareLink.setAttribute('target', "_blank"); } shareLink.append(icon, socialText); socialContainer.append(shareLink); document.querySelector(".share__modal").appendChild(socialContainer); //adding copy url functionality if(socialOption === "Copy Link") { shareLink.addEventListener("click", function() { var tempInput = document.createElement("input"); tempInput.value = window.location.href; document.body.appendChild(tempInput); tempInput.select(); tempInput.setSelectionRange(0, 99999); // For mobile devices document.execCommand('copy'); document.body.removeChild(tempInput); this.querySelector(".share__option-text").textContent = "Copied" }) } }); // document.querySelector(".hover__share-modal-container").addEventListener("mouseover", () => document.querySelector('[data-gfg-action="share-article"]').classList.add("hover_share_menu")); } function toggleLikeElementVisibility(selector, show) { document.querySelector(`.${selector}`).style.display = show ? "block" : "none"; } function closeKebabMenu(){ document.getElementById("myDropdown").classList.toggle("show"); }
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
  • Company
  • About Us
  • Legal
  • Privacy Policy
  • Contact Us
  • Advertise with us
  • GFG Corporate Solution
  • Campus Training Program
  • Explore
  • POTD
  • Job-A-Thon
  • Blogs
  • Nation Skill Up
  • Tutorials
  • Programming Languages
  • DSA
  • Web Technology
  • AI, ML & Data Science
  • DevOps
  • CS Core Subjects
  • Interview Preparation
  • Software and Tools
  • Courses
  • ML and Data Science
  • DSA and Placements
  • Web Development
  • Programming Languages
  • DevOps & Cloud
  • GATE
  • Trending Technologies
  • Videos
  • DSA
  • Python
  • Java
  • C++
  • Web Development
  • Data Science
  • CS Subjects
  • Preparation Corner
  • Interview Corner
  • Aptitude
  • Puzzles
  • GfG 160
  • System Design
@GeeksforGeeks, Sanchhaya Education Private Limited, All rights reserved
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