My orders
How it works
Examples
Reviews
Blog
Homework Answers
Submit
Sign in
How it works
Examples
Reviews
Homework answers
Blog
Contact us
Submit
Fill in the order form to get the price
Subject
Select Subject
Programming & Computer Science
Math
Engineering
Economics
Physics
Other
Category
C++
Software Engineering
Java | JSP | JSF
Databases | SQL | Oracle | MS Access
C
Python
Excel
C#
Visual Basic
Computer Networks
Functional Programming
Android
Assembler
UNIX/Linux Programming
ASP | ASP.NET
MatLAB
Wolfram Mathematica
MathCAD
Maple
Perl
Action Script | Flash | Flex | ColdFusion
Ruby | Ruby on Rails
Prolog
Objective-C | Swift
Algorithms
Web Development
HTML/JavaScript Web Application
NodeJS Web Application
Other
Deadline
Timezone:
Title
*
Task
*
{"ops":[{"insert":"HALINDROME Given string S. Let us divide S to two equal parts S1 and S2. S is called halindrome if atleast any one of the following condition satisfy. a) String S is palindrom and length of S >=2 b) String S1 is halindrom. c) String s2 is halindrom. In case of odd length string, the middle element is not present in both S1 and S2. If index of middle element is M, then S1 is equal to S[0,m-1] and S2 = S[m+1, |S|- 1].\n Input Specification \nInput1: No. of strings. 1<= Input1 <=100 \nOutput Specification find whether string is halindrome. \nA string is Halindrom if any one of the criteria is correct .\n a) String S is palindrom and its length is >=2 \nb) String S1 is halindrom.\n c) String s2 is halindrom. if string length of S is odd then center letter is ignored and S1 is [0, len\/2 -1] and S2 is [len\/2+1, len-1]\n"}]}
I need basic explanations
Special Requirements
Upload files (if required)
Drop files here to upload
Add files...
Account info
Already have an account?
Create an account
Name
*
E-mail
*
Password
*
The password must be at least 6 characters.
I agree with
terms & conditions
Create account & Place an order
Please fix the following input errors:
dummy
