Java Algorithm – Evaluation of Postfix Expression – Data Structure -Given a string, reverse it using stack. For example “GeeksQuiz” should be converted
JAVA
113 Articles
113
Java Algorithm – Delete a Linked List node at a given position – Linked List – Given a singly linked list and a position, delete a linked list
Java Algorithm – Infix to Postfix Conversion using Stack – Data Structure – Infix expression:The expression of the form a op b.
Java Programming Shortest path with exactly k edges in a directed and weighted graph The graph is given as adjacency matrix representation where value
Java Programming – Ugly Numbers – Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5. Here we use similar merge
Java Algorithm -Introduction to Stack – Data Structure -Stack is a linear data structure which follows a particular order in which the operations
Java Programming – Time complexity of append is O(n) where n is number of nodes in linked list. Since there is loop from head to end, the function does O(n)
Java Algorithm – Introduction for Linked List – Linked List – Like arrays, Linked List is a linear data structure. Unlike arrays
Java Algorithm – Maximum Bipartite Matching – Graph Algorithm – A matching in a Bipartite Graph is a set of the edges chosen in such a way
It is quite easy to visualize this statement since the median which we report will be (k/2)th element and if we take k/2 elements from the left quarter.