Python-DataStructure-and-Algorithm

Python Tips and Tricks

Different ways to test multiple flags at once Q : Different ways to test multiple logical condition at once

How to sort a Python dict by value with single line expression input : dict = {'a': 99, 'b': 0, 'c': 101, 'd': 10, 'e': -1} expected output : [('e', -1), ('b', 0), ('d', 10), ('a', 99), ('c', 101)]

python_tipsandtricks_merge_two_dict.py Merging two dicts with a single expression Given dictionary:

x = {'a': 1, 'b': 2} y = {'b': 3, 'c': 4} expected output: z {'c': 4, 'a': 1, 'b': 3}

Linked List

linkedlist_nth_to_lastnode.py Q: find the nth element from last node of a given linked list. If nth value is greater than given linked list then through back LookupError.

LinkedList_CycleCheck.py Q: check for cycle in give given linked list if exist return True else False.

1 --> 2 --> 3 --> 1
True
1 --> 2 --> 3 --> None
False

Recursion

how to visualize recursion: here is the diagram for factorical of 5!

recursion_factorial.py Q: find the factorial for given integer

recursion_cumulative_sum.py Q: find the sum of n. Ex: given input : 4 return : 4 + 3 + 2 + 1

recursion_word_split_problem.py Q: Determine if it is possible to split the given string in a way in which words can be made from the list of words. Ex: given sting "iLoveIndia" and list of word ["i", "India", "Love"] then your function has to return True else False.

recursion_reverse_string.py Q: reverse a string without using slicing & iteration. Ex: given sting "hello world" than your function has to return "dlrow olleh".

Queue : Priority Queue

queue_priorityqueue.py Short intro : A priority queue is an abstract data structure ( a data type defined by its behaviour) is like a normal queue but each item has special key to quantify its priority. Ex: Airlines that give luggage on conveyer belt based on the status/ticket class of the passengers. Baggage tagged with priority/business/first-class usally arrives earlier than other non-tagged baggage.

implementation of priority queue

Using list
- It takes ++O(n log n)++ time to maintain the order when an item is added to the list.
- Efficient when we have to make very few insertions.
Using heapq
- It takes ++O(log n)++ time for insertion and extraction of the smallest element.
- Suitable for all the case.
Using queue.PriorityQueue
- It takes ++O(log n)++, internally use same heapq implementation.
- It is synchronized - So it supports concurrent process
- It is class interface instead of function. Thus, PriorityQueue is the classic OOP style of implementing and using Priority Queue.

Dict