## Using Python to Build Video Games

Python’s object-oriented approach helps programmers write better code We all remember our first code games on Scratch. With simple conditionals, the novice coder could create an engaging, albeit clunky, conversation…

## Find the node with minimum value in a Binary Search Tree

Python Program – Find the node with minimum value in a Binary Search Tree – Just traverse the node from root to left recursively until left is NULL.

## PYTHON Programming for Write a program to print all permutations of a given string

PYTHON Programming for Write a program to print all permutations – Mathematical Algorithms – A permutation, also called an “arrangement number” or “order”

## PYTHON Programming-Write a program to print all permutations of a given string

PYTHON Programming-Write a program to print all permutations of a given string – Searching and Sorting – A permutation, also called an “arrangement number”. or “order,” is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself.

## PYTHON Programming-Merge Sort for Doubly Linked List

PYTHON Programming-Merge Sort for Doubly Linked List – Searching and Sorting – Merge sort for singly linked list is already discussed. The important change here is to modify the previous pointers also when merging two lists.

## PYTHON programming for Searching for Patterns Set 2 KMP Algorithm

Python programming for Searching for Patterns Set 2 KMP Algorithm – Searching and sorting -Given a text txt[0..n-1] and a pattern pat[0..m-1].

## PYHTON Programming-Searching for Patterns Set 1 Naive Pattern Searching

PYHTON Programming-Searching for Patterns Set 1 Naive Pattern Searching – Searching and Sorting – Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] in txt[].

## Python Program Count 1’s in a sorted binary array

PYTHON Program Count 1’s in a sorted binary array – Searching and Sorting – A simple solution is to linearly traverse the array. The time complexity of the simple solution is O(n). We can use Binary Search to find count in O(Logn) time.

## Python Programming – Longest Common Subsequence

Python Programming – Longest Common Subsequence – Dynamic Programming – LCS problem has optimal substructure property as main problem can be solved.

## PYTHON Programming-Find common elements in three sorted arrays

PYTHON Programming-Find common elements in three sorted arrays – Searching and sorting – A simple solution is to first find intersection of two arrays and store the intersection in a temporary array, then find the intersection of third array and temporary array.