My turn to give it back to the community.\n\nQuestion 0. Similar strings ("face", "eacf") returns true if only 2 positions in the strings are swapped. Here \'f\' and \'e\' are swapped in the example.\nQuestion 1. Number Of connected components in a Graph,\nQuestion 2 (Behavior interview/ coding). Is there a way to reach (0,0) from a mXn matrix to (m-1,n-1) position and give the path.\nQuestion 3 System Design : Design a Content publishing site with privacy restrictions.\nQuestions 4. https://leetcode.com/problems/simplify-path/\nQuestion 5. n-ary Tree with each node having a boolean flag. Traverse all the nodes with only boolean flag = True. Return the total distance traveled from root to all those nodes.

My turn to give it back to the community.\n\nQuestion 0. Similar strings ("face", "eacf") returns true if only 2 positions in the strings are swapped. Here \'f\