Given a list of integers, this function returns the sum of the integers in even-numbered positions in the list. For example, given the list [1, 2, 3, 4, 5], the function would return 6 (2 + 4).

173

Nov 21
This technical problem deals with determining whether a string is balanced or not. A string is considered balanced if it consists of opening and closing parentheses that match each other and are in the correct order.

211

Nov 12
This technical problem asks the reader to write a function that returns the sum of the elements in a stack. An example input and output is provided.

228

Nov 10
This problem asks for a efficient way to implement a Queue using two Stacks.

203

Nov 10
This problem is about finding the largest integer in a list. An example input would be [1, 2, 3, 4, 5], and the expected output would be 5.

257

Nov 09
This technical problem asks you to implement a queue using two stacks. This can be done by pushing the elements onto one stack, and then popping them off onto the other stack when you need to dequeue an element.

194

Nov 08
Given a list of integers, this function returns the index of the first element that is greater than the given integer.

282

Nov 07
Given a string of parentheses, write a function to determine whether the string is balanced. A string is balanced if each opening parenthesis has a corresponding closing parenthesis, and the string does not contain any unmatched parentheses.

211

Nov 06