SDE - 2

You are given a string 'STR'. The string contains [a-z] [A-Z] [0-9] [special characters]. You have to find the reverse of the string.

For example:

 If the given string is: STR = "abcde". You have to print the string "edcba".

follow up:

Try to solve the problem in O(1) space complexity. 

You are given a string S of words. Your task is to count the occurrence of each word present in the string S. A word is a sequence of one or more non-space characters, and there can be multiple spaces between two words, and also there can be leading or trailing spaces in a string S.

For Example:

For the given string  “what we think we become”

“what”,” think”, and “become” occurs 1 time, and “we” occurs 2 times in the given string.

You are given a string (STR) of length N, consisting of only the lower case English alphabet.

Your task is to remove all the duplicate occurrences of characters in the string.

For Example:

If the given string is:
abcadeecfb

Then after deleting all duplicate occurrences, the string looks like this:
abcdef

The assignment focused on evaluating practical Java skills and problem-solving ability. It included implementing core Java concepts such as object-oriented programming, collections, and exception handling. The tasks required writing clean, readable, and efficient code while following best practices.

One part of the assignment involved processing data using appropriate data structures, applying logical conditions, and handling edge cases. Another part emphasized designing a small Java application structure, showcasing proper class design, clear method responsibilities, and code reusability.

Overall, the assignment tested not only the correctness of the solution but also code quality, clarity of approach, and the ability to explain the logic. It reinforced the importance of strong fundamentals, clean coding standards, and real-world problem understanding.

You are given an array of integers ‘A’ having ‘N’ number of elements. It is given that all the numbers in the array occur twice except the two numbers that appear only one time. You need to find those two non-repeating numbers.

For Example:

If the given array is [ 4, 7, 3, 2, 7, 2 ], you have to find ‘4’ and ‘3’ as 4 and 3 occur one time, and the rest of the elements ( 7 and 2 ) are occurring twice.

You are given a string 'S'. Your task is to check whether the string is palindrome or not. For checking palindrome, consider alphabets and numbers only and ignore the symbols and whitespaces.

Note :

String 'S' is NOT case sensitive.

Example :

Let S = “c1 O$d@eeD o1c”.
If we ignore the special characters, whitespaces and convert all uppercase letters to lowercase, we get S = “c1odeedo1c”, which is a palindrome. Hence, the given string is also a palindrome.

• Tell us about yourself and your journey into Java development.
• Why do you want to work with our company?
• What are your strengths and weaknesses?
• Where do you see yourself in five years?