## Memory efficient Trie Implementation using Map | Insert, Search and Delete

Implement Trie using map in C++.

Coding made easy

Implement Trie using map in C++.

Implement insert, search and delete operations on Trie Data structure. Assume that input consist of lowercase letters a-z.

Given a list of strings where no string is substring of another, find a shortest string that contains each string in given list as a substring.

Given a set of tasks with deadlines and total profit earned on completion of a task, find maximum profit earned by executing the tasks within the specified deadlines. Assume any task will take one unit of time to execute and any task can’t execute beyond its deadline. Also, only one task can be executed at …

Given a set S of activities with start time and finish time of each activity, find the maximum number of activities that can be performed by a single person assuming that a person can only work on a single activity at a time.

Given a set of vertices V in a weighted graph where its edge weights w(u, v) can be negative, find the shortest-path weights d(s, v) from every source s for all vertices v present in the graph. If the graph contains negative-weight cycle, report it.

Given a source vertex s from set of vertices V in a weighted graph where its edge weights w(u, v) can be negative, find the shortest-path weights d(s, v) from given source s for all vertices v present in the graph. If the graph contains negative-weight cycle, report it.

Given a source vertex s from set of vertices V in a weighted graph where all its edge weights w(u, v) are non-negative, find the shortest-path weights d(s, v) from given source s for all vertices v present in the graph.

Given a undirected, connected and weighted graph, construct a minimum spanning tree out of it.

Given an connected undirected graph, find if it contains any cycle or not. For example, Below graph contains a cycle 8-9-11-12-8

Given a directed graph, check if it is strongly connected or not. A directed graphs is said to be strongly connected if every vertex is reachable from every other vertex.