Master Palindrome Sorting Medium - Intermediate-Advanced Level Problems Palindrome Sorting Medium INTERMEDIATE ADVANCED

Excel in competitive exams with this self assessment worksheet on Palindrome Sorting Medium. Worksheet 7 of 10 contains 20 intermediate-advanced-level problems. Target your accuracy improvement skills while practicing palindrome sorting medium shortcut methods, palindrome sorting medium bank exam questions, and palindrome sorting medium ssc cgl.

📝 Worksheet 7 of 10 • 20 questions • ⏱️ Estimated time: 20 minutes • 🎯 Intermediate Advanced level

What you'll learn in this worksheet:
Your progress through Palindrome Sorting Medium
Worksheet 7 of 10 (66% complete)

Question 1

Input: madam python hello coding noon Step 1: Palindromic words (read same forwards/backwards): madam noon Step 2: Non-palindromic words: coding hello python Step 3: Combine (palindromes first, then others, each sorted alphabetically): madam noon coding hello python What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): madam noon coding hello python

Question 2

Input: python hello madam radar world Step 1: Palindromic words (read same forwards/backwards): madam radar Step 2: Non-palindromic words: hello python world Step 3: Combine (palindromes first, then others, each sorted alphabetically): madam radar hello python world What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): madam radar hello python world

Question 3

Input: coding python hello radar refer Step 1: Palindromic words (read same forwards/backwards): radar refer Step 2: Non-palindromic words: coding hello python Step 3: Combine (palindromes first, then others, each sorted alphabetically): radar refer coding hello python What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): radar refer coding hello python

Question 4

Input: python hello refer noon world Step 1: Palindromic words (read same forwards/backwards): noon refer Step 2: Non-palindromic words: hello python world Step 3: Combine (palindromes first, then others, each sorted alphabetically): noon refer hello python world What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): noon refer hello python world

Question 5

Input: hello level coding world noon Step 1: Palindromic words (read same forwards/backwards): level noon Step 2: Non-palindromic words: coding hello world Step 3: Combine (palindromes first, then others, each sorted alphabetically): level noon coding hello world What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): level noon coding hello world

Question 6

Input: madam world deed python coding Step 1: Palindromic words (read same forwards/backwards): deed madam Step 2: Non-palindromic words: coding python world Step 3: Combine (palindromes first, then others, each sorted alphabetically): deed madam coding python world What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): deed madam coding python world

Question 7

Input: hello deed coding python racecar Step 1: Palindromic words (read same forwards/backwards): deed racecar Step 2: Non-palindromic words: coding hello python Step 3: Combine (palindromes first, then others, each sorted alphabetically): deed racecar coding hello python What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): deed racecar coding hello python

Question 8

Input: radar hello noon world python Step 1: Palindromic words (read same forwards/backwards): noon radar Step 2: Non-palindromic words: hello python world Step 3: Combine (palindromes first, then others, each sorted alphabetically): noon radar hello python world What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): noon radar hello python world

Question 9

Input: coding deed hello noon world Step 1: Palindromic words (read same forwards/backwards): deed noon Step 2: Non-palindromic words: coding hello world Step 3: Combine (palindromes first, then others, each sorted alphabetically): deed noon coding hello world What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): deed noon coding hello world

Question 10

Input: hello madam world deed python Step 1: Palindromic words (read same forwards/backwards): deed madam Step 2: Non-palindromic words: hello python world Step 3: Combine (palindromes first, then others, each sorted alphabetically): deed madam hello python world What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): deed madam hello python world

Question 11

Input: refer noon python coding world Step 1: Palindromic words (read same forwards/backwards): noon refer Step 2: Non-palindromic words: coding python world Step 3: Combine (palindromes first, then others, each sorted alphabetically): noon refer coding python world What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): noon refer coding python world

Question 12

Input: hello python world level radar Step 1: Palindromic words (read same forwards/backwards): level radar Step 2: Non-palindromic words: hello python world Step 3: Combine (palindromes first, then others, each sorted alphabetically): level radar hello python world What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): level radar hello python world

Question 13

Input: refer madam world hello python Step 1: Palindromic words (read same forwards/backwards): madam refer Step 2: Non-palindromic words: hello python world Step 3: Combine (palindromes first, then others, each sorted alphabetically): madam refer hello python world What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): madam refer hello python world

Question 14

Input: coding python hello racecar refer Step 1: Palindromic words (read same forwards/backwards): racecar refer Step 2: Non-palindromic words: coding hello python Step 3: Combine (palindromes first, then others, each sorted alphabetically): racecar refer coding hello python What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): racecar refer coding hello python

Question 15

Input: python noon madam coding world Step 1: Palindromic words (read same forwards/backwards): madam noon Step 2: Non-palindromic words: coding python world Step 3: Combine (palindromes first, then others, each sorted alphabetically): madam noon coding python world What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): madam noon coding python world

Question 16

Input: refer racecar world python coding Step 1: Palindromic words (read same forwards/backwards): racecar refer Step 2: Non-palindromic words: coding python world Step 3: Combine (palindromes first, then others, each sorted alphabetically): racecar refer coding python world What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): racecar refer coding python world

Question 17

Input: noon coding python level world Step 1: Palindromic words (read same forwards/backwards): level noon Step 2: Non-palindromic words: coding python world Step 3: Combine (palindromes first, then others, each sorted alphabetically): level noon coding python world What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): level noon coding python world

Question 18

Input: python world refer madam coding Step 1: Palindromic words (read same forwards/backwards): madam refer Step 2: Non-palindromic words: coding python world Step 3: Combine (palindromes first, then others, each sorted alphabetically): madam refer coding python world What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): madam refer coding python world

Question 19

Input: hello coding world refer noon Step 1: Palindromic words (read same forwards/backwards): noon refer Step 2: Non-palindromic words: coding hello world Step 3: Combine (palindromes first, then others, each sorted alphabetically): noon refer coding hello world What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): noon refer coding hello world

Question 20

Input: python deed hello world level Step 1: Palindromic words (read same forwards/backwards): deed level Step 2: Non-palindromic words: hello python world Step 3: Combine (palindromes first, then others, each sorted alphabetically): deed level hello python world What is the final output?
Palindromic words first (alphabetically sorted), then non-palindromic words (alphabetically sorted): deed level hello python world
Previous Worksheet Next Worksheet