Python: Stack with Push, Pop and seek Minimum Value with O(1)
Learn how to implement a stack with push, pop, and seekMin functions in Python 3 with a time complexity of O(1). Check out this code!
Dipin Krishna
Dipin Krishna
Python: Lowest Common Ancestor of a Binary Tree – Non Recursive
Python 3 code to find the Lowest Common Ancestor of a Binary Tree This is a Non Recursive solution using DFS method. class Node(): def… Read More »Python: Lowest Common Ancestor of a Binary Tree – Non Recursive
Python: Lowest Common Ancestor of a Binary Search Tree
Python 3 code to find the Lowest Common Ancestor of a Binary Search Tree def lowestCommonAncestor(root, p, q): """ :type root: TreeNode :type p: TreeNode… Read More »Python: Lowest Common Ancestor of a Binary Search Tree
Python: Array/List Rotation – Right
Python program to rotate an array towards its right Inplace Method # Rotate Array def roateRight(arr, size, rotate_count): array_length = len(arr) if array_length <= 0:… Read More »Python: Array/List Rotation – Right
Python: Array/List Rotation – Left
Python program to rotate an array towards its left Inplace Method # Rotate Array def roateLeft(arr, size, rotate_count): array_length = len(arr) if array_length <= 0:… Read More »Python: Array/List Rotation – Left
PHP Error:0607A082:digital envelope routines:EVP_CI PHER_CTX_set_key_length:invalid key length
If you are trying to use an older version of PHP to connect MYSQL over SSL, there is a good chance that you encounter the… Read More »PHP Error:0607A082:digital envelope routines:EVP_CI PHER_CTX_set_key_length:invalid key length