Given a circular list of integers (when you reach the end of the list you come back to the beginning), what is the most efficient algorithm to find the smallest integer in the list? For example: circular_list = [22, 52, 66, 82, 5, 8, 12, 19].

0 Answers  

---

Write a function, tokenize_string(input_string, delimiter_list) that returns a list of strings that are separated by the delimiters. For example: tokenize_string("How now, Mrs. Brown Cow") returns ['How', 'now', 'Mrs', 'Brown', 'Cow']

1 Answers   Traviate,

---

Write a python program to check if a number is a strong number?

0 Answers  

---

Write a python program to count the number of digits in a number?

0 Answers  

---

How do you set a global variable inside a function?

0 Answers  

---

Write a simple "Hello User" python code snippet.

1 Answers  

---

Discuss an algorithm to traverse a tree, depth first.

0 Answers  

---

Write a python program to check if a number is a prime number?

0 Answers  

---

What is the output, suppose list1 is [1, 3, 2], what is list1 * 2 ?

0 Answers  

---

Write a function to efficiently convert a floating point number to a rational number. For example, given 0.125 return "1/8"

0 Answers  

---

Write a function that takes an array of integers and efficiently calculates and returns the Least Common Multiply in python.

0 Answers  

---

Write a function that takes an array of integers and returns that array rotated by N positions. For example, if N=2, given the input array [1, 2, 3, 4, 5, 6] the function should return [5, 6, 1, 2, 3, 4]

0 Answers  

---