Data Structure & Algorithms
  • 🖌️Unlocking the Power of Algorithms with C#
  • Data Structure
    • Data Structure
    • Big O
    • Array
    • Linked Lists
    • Stacks
    • Queues
    • Hash Tables
    • Trees
    • Graphs
    • Heap Sort
    • ParkingLot Algorithm
    • LRU cache
    • Priority Queue
  • Algorithms
    • Algorithm
    • Recursion
    • Sorting
    • Searching
    • Dynamic Programming
  • Problems
    • Array
      • Two Sum
      • Two Sum II - Input Array Is Sorted
      • Contains Duplicate
      • Maximum Subarray
      • House Robber
      • Move Zeroes
      • Rotate Array
      • Plus One
      • Find number of subarrays with even length
      • Find number of subarrays with even sum
      • Find Missing Element
      • Reduce Array Size to The Half
      • Remove Duplicates
      • Merge Sorted Arrays
      • Arrays Intersection
      • 3Sum
      • Trapping Rain Water
      • Maximum sum of a subarray
      • Longest Subarray
      • Subarray Sum Equals K
      • Container With Most Water
      • Missing Number
      • Roman to Integer
      • First Missing Positive
      • Unique Integers That Sum Up To 0
      • Integer to Roman
      • Flatten
    • String
      • Check if two strings are permutation of each other
      • String Compression
      • Palindrome Permutation
      • Determine if a string has all Unique Characters
      • One Away
      • Longest Substring Without Repeating Characters
      • Valid Palindrome
      • Valid Palindrome II
      • Backspace String Compare
      • First Unique Character in a String
      • Is Subsequence
      • URLify a given string
      • String has same characters at same position
      • Number of Ways to Split a String
      • Check whether two Strings are anagram of each other
      • Print last `n` lines of a big file or big string.
      • Multiply Strings
    • Matrix
      • Search a 2D Matrix
      • Search a 2D Matrix II
      • Rotate Matrix
      • Spiral Matrix
      • Set Matrix Zeroes
    • Bit Manipulation
      • Sum of Two Integers
      • Reverse Number
      • Reverse Number II
      • Binary Bits Count
      • Binary Bits Count II
    • Stack
      • Valid Parentheses
      • Balance or not expression
      • Decode String
    • Tree
      • Binary Tree Inorder Traversal
      • Binary Tree Preorder Traversal
      • Binary Tree Postorder Traversal
      • Binary Tree Level Order Traversal
      • Binary Tree Return All Root-To-Leaf Paths
      • Binary Tree Height-Balanced
      • Valid Binary Search Tree
      • Binary Tree Sum of all left leaves.
    • Linked List
      • Linked List Delete Middle Node
      • Merge Sorted Linked List
      • Reverse Linked List
      • Remove Duplicates from Sorted List
      • Remove Duplicates from Unsorted List
      • Linked List Cycle
    • Graph
      • The Number Of Islands
      • Number of Closed Islands
      • Max Area of Island
      • Rotting Oranges
      • Number of Provinces
      • Course Schedule
      • Surrounded Regions
      • Snakes and Ladders
      • Widest Path Without Trees
      • Knight Probability in Chessboard
      • Possible moves of knight
      • Check Knight Tour Configuration
      • Steps by Knight
      • Network Delay Time
    • Greedy
      • Best Time to Buy and Sell Stock
      • Best Time to Buy and Sell Stock II
      • Smallest Subset Array
      • Jump Game
    • Backtracking
      • Towers of Hanoi
      • Subsets
      • Combination Sum
      • Sudoku Solver
      • Word Search
    • Heap
      • Kth Largest Element in an Array
      • Top K Frequent Elements
    • Sorting
      • Order Colors String
    • Recursion
      • Number To Text
      • Divide Number
Powered by GitBook
On this page
  • URLify a given string
  • Solutions
  1. Problems
  2. String

URLify a given string

URLify a given string

Write a method to replace all the spaces in a string with ‘%20’. You may assume that the string has sufficient space at the end to hold the additional characters and that you are given the “true” length of the string.

Solutions

A common approach in string manipulation problems is to edit the string starting from the end and working backwards. This is useful because we have an extra buffer at the end, which allows us to change characters without worrying about what we're overwriting.

Approach 1 – Using string replace method


Steps

  1. First check if string is null. if string is null, then return string.

  2. Trim string from both sides.

  3. Use string replace method to replace empty space with %20.

    public string URLify(string str)
    {
        if (str is null)
            return str;
        str= str.Trim();

        return str.Replace(" ", "%20");

    }

Time Complexity: O(n)

Auxiliary Space: O(1)

Approach 2 – Using two-scan approach.


Steps

  1. First check if string is null. if string is null, then return string.

  2. Trim string from both sides.

  3. Now, count total number of spaces.

  4. create new array of characters with new length (length +spaces*2). Here, takes length after trim.

  5. Run loop for each characters of string and add it into new array.

    public string URLify(string str)
    {
        if (str is null)
            return str;

        int startIndex = 0;
        int endIndex = str.Length - 1;
        while (str[startIndex] == ' ')
        {
            startIndex++;
        }

        while (str[endIndex] == ' ')
        {
            endIndex--;
        }

        var spaceCount = 0;
        int i = startIndex;
        while (i <= endIndex)
        {
            if (str[i] == ' ')
            {
                spaceCount++;
            }
            i++;
        }

        if (spaceCount == 0)
        {
            return str;
        }

        int length = (endIndex - startIndex) + spaceCount * 2 + 1;
        var output = new char[length];
        int index = length - 1;
        for (i = endIndex; i >= startIndex; i--)
        {
            if (str[i] == ' ')
            {
                output[index] = '0';
                output[index - 1] = '2';
                output[index - 2] = '%';
                index -= 3;
            }
            else
            {
                output[index--] = str[i];

            }
        }
        return new string(output);
    }

Time Complexity: O(n)

Auxiliary Space: O(1)

PreviousIs SubsequenceNextString has same characters at same position

Last updated 1 year ago