Check if binary representation of a number is palindrome – Bit Algorithm – Given an integer ‘x’, write a C function that returns true if binary .
Algorithm
263 Articles
263
C Algorithm – Evaluation of Postfix Expression – Data Structure -The Postfix notation is used to represent algebraic expressions.
Longest Palindromic Substring – Dynamic Programming -Given a string,find the longest substring which is palindrome. For example, if the given string ing is
Python Programming – Largest Sum Contiguous Subarray – Dynamic Programming Write program to find the sum of contiguous subarray within one-dimensional array
Java Programming – Largest Sum Contiguous Subarray – Dynamic Programming Write a program to find the sum of contiguous subarray within one-dimensional array
C++ Programming – Largest Sum Contiguous Subarray – Dynamic Programming Write a program to find the sum of contiguous subarray within one-dimensional array
Java Algorithm – Infix to Postfix Conversion using Stack – Data Structure – Infix expression:The expression of the form a op b.
PYTHON PROGRAMMING – Biconnected Components – learn in 30 sec from microsoft awarded MVP , A biconnected component is a maximal biconnected subgraph.
Biconnected Graph is already discussed here.
Java Programming Shortest path with exactly k edges in a directed and weighted graph The graph is given as adjacency matrix representation where value
c++ PROGRAMMING – Tarjan’s Algorithm to find Strongly Connected Components – LEARN IN 30 SEC FROM MICROSOFT AWARDD MVP , A directed graph is strongly connected if there is a path between all pairs of vertices. A strongly connected component (SCC) of a directed graph is a maximal strongly connected subgraph