PavelBo elvisfromsouth

## MyIterator.kt
// написать имплементацию интерфейса Iterator<T>, где Т может быть либо Int, либо Iterator<T>

interface MyIterator<T> {
    fun hasNext(): Boolean
    fun next(): T
}

class IntRecursionImpl(
    items: List<Any>
): MyIterator<Int> {

## 2.py
class Solution:
    def addTwoNumbers(self, l1: Optional[ListNode], l2: Optional[ListNode]) -> Optional[ListNode]:
        dummy = ListNode(0)

        currentNode = dummy
        extra = 0

        while l1 or l2:
            currentSum = extra


## Interview Topics.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                elvisfromsouth
                / Interview Topics.md
            
            
              Created
              February 7, 2017 08:14
                — forked from lawloretienne/Interview Topics.md
            
          
    Table Of Contents


[Data Structures] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#data-structures)
[Linked Lists] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#linked-lists)
[Trees] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#trees)

[Binary Trees] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#binary-trees)
[Binary Search Tree] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#binary-search-tree)
[Red-Black Tree] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#red-black-tree)
[AVL Tree] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#avl-tree)


[Tries] (https://gist.github.com/lawloretienne/6f7d7d92f72986f5ebd60f226d9044ee#tries)
	// написать имплементацию интерфейса Iterator<T>, где Т может быть либо Int, либо Iterator<T>

	interface MyIterator<T> {
	fun hasNext(): Boolean
	fun next(): T
	}

	class IntRecursionImpl(
	items: List<Any>
	): MyIterator<Int> {
	class Solution:
	def addTwoNumbers(self, l1: Optional[ListNode], l2: Optional[ListNode]) -> Optional[ListNode]:
	dummy = ListNode(0)

	currentNode = dummy
	extra = 0

	while l1 or l2:
	currentSum = extra