This is mainly an application of Catalan Numbers. Total possible valid expressions for input n is n/2’th Catalan Number if n is even and 0 if n is odd.
C++ programming
94 Articles
94
Write code to find lexicographic minimum in a circular array, e.g. for the array BCABDADAB, the lexicographic minimum is ABBCABDAD.
C++ Programming – Program to evaluate simple expressions – Algorithm – string that represent an expression of digits and operands. E.g. 1+2*3, 1-2+4.
C++ Programming – Rearranged to form a palindrome – Algorithm – Given a string, if characters of the given string can be rearranged to form a palindrome.
C++ Programming – Count of n digit numbers whose sum of digits equals to given sum – Dynamic Programming Given two integers ‘n’ and ‘sum’, find count of all
C++ programming Eulerian path and circuit – undirected graph. Eulerian Path is a path in graph that visits every edge exactly once.
C++ Programming Inorder predecessor and successor for a given key in BST – I recently encountered with a question in an interview at e-commerce company.
C++ Algorithm – Write a function that counts the number of times a given int occurs in a Linked List – Linked List – Given a singly linked list and a key.
C++ Algorithm – Write a function to delete a Linked List – Linked List – Iterate through the linked list and delete all the nodes one by one.
C++ Programming – Bellman Ford Algorithm – Dynamic Programming Given a graph and a source vertex src in graph, find shortest paths from src to all vertices