# 389 Find the Difference

Given two strings s and t which consist of only lowercase letters.

String t is generated by random shuffling string s and then add one more letter at a random position.

Find the letter that was added in t.

Example:

```
Input:
s = "abcd"
t = "abcde"

Output:
e
```

Explanation: 'e' is the letter that was added.

**The Idea:** Sort the strings and return the first non matching character. Otherwise return the last character of t.

**Complexity:** O(2nlog(n) + n) time and O(2n) space

```python
def findTheDifference(self, s, t):
    """
    :type s: str
    :type t: str
    :rtype: str
    """

    s_list = sorted(s)
    t_list = sorted(t)

    for s_char, t_char in zip(s_list, t_list):
        if s_char is not t_char:
            return t_char

    return t_list[-1]
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/389-find-the-difference.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.