Basic

• Fibonacci Series – 1. Using loop.  2. Using recursion.  3. Using memoization.(Technique to improve speed of computation by storing complex calculation results)
• PrimeNumber- Prime number is number which is only divisible by 1 and itself. eg : 2,3, 5, 7 , 11..
• Palindrome – Palindrome is word, number which is same forward and backword. eg 45654,abcba is palindrome eg 45655,abcbb is not palindorme.
• Duplicate element in Array –  Program to find duplicate element in array in O(n) time and fixed space complexity.  
• Highest frequency element in array – Program to find highest frequency element in array using two approach with complexity O nlogn and O n .  
• Unique character in String – Program to find String has unique char or not.
• SetBitCount – Program to find count of set bit in positive integer.