# Python | Program to Create two lists with EVEN numbers and ODD numbers from a list

Here, we will learn how to **create two lists with EVEN and ODD numbers from a given list in Python**? To implement this program, we will check EVEN and ODD numbers and appends two them separate lists.

Submitted by **IncludeHelp**, on July 26, 2018

**Given a list, and we have to create two lists 1) list with EVEN numbers and 2) list with ODD numbers from given list in Python.**

**Example:**

Input: List1 = [11, 22, 33, 44, 55] Output: List with EVEN numbers: [22, 44] List with ODD NUMBERS: [11, 33, 55]

**Logic:**

To create lists with EVEN and ODD numbers, we will traverse each element of list1 and append EVEN and ODD numbers in two lists by checking the conditions for EVEN and ODD.

**Program:**

# declare and assign list1 list1 = [11, 22, 33, 44, 55] # declare listOdd - to store odd numbers # declare listEven - to store even numbers listOdd = [] listEven = [] # check and append odd numbers in listOdd # and even numbers in listEven for num in list1: if num%2 == 0: listEven.append(num) else: listOdd.append(num) # print lists print "list1: ", list1 print "listEven: ", listEven print "listOdd: ", listOdd

**Output**

list1: [11, 22, 33, 44, 55] listEven: [22, 44] listOdd: [11, 33, 55]

TOP Interview Coding Problems/Challenges

- Run-length encoding (find/print frequency of letters in a string)
- Sort an array of 0's, 1's and 2's in linear time complexity
- Checking Anagrams (check whether two string is anagrams or not)
- Relative sorting algorithm
- Finding subarray with given sum
- Find the level in a binary tree with given sum K
- Check whether a Binary Tree is BST (Binary Search Tree) or not
- 1[0]1 Pattern Count
- Capitalize first and last letter of each word in a line
- Print vertical sum of a binary tree
- Print Boundary Sum of a Binary Tree
- Reverse a single linked list
- Greedy Strategy to solve major algorithm problems
- Job sequencing problem
- Root to leaf Path Sum
- Exit Point in a Matrix
- Find length of loop in a linked list
- Toppers of Class
- Print All Nodes that don't have Sibling
- Transform to Sum Tree
- Shortest Source to Destination Path

Comments and Discussions

**Ad:**
Are you a blogger? Join our Blogging forum.