Given a string, return the first NON-repeating character that occurs in the string.
EX: "adzbdcab" returns 'z'.

Question

Given a string, return the first NON-repeating character that occurs in the string. 
EX: "adzbdcab" returns 'z'.

Terrible Answers Above · Accepted Answer

Okay, idk WTF wrong with y'all. This "lastIndexOf" has a runtime of O(m*n) based on the KMP algorithm. You CANNOT use it! You're essentially having an O(n^2) solution!

Here's a solution WITH hashing (faster than a hash table too!)

def non_repeating(string):
	if(string is None):
		return None
	
	hash_table = [0] * 256
	
	for char in string:
		hash_table[ord(char)] += 1
	
	for char in string:
		if(hash_table[ord(char)] == 1):
			return char
	
	return None

. · Answer

String s = "adzbdcab";
		char[] chars = s.toCharArray();
		for(char c: chars){
			if(s.indexOf(c)==s.lastIndexOf(c)){
				System.out.println(" character is "+ c );
				break;
			}
		}

JS solution · Answer

function nonRepeater (input) {
var charCount = {};
for (var i=0; i

. · Answer

faster one..

                int length = s.length();
		char c;
		for(int i=0; i

my try · Answer

How about this:
###################
raw_string = "adzbdcab"
result = []
dup = []
for i in range(len(raw_string)):
    if raw_string[i] in result:
        result.remove(raw_string[i])
        dup.append(raw_string[i])
    else:
        if raw_string[i] not in dup:
            result.append(raw_string[i])

print(result[0])

Sigiloso · Answer

import java.util.*;
public class MyClass {
    public static void main(String args[]) {
      String s="abdzdbca";
      LinkedHashMap h= new LinkedHashMap();
      for(char a: s.toCharArray()){
          h.put(a, h.get(a)==null? 1 : h.get(a).intValue()+1 );
          if(h.get(a)==2){
              h.remove(a);
          }
          
      }

      System.out.println("h=" + new ArrayList(h.keySet()).get(0));
    }
}

Sigiloso · Answer

def string(string)
    arr = string.split('')
    arr.count.times do
      str = arr.shift
      return str unless arr.include? str
    end
  end

Sigiloso · Answer

Using a O(n) solution, not a nested for loops solution that's O(n^2).

Capital One

Pergunta de entrevista da empresa Capital One

Respostas da entrevista

Empresas seguidas

Buscas de vagas