Python
Getting GPS EXIF Data with Python
Did you know that you can get EXIF data from JPG image files using the Python programming language? You can use Pillow, the Python Imaging Library’s friendly fork to do so. You can read an Read more…
Did you know that you can get EXIF data from JPG image files using the Python programming language? You can use Pillow, the Python Imaging Library’s friendly fork to do so. You can read an Read more…
Python 101 2nd Edition is the latest version of Python 101. This book is meant to help you learn Python and then go beyond the basics. I’ve always felt that a beginner’s book should teach Read more…
This week we welcome Ken Youens-Clark (@kycl4rk) as our PyDev of the Week! He is the author of Tiny Python Projects from Manning. He has done video lectures for each of his chapters on YouTube. Read more…
Given a binary tree, write an efficient algorithm to find the maximum path sum between any two nodes in it. The path can start and end at any node in the tree and need not Read more…
Construct an expression tree from a given postfix notation and print the infix notation. The binary expression tree is a binary tree whose leaves are operands, such as constants or variable names, and the other Read more…
Given a circularly sorted array of integers, find a pair with a given sum. Assume there are no duplicates in the array, and the rotation is in an anti-clockwise direction around an unknown pivot. For Read more…
Given two binary trees, check whether the leaf traversals of both trees are the same or not. For example, the leaf traversals of the following binary trees are 4, 5, 6. A simple solution is Read more…
Given two linked lists, where the tail of the second list points to a node in the first list, find the node where both lists intersect. Consider the following linked lists where the second list’s Read more…
Given n ropes of different lengths, connect them into a single rope with minimum cost. Assume that the cost to connect two ropes is the same as the sum of their lengths. For example, The Read more…
Given a level order representation of a complete binary search tree, print its elements in increasing order. For example, the level order representation of the complete BST below is [15, 10, 20, 8, 12, 18, Read more…