MyCPTrainer | SDE Intern | Palindrome Permutation

mycptrainer logo
mycptrainer
SDE InternHyderabad, India
January 12, 20260 reads

Summary

I interviewed for an SDE Intern role at MyCPTrainer. The process included a resume discussion focusing on my project and solving a Data Structures & Algorithms problem: Palindrome Permutation.

Full Experience

1. Introduction

I recently interviewed for the SDE Intern role. The process involved a discussion about my resume, specifically my project MyCPTrainer, followed by a DSA problem.

Interview Questions (1)

Q1
Palindrome Permutation
Data Structures & Algorithms

2. Problem Statement: Palindrome Permutation

Problem: Given a string s, write a function to determine if a permutation of the string could form a palindrome.

Example 1:
Input: s = "code"
Output: false
Explanation: No permutation of "code" can form a palindrome.

Example 2:
Input: s = "aab"
Output: true
Explanation: The string can be rearranged as "aba", which is a palindrome.

Example 3:
Input: s = "carerac"
Output: true
Explanation: It can be rearranged to "racecar".

Constraints:
  • The string consists of lowercase English letters.
  • 1 <= s.length <= 10^5
Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!