You are not logged in. Please login at to post your questions!


USING SET(C++) to check if two given strings are anagrams in linear time

Two strings str1 and str2 are of equal length. I used unordered_map to solve this problem by counting the frequency of each character in the word which works just fine BUT I want to use unordered_multiset to solve this problem. I have explained my code with comments

asked 09 Sep '18, 22:22

bipul1895's gravatar image

accept rate: 0%

toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text]( "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:


question asked: 09 Sep '18, 22:22

question was seen: 85 times

last updated: 09 Sep '18, 22:22