Learn How to Solve a Classic Palindrome Problem on HackerRank!
In this video, we solve “Check Palindrome by Filtering Non-Letters”, a common HackerRank string problem asked in Software Engineer interviews.
We break the solution down step by step, in a beginner-friendly way, covering:
✅ How to ignore digits and symbols
✅ How to compare strings in a case-insensitive manner
✅ How to filter only alphabetic characters
✅ Two-pointer palindrome checking technique
✅ Clean, interview-ready Java solution
📌 Who Should Watch This?
🔥 HackerRank Software Engineer Preparation Kit learners
🎓 CS / AI / DS students
💻 Freshers preparing for coding interviews
🧠 Beginners learning strings & palindrome logic
🧩 Problem Highlights
Works with mixed input (letters, numbers, symbols)
Case-insensitive comparison
Efficient O(n) solution
Covers tricky edge cases (empty string, single character)
🧠 Interview Tip
Interviewers don’t just want the answer —
they want to see string filtering, character validation, and clean logic.
This problem tests all three.
Part of the Ultimate HackerRank Guide
This video is part of a complete HackerRank Software Engineer Interview Preparation Series, focused on clear thinking and fundamentals.
👍 Support the Channel
Like 👍
Subscribe 📌
Turn on notifications 🔔
