MyCPTrainer | SDE Intern | Palindrome Permutation
- Location
- Hyderabad, India
- Posted
- 12 Jan 2026
263 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.
How it went
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.
Questions asked (1)
- 01
Palindrome Permutation
Data Structures & Algorithms
2. Problem Statement: Palindrome Permutation
Problem: Given a strings, 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