Graph = {
"Me": ["DP"],
"DP": ["More DP"],
"More DP": ["Hard DP"],
"Hard DP": ["Existential Crisis"],
"Existential Crisis": []
}
visited = set()
def dfs(node):
if node in visited:
return
visited.add(node)
print(f"Visiting: {node}")
for nei in graph[node]:
dfs(nei)
dfs("Me")
I am an Android developer with strong problem-solving skills and a deep interest in Data Structures and Algorithms. Along with building real-world applications, I enjoy breaking down complex technical concepts into simple and practical explanations.
As a tutor, my focus is not just on theory but on helping students understand how DSA is actually used in interviews and real engineering problems. I believe in a practical learning approach where students solve real interview questions, learn problem-solving patterns, understand optimization techniques, and build strong logical thinking rather than memorizing solutions.
I aim to create an interactive and beginner-friendly learning environment where students can confidently approach coding interviews and improve their analytical thinking step by step.
Experience
-
SENIOR SOFTWARE ENGINEER (Jun, 2022
–Present) at Senior software engineer in a product based startup + partime tutor
Fee details
₹1,000–2,000/hour
(US$10.53–21.05/hour)
Based on the candidate current knowledge on the subject the fees may vary