1st Round : 1. Nearest prime number of given number if there are two nearest prime numbers print both. Ex - input = 30 output = 29, 31. 2.Write a function that takes input as a String. It should return true if all characters in the string are unique, false otherwise. You cannot use additional data structure. (a-z and 1-9. No Unicode/Special character/Uppercase characters) 3. For “aabcccccaaa” input, your method will return “a2b1c5a3” but for “abcd” input, your method will return “abcd” 4. Cool Dude program. 5.Write a function which takes input as a number: If the given number is a Fibonacci number, print the number If the given number is NOT Fibonacci number, print the sum of all even Fibonacci numbers less than the given number. 2nd Round: 1. Array contains only 0 and 1, Write a program that sort this numbers using single loop 2. input = Raja Software Labs output = Raja%20Software%20Labs. You are not allowed to use extra string or extra array. You have to modify the given input string only. 3rd Round: 1. You will find question here : https://www.geeksforgeeks.org/add-1-number-represented-array/ 2. Find the unique substrings of a given string. 3. I don't remember the question now 4. puzzle : https://www.geeksforgeeks.org/puzzle-rope-escape/ 4th Round: It consists of general discussion about you and your resume, Projects. 1. Check for balanced parenthesis, If the given string is not balanced then balance it and return. string only contain "{" and "}"
