Java Algorithm – Implement two stacks in an array – Data Structure – Create a data structure twoStacks that represents two stacks.
Wikitechy Founder, Author, International Speaker, and Job Consultant. My role as the CEO of Wikitechy, I help businesses build their next generation digital platforms and help with their product innovation and growth strategy. I'm a frequent speaker at tech conferences and events.
Python Programming – Write a function to get Nth node in a Linked List – Linked List – Write a GetNth() function that takes a linked list and an integer
Java Programming – Write a function to get Nth node in a Linked List – Linked List – Write a GetNth() function that takes a linked list and an integer index
C Programming – Write a function to get Nth node in a Linked List – Linked List – Write a GetNth() function that takes a linked list and an integer index
Python Algorithm – Implement two stacks in an array – Data Structure – Create a data structure twoStacks that represents two stacks.
Handshaking Lemma and Interesting Tree Properties – Tree – Handshaking lemma is about undirected graph. In every finite undirected graph number of vertices
Priority Queue – Priority Queue is an extension of queue with following properties. Every item has a priority associated with it.
Binary Tree Properties – Binary Tree – Here level is number of nodes on path from root to the node (including root and node). Level of root is 1.
Python Algorithm – Swap nodes in a linked list without swapping data – Linked List – Given a linked list and two keys in it, swap nodes for two given keys
Cpp Algorithm – Implement two stacks in an array – Data Structure – Create a data structure twoStacks that represents two stacks.