TechStar Asia - Tech News for Builders and Operators

Introduction

A valid anagram problem is a common question in programming interviews. It helps us understand strings, sorting, and frequency counting.

Problem Statement

Given two strings s and t, determine if t is an anagram of s.

An anagram means both strings contain the same characters with the same frequency, but possibly in a different order.

Approach 1: Sorting Method

Sort both strings
Compare the sorted results
If equal → valid anagram

Python Code (Sorting)


python
def isAnagram(s, t):
    return sorted(s) == sorted(t)

# Example
print(isAnagram("listen", "silent"))

## Approach 2: Frequency Count
1. count characters in both strings
2.compare counts

def isAnagram(s, t):
    if len(s) != len(t):
        return False

    count = {}

    for char in s:
        count[char] = count.get(char, 0) + 1

    for char in t:
        if char not in count or count[char] == 0:
            return False
        count[char] -= 1

    return True

## Example
print(isAnagram("listen", "silent"))

## Input
s = "listen"
t = "silent"

## output
True

Valid Anagram

Introduction

Problem Statement

Approach 1: Sorting Method

Python Code (Sorting)

Comments (0)

United States

Related News

CBS News Shutters Radio Service After Nearly a Century

Officer Leaks Location of French Aircraft Carrier With Strava Run

White House Unveils National AI Policy Framework To Limit State Power

Microsoft Says It Is Fixing Windows 11

Can Private Space Companies Replace the ISS Before 2030?