We had to code 2 questions in 1.30 hr on codechef only. the questions are as follow :
1.) Implement Least Recently Used (LRU) algorithm - a well known algorithm of operating systems. 2.) Find if a given number is Trojan Number. A Trojan number is a number which is strong but not a perfect power (m^k). A Strong number is a number which has a prime number 'p' its factor and also divisible by p^2 i.e divisible by a prime and also by its square. Hence, Trojan number is a strong number , which can't be represented as m^k. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/C2BWd2BhbywJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
