for(i=0;s1[i] && s2[i];i++) { x=s1[i]-97; n=n+pow(10,x); x=s2[i]-97; n=n-pow(10,x); }
-
Notifications
You must be signed in to change notification settings - Fork 0
priyadarsheeni/Code-to-find-if-2-strings-are-Anagrams-without-visiting-every-element-of-the-counter-array-in-c
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published