boolean function ( String arg0 , String arg1 ) { if ( arg0 == null || arg1 == null ) { return false ; } if ( arg0 . length ( ) != arg1 . length ( ) ) { return false ; } String loc0 = arg0 + arg0 ; return loc0 . contains ( arg1 . subSequence ( 0 , arg1 . length ( ) ) ) ; }
i asked this question to a candidate interviewing with ea . concode_field_sep char r_paren concode_elem_sep char r_brace concode_elem_sep char l_bracket concode_elem_sep char r_bracket concode_elem_sep char l_paren concode_elem_sep char l_brace concode_field_sep int countOccurenceRecursion concode_elem_sep int countOccurrenceNoRecursion concode_elem_sep String replaceUsWithThem concode_elem_sep void main concode_elem_sep boolean isAnagram concode_elem_sep boolean isPalindrome concode_elem_sep Integer compute concode_elem_sep String countCharacters concode_elem_sep String longestSubOfUniqueCharacters concode_elem_sep boolean isNumeric concode_elem_sep char firstNonRepeatedCharacter concode_elem_sep Integer calculate concode_elem_sep boolean isBalancedParanthesis