Implement the Depth First Search Algorithm in Graph using Simple C/C++
Given a graph represented by G(V, E) where V is the vertices and E represents the edges, we can do a Depth First Search Algorithm (DFS) on any node/vertex. …
Category: c / c++
Checking Subtree of Another Tree using Preorder Traversal or Recursion
Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s …
How to Compute the Day of the Week using C++?
Given a date, return the corresponding day of the week for that date. The input is given as three integers representing the day, month and year respectively. Return the …
Counting Substrings with Only One Distinct Letter with Different Algorithms
Given a string S, return the number of substrings that have only one distinct letter. Example 1: Input: S = “aaaba” Output: 8 Explanation: The substrings with one distinct …
How to Compute the Middle of the Linked List using Fast and Slow Pointer?
Given a non-empty, singly linked list with head node head, return a middle node of linked list. If there are two middle nodes, return the second middle node. Example …