Algorithms Find minimum number of deletions to make a string palindrome We need to find the minimum number of characters to be deleted in a string to make it a palindrome. This can be done in O(N^2) time with the help of Dynamic Programming approach of Longest Palindromic Subsequence.
Software Engineering Round Robin Scheduling Algorithm The key idea of Round Robin Scheduling algorithm is to allocate CPU to all processes in the same order for the same amount of time in turns. It provides real time computing experience.
