Skip to content
Programmingoneonone
Programmingoneonone
  • Engineering Subjects
    • Internet of Things (IoT)
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
    • 100+ C++ Programs
  • Solutions
    • HackerRank
      • Algorithms Solutions
      • C solutions
      • C++ solutions
      • Java solutions
      • Python solutions
    • Leetcode Solutions
    • HackerEarth Solutions
  • Work with US
Programmingoneonone
Programmingoneonone

Leetcode Find the Difference problem solution

YASH PAL, 31 July 202422 January 2026

In this Leetcode Find the Difference problem solution, You are given two strings s and t. String t is generated by random shuffling string s and then add one more letter at a random position. Return the letter that was added to t.

leetcode find the difference problem solution

Leetcode Find the Difference problem solution in Python.

ans = 0
for c in t:
    ans =ans+ ord(c)

for c in s:
    ans =ans- ord(c)           
return chr(ans)

Find the Difference problem solution in Java.

public char findTheDifference(String s, String t) {
        int sumS = 0, sumT = 0;
        char ch;

        for (int i = 0; i <s.length(); i++) {
            sumS += Integer.valueOf(s.charAt(i));
        }

        for (int j = 0; j < t.length(); j++) {
            sumT += Integer.valueOf(t.charAt(j));
        }


        ch = (char) (sumT - sumS);
        return ch;
    }

Problem solution in C++.

char findTheDifference(string s, string t) {
        int a[26];
        memset(a,0,sizeof(a));
        int i;
        for(i=0;i<t.length();i++){
            a[t[i]-'a']++;
        }
        for(i=0;i<s.length();i++){
            a[s[i]-'a']--;
        }
        for(i=0;i<26;i++){
            if(a[i]>0)
                return char(i+'a');
        }
        return 'a';
    }

Problem solution in C.

char findTheDifference(char * s, char * t){
    
    int i;
    int len_s = strlen(s) - 1;
    int len_t = strlen(t) - 1;
    int alpha_s[26] = {0};
    int alpha_t[26] = {0};    
    
    for(i = 0; i <= len_t; i++){
        
        alpha_t[t[i] - 97]++;
    }
    
    for(i = 0; i <= len_s; i++){
        
        alpha_s[s[i] - 97]++;
    }
    
    for(i = 0; i < 26; i++){
        
        if(alpha_s[i] != alpha_t[i]){
            
            return 'a' + i;            
        }
    }

    return NULL;
 
}

coding problems solutions Leetcode Problems Solutions Leetcode

Post navigation

Previous post
Next post

Leave a Reply

Your email address will not be published. Required fields are marked *

Programmingoneonone

We at Programmingoneonone, also known as Programming101 is a learning hub of programming and other related stuff. We provide free learning tutorials/articles related to programming and other technical stuff to people who are eager to learn about it.

Pages

  • About US
  • Contact US
  • Privacy Policy

Practice

  • Java
  • C++
  • C

Follow US

  • YouTube
  • LinkedIn
  • Facebook
  • Pinterest
  • Instagram
©2026 Programmingoneonone | WordPress Theme by SuperbThemes