Anagrams - Amit Bansal (Smart Interviews)

Поділитися
Вставка
  • Опубліковано 15 лис 2018
  • Given 2 strings, check if they are anagrams.

КОМЕНТАРІ • 12

  • @rahulparshi3172
    @rahulparshi3172 5 років тому +9

    4th & 5th points are 👌👌 . They can easily trick us in the interview.

  • @sanjanatalasila9052
    @sanjanatalasila9052 3 роки тому +8

    Sir, the videos are a masterpiece
    Not everyone can afford the paid course. Can u make some important videos free on UA-cam?

  • @naveennoel9496
    @naveennoel9496 3 роки тому

    Went in so smoothly :)

  • @Lucifer-jl9vh
    @Lucifer-jl9vh Рік тому +1

    He is one of a kind!, Absolutely wonderful explanation sir

  • @kamlekar
    @kamlekar 5 років тому

    Very crisp sir.

  • @nahedaduggu4100
    @nahedaduggu4100 4 роки тому

    Do more vedios sir

  • @mahadevkumar1895
    @mahadevkumar1895 5 років тому

    sir we need data structures

  • @amruthsaiporeddy
    @amruthsaiporeddy 3 роки тому +1

    compare sum and product of characters ASCII values

  • @ridimamittal4064
    @ridimamittal4064 4 роки тому

    do more videos please :)

  • @saiyashwanth1991
    @saiyashwanth1991 5 років тому

    what about sort two strings and apply hashcode on both of em and see if both are equal?

    • @SmartInterviews
      @SmartInterviews  5 років тому +4

      This should work, however if you have sorted the strings, you can simply compare, instead of applying hashcode!

    • @BUNNY-qp2ds
      @BUNNY-qp2ds 9 місяців тому

      ​@@SmartInterviewsWhat is HashCode