finding if two words are anagrams of each other

by

Count the frequency of each character in the two strings. Check if the two histograms match. O(n) time, O(1) space (assuming ASCII) (Of course it is still O(1) space for Unicode but the table will become very large).

More Related Contents:

  1. Apply Quicksort to the list M,E,R,G,E,S,O,R,T
  2. How to determine if a point is in a 2D triangle? [closed]
  3. Data structures for loaded dice?
  4. Writing your own square root function
  5. Merge Sort a Linked List
  6. How do you like your primary keys? [closed]
  7. How to determine if a linked list has a cycle using only two memory locations
  8. Computing set intersection in linear time?
  9. Best word wrap algorithm? [closed]
  10. Circle-circle intersection points
  11. What is a bubble sort good for? [closed]
  12. Sorting in place
  13. Programming Riddle: How might you translate an Excel column name to a number?
  14. Given a number, produce another random number that is the same every time and distinct from all other results
  15. Hashing a Tree Structure
  16. Quicksort superiority over Heap Sort
  17. Best way of calculating n choose k?
  18. Why DFS and not BFS for finding cycle in graphs
  19. Finding multiple entries with binary search
  20. Painter puzzle – algorithmic estimation from first principles
  21. Polynomial time and exponential time
  22. Given a number, find the next higher number which has the exact same set of digits as the original number
  23. How to count integers between large A and B with a certain property?
  24. The best shortest path algorithm
  25. Why is depth-first search claimed to be space efficient?
  26. Algorithm for permutations of operators and operands
  27. How can I convert between a double-double and a decimal string?
  28. Optimized low-accuracy approximation to `rootn(x, n)`
  29. What are probabilistic data structures?
  30. Connected Component Labeling – Implementation

Leave a Comment