Python Algorithm – Length of the longest valid substring
Python Algorithm – Length of the longest valid substring – Stack – Given a string consisting of opening and closing parenthesis
Category: PYTHON
Python Algorithm – Write a program function to detect loop in a linked list
Python Algorithm – Write a program function to detect loop in a linked list – Linked List – Given a linked list, check if the the linked list has loop
Python Programming – check for pair in A[] with sum as x
Time Complexity: Depends on what sorting algorithm we use. If we use Merge Sort or Heap Sort then (-)(nlogn) in worst case.
Python Programming-Check whether a given Binary Tree is Complete or not
Check whether given binary tree complete not Given a Binary Tree, write a function to check whether the given Binary Tree is Complete Binary Tree or not.
Python Algorithm – Write a function to reverse a linked list
Python Algorithm – Write a function to reverse a linked list – Linked List – Given pointer to the head node of a linked list, the task is to reverse
Python Algorithm – Next Greater Element
Python Algorithm – Next Greater Element – Stack – Given an array, print the Next Greater Element (NGE) for every element.
Python Programming – Binary Tree in Vertical Order Hashmap based Method
An efficient solution based on hash map is discussed. We need to check the Horizontal Distances from root for all nodes and two nodes have the same
Python program to check if a binary tree is BST or not
Python program to check if a binary tree is BST or not – Data Structure – A binary search tree is a node based binary tree data structure.
Python Programming – Check a given sentence for a given set of simple grammer rules
A simple sentence if syntactically correct if it fulfills given rules. The following are given rules. Sentence must start with a Uppercase character.
PYTHON Programming Eulerian path and circuit for undirected graph
PYTHON Programming – Eulerian path and circuit for undirected graph – Eulerian Path is a path in graph that visits every edge exactly once.