333435363738394041424344454647484950515253

#include <bits/stdc++.h>
using namespace std;

class Solution {
  public:

    // Method to find and print non-repeating characters
    void nonRepeating(string & st, int freq[200]) {
        int i, j;
        
        // Get the length of the string
        int l = st.length();  

        // Count frequency of each character
        for (int i = 0; i < l; i++) {
            if (st[i] == ' ')  // Ignoring spaces in the string
                continue;
            else
                // Incrementing each character's frequency
                freq[st[i] - 'a']++;  
        }

        // Print non-repeating characters
        for (int i = 0; i < l; i++) {
            if (freq[st[i] - 'a'] == 1 && st[i] != ' ') {
                // Output the non-repeating character
                cout << st[i] << " ";  
            }
        }
    }
};

int main() {

    // Input string
    string st = "blockchain technology";  

    // Get the length of the string
    int l = st.length();  

    // Initialize frequency array
    int freq[200] = {0};  

    Solution obj;
    
    // Print message
    cout << "Non-Repeating characters: ";  

    // Call the method to print non-repeating characters
    obj.nonRepeating(st, freq);  

    return 0;
}

12345678910111213141516171819202122232425262728293031323334353637383940414243444546

import java.util.*;

class Solution {

    // Method to find and print non-repeating characters
    static void nonRepeating(String st, int n) {
        
        // Frequency array
        int freq[] = new int[200];  

        // Count frequency of each character
        for (int i = 0; i < n; i++) {
            if (st.charAt(i) == ' ')  // Ignoring spaces in the string
                continue;
            else
                // Incrementing each character's frequency
                freq[st.charAt(i) - 'a']++;  
        }

        // Print non-repeating characters
        for (int i = 0; i < n; ++i) {
            if (freq[st.charAt(i) - 'a'] == 1 && st.charAt(i) != ' ') {
                // Output the non-repeating character
                System.out.print(st.charAt(i) + " ");  
            }
        }
    }
}

public class Main {

    public static void main(String[] args) {
        
        // Input string
        String st = "blockchain technology";  

        // Get length of the string
        int n = st.length();  

        // Print message
        System.out.println("Non-Repeating characters: ");  

        // Call method to print non-repeating characters
        Solution.nonRepeating(st, n);  
    }
}

12345678910111213141516