Given a string, return whether it is made of a perfectly repeated string pattern.
You have a directed connected graph. Write an algorithm that detects any cycle, if one exists, and returns a list of its nodes.
I take n consecutive integers, toss one of them out and mix up the remaining n-1 integers as completely unsorted. Find the missing integer.
Given a Singly Linked List, write an algorithm to find the middle node. You may not use more than one loop of any kind.
Then calculate the average time complexity of inserting n new items into an empty brand new ArrayList.
You are given n, a positive integer. Return true if n is a prime number, and false if it's not.