Simple LeetCode String Checks | Dataford Interview Questions

How would you solve easy LeetCode-style problems like checking if a string is a palindrome or if two strings are anagrams?

Implement string_checks(s, t) to return an object containing is_palindrome for s and are_anagrams for s and t; comparisons are case-sensitive and include every character. For example, string_checks("level", "velle") returns { "is_palindrome": true, "are_anagrams": true }, while string_checks("hello", "world") returns { "is_palindrome": false, "are_anagrams": false }. Inputs contain 0 to 1,000 characters and may include letters, digits, spaces, or punctuation.

Constraints

0 <= len(s), len(t) <= 1,000
Strings may contain letters, digits, spaces, and punctuation
Comparisons are case-sensitive
Whitespace and punctuation are treated as ordinary characters

Function Signature

def string_checks(s, t):

Your question is Simple LeetCode String Checks. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

How would you solve easy LeetCode-style problems like checking if a string is a palindrome or if two strings are anagrams?

Constraints

0 <= len(s), len(t) <= 1,000
Strings may contain letters, digits, spaces, and punctuation
Comparisons are case-sensitive
Whitespace and punctuation are treated as ordinary characters

Function Signature

def string_checks(s, t):

Your question is Simple LeetCode String Checks. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.