{"action":"created","issue":{"url":"https://api.github.com/repos/kasi1996arun/Hackerrank/issues/1","repository_url":"https://api.github.com/repos/kasi1996arun/Hackerrank","labels_url":"https://api.github.com/repos/kasi1996arun/Hackerrank/issues/1/labels{/name}","comments_url":"https://api.github.com/repos/kasi1996arun/Hackerrank/issues/1/comments","events_url":"https://api.github.com/repos/kasi1996arun/Hackerrank/issues/1/events","html_url":"https://github.com/kasi1996arun/Hackerrank/issues/1","id":138159165,"number":1,"title":"can be done in O(kn) where k is constant ","user":{"login":"shivasurya","id":6303227,"avatar_url":"https://avatars.githubusercontent.com/u/6303227?v=3","gravatar_id":"","url":"https://api.github.com/users/shivasurya","html_url":"https://github.com/shivasurya","followers_url":"https://api.github.com/users/shivasurya/followers","following_url":"https://api.github.com/users/shivasurya/following{/other_user}","gists_url":"https://api.github.com/users/shivasurya/gists{/gist_id}","starred_url":"https://api.github.com/users/shivasurya/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/shivasurya/subscriptions","organizations_url":"https://api.github.com/users/shivasurya/orgs","repos_url":"https://api.github.com/users/shivasurya/repos","events_url":"https://api.github.com/users/shivasurya/events{/privacy}","received_events_url":"https://api.github.com/users/shivasurya/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"milestone":null,"comments":2,"created_at":"2016-03-03T12:04:41Z","updated_at":"2016-04-23T12:53:23Z","closed_at":"2016-04-23T12:46:21Z","body":"https://github.com/kasi1996arun/Hackerrank/blob/master/Algorithms/Strings/Make-it-Anagram/Solution.java\r\n\r\nyou can reduce the complexity - O(n^2) - implement counter sort with same storage array and if the count == 1 just delete it :dart: \r\n\r\nenjoy !"},"comment":{"url":"https://api.github.com/repos/kasi1996arun/Hackerrank/issues/comments/213735839","html_url":"https://github.com/kasi1996arun/Hackerrank/issues/1#issuecomment-213735839","issue_url":"https://api.github.com/repos/kasi1996arun/Hackerrank/issues/1","id":213735839,"user":{"login":"shivasurya","id":6303227,"avatar_url":"https://avatars.githubusercontent.com/u/6303227?v=3","gravatar_id":"","url":"https://api.github.com/users/shivasurya","html_url":"https://github.com/shivasurya","followers_url":"https://api.github.com/users/shivasurya/followers","following_url":"https://api.github.com/users/shivasurya/following{/other_user}","gists_url":"https://api.github.com/users/shivasurya/gists{/gist_id}","starred_url":"https://api.github.com/users/shivasurya/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/shivasurya/subscriptions","organizations_url":"https://api.github.com/users/shivasurya/orgs","repos_url":"https://api.github.com/users/shivasurya/repos","events_url":"https://api.github.com/users/shivasurya/events{/privacy}","received_events_url":"https://api.github.com/users/shivasurya/received_events","type":"User","site_admin":false},"created_at":"2016-04-23T12:53:23Z","updated_at":"2016-04-23T12:53:23Z","body":"`#include <stdio.h>\r\n#include <string.h>\r\n#include <math.h>\r\n#include <stdlib.h>\r\n\r\nint main() {\r\n\r\n    int i=0;\r\n    char *word;\r\n    char *word1;\r\n    int count=0;\r\n    int hashtable[26];\r\n\r\n    word = malloc(10000);\r\n    word1 = malloc(10000);\r\n    scanf(\"%s\",word);\r\n    scanf(\"%s\",word1);\r\n    \r\n    for(i=0;i<26;i++)\r\n    \thashtable[i]=0;\r\n\r\n    for(i=0;word[i]!='\\0';i++)\r\n    {\r\n    \tint temp = ((int)word[i]-97);\r\n\t\thashtable[temp]++;\r\n    }\r\n\tfor(i=0;word1[i]!='\\0';i++)\r\n\t{\r\n\t\tint temp = ((int)word1[i]-97);\r\n\t\thashtable[temp]--;\r\n\t}\r\n\tfor(i=0;i<26;i++){\r\n\t\t//printf(\"%d\",hashtable[i]);\r\n\t\tcount = count + abs(hashtable[i]);\r\n\t}\r\n\tprintf(\"%d\",count);\r\n    return 0;\r\n}`"}}