input = "aA11"
input = input.lower()
list = [0] * 36
for i in input:
    if i.isdigit():
        list[int(i)+26]+=1
    else:
        list[ord(i)-97]+=1
i=0
counter = 0
while i < len(input):
    if input[i].isdigit():
        counter += list[int(input[i])+26]-1
        i += list[int(input[i])+26]
    else:
        counter += list[ord(input[i])-97]-1
        i += list[ord(input[i])-97]
print counter

SilverG33k:
^^^ With the above code, you can easily use as follow
.
.
.
int countWord = counter("java";
// answer will give you 1

Javanian:
Python

input = "aA11"
input = input.lower()
list = [0] * 36
for i in input:
    if i.isdigit():
        list[int(i)+26]+=1
    else:
        list[ord(i)-97]+=1
i=0
counter = 0
while i < len(input):
    if input[i].isdigit():
        counter += list[int(input[i])+26]-1
        i += list[int(input[i])+26]
    else:
        counter += list[ord(input[i])-97]-1
        i += list[ord(input[i])-97]
print counter

https://ideone.com/UstREc

>>> >>> >>> ... ... ... ... ...   File "<stdin>", line 6
    i=0
    ^
SyntaxError: invalid syntax
>>> >>> ... ... ... ... ... ... ...   File "<stdin>", line 8
    print counter
        ^
SyntaxError: Missing parentheses in call to 'print'
>>> 

SilverG33k:

//pardon me if the code is wrong but trust me, the logic is correct

bash!
## yay bash is a juke box!
number_caught=0  # yap ..jukebox ..global variable
give_me_num () {
  word= $1
  lera= $2
  number_caught= $(echo $word | awk '{print tolower($0)}' | grep -o "lera" | wc -l)
   # ok pls remember number_caught is global plss plss plss
}

give_me_num "yup life in programming is " "r"
echo $caught_num

antieverything:

bash!
## yay bash is a juke box!
number_caught=0  # yap ..jukebox ..global variable
give_me_num () {
  word= $1
  lera= $2
  number_caught= $(echo $word | awk '{print tolower($0)}' | grep -o "lera" | wc -l)
   # ok pls remember number_caught is global plss plss plss
}

give_me_num "yup life in programming is " "r"
echo $caught_num

edicied:

wHEN I TESTED YOUR CODE IT GAVE ME THIS....

>>> >>> >>> ... ... ... ... ...   File "<stdin>", line 6
    i=0
    ^
SyntaxError: invalid syntax
>>> >>> ... ... ... ... ... ... ...   File "<stdin>", line 8
    print counter
        ^
SyntaxError: Missing parentheses in call to 'print'
>>> 

edicied:

You know its not actuall to find the length of the word but to find duplicate letters in the word

Javanian:


What interpreter are you using? Hope you are not screwing up the indentation? It runs on ideone, the link I pasted. Tested on 3 different interpreters online and couldn't replicate this error.

SilverG33k:

Finding the lenght is easier as word.lenght() but my code actually finds if the letters appear twice
e.g
counter("java"; // will return 1
according to what you asked, a as the only letter appears twice

edicied:

No, i didn't screw up the indentation and yes i also run it on ideone the link you posted and xame error

Javanian:


What exactly are you talking about?

edicied:
It suppose to return 2

SilverG33k:

Why are you confusing everything, you said it yourself
"aabbcde" -> 2
"aabBcde" -> 2
"aA11" -> 2
Then how the Bleep is "Java" supposed to return 2 ??

Javanian:
Python

input = "aA11"
input = input.lower()
list = [0] * 36
for i in input:
    if i.isdigit():
        list[int(i)+26]+=1
    else:
        list[ord(i)-97]+=1
i=0
counter = 0
while i < len(input):
    if input[i].isdigit():
        counter += list[int(input[i])+26]-1
        i += list[int(input[i])+26]
    else:
        counter += list[ord(input[i])-97]-1
        i += list[ord(input[i])-97]
print counter

https://ideone.com/UstREc

SilverG33k:

Why are you confusing everything, you said it yourself
"aabbcde" -> 2
"aabBcde" -> 2
"aA11" -> 2
Then how the Bleep is "Java" supposed to return 2 ??

pcguru1:


This works accurately,

edicied:

I ment something like a = 2 and not the return statement

edicied:

Yeah it does

pcguru1:


Number of occurrence a appears twice in J(a)v(a) this is a codewars question. You read the question properly before answering online interviews are strict like that

edicied:
Count the number of Duplicates

In any Programing Language, Write a function that will return the count of distinct case-insensitive alphabetic characters and numeric digits that occur more than once in the input string. The input string can be assumed to contain only alphabets (both uppercase and lowercase) and numeric digits.

Example

"abcde" -> 0 # no characters repeats more than once
"aabbcde" -> 2 # 'a' and 'b'
"aabBcde" -> 2 # 'a' occurs twice and 'b' twice (bandB)
"aA11" -> 2 # 'a' and '1'

java

a

java

aabbbccccddddd

let input = "aA11";
let [o, n, c] = [{}, {}, 0];
input = input.toLowerCase();
for (let i = 0, ch; i < input.length; i += 1) {
    ch = input[i];
    if (o[ch] && !n[ch]) {
        c += 1;
        n[ch] = 1;
    } else o[ch] = 1;
}

console.log(c); // => count

edicied:

Is this for linux Terminal??

edicied:
Count the number of Duplicates

In any Programing Language, Write a function that will return the count of distinct case-insensitive alphabetic characters and numeric digits that occur more than once in the input string. The input string can be assumed to contain only alphabets (both uppercase and lowercase) and numeric digits.

Example

"abcde" -> 0 # no characters repeats more than once
"aabbcde" -> 2 # 'a' and 'b'
"aabBcde" -> 2 # 'a' occurs twice and 'b' twice (bandB)
"aA11" -> 2 # 'a' and '1'

edicied:
Count the number of Duplicates

In any Programing Language, Write a function that will return the count of distinct case-insensitive alphabetic characters and numeric digits that occur more than once in the input string. The input string can be assumed to contain only alphabets (both uppercase and lowercase) and numeric digits.

Example

"abcde" -> 0 # no characters repeats more than once
"aabbcde" -> 2 # 'a' and 'b'
"aabBcde" -> 2 # 'a' occurs twice and 'b' twice (bandB)
"aA11" -> 2 # 'a' and '1'

public class Result {
     private int numDist;
     private List<String> charsRepeated = new ArrayList<String>();

    //Getters and setters skipped, but assume they have been defined.
}

public class Naira {
     public static int numDistinctChars(String alphaNumWord) {
          Result res = new Result();
          String[] chars = alphaNumWord.toCharArray();
          Set<String> distinctChars = new TreeSet<String>();
          for (String char : chars) {
              if (!distinctChars.add(char)) {
                  res.getCharsRepeated().add(char);
             }         
          }
         res.setNumDist(distinctChars.size());
     }
}

.... {
          .....
          Result res = Naira.numDistinctChars("dsds323212" ) ;
         .... 
       }

import java.util.HashMap;
import java.util.Map;
import java.util.Set;
 
public class Details {
 
  public void countDupChars(String str){
 
   
    Map<Character, Integer> map = new HashMap<Character, Integer>(); 

    char[] chars = str.toCharArray();

    for(Character ch:chars){
      if(map.containsKey(ch)){
         map.put(ch, map.get(ch)+1);
      } else {
         map.put(ch, 1);
        }
    }
 
    Set<Character> keys = map.keySet();
 

    for(Character ch:keys){
      if(map.get(ch) > 1){
        System.out.println("Char "+ch+" "+map.get(ch));
      }
    }
  }
 
  public static void main(String a[]){
    Details obj = new Details();
    obj.countDupChars("hello";
  
  }
}