DSA Instructor; Part-Time

Position: DSA Instructor (Part-Time)
Company Description
Zuvy, an initiative of Nav Gurukul, is a digital learning platform designed to empower young women from marginalized communities to achieve their goals. By eliminating financial barriers to quality education, Zuvy addresses the skills gap in the tech industry with innovative Coding Finishing Schools and personalized, interactive learning experiences. Its AI-powered Learning Management System ensures world-class training is accessible, even in areas with limited connectivity.

Zuvy specializes in delivering skills in AI, web development, and machine learning, while also fostering confidence, leadership, and career readiness.

Role Description
The DSA Instructor role at Zuvy is a part-time, remote position for professionals passionate about imparting computer science knowledge to aspiring learners. The instructor will be responsible for delivering engaging lessons on Data Structures and Algorithms (DSA), preparing high-quality learning materials, mentoring students, and evaluating their progress. Additionally, the role includes designing interactive and practical coding exercises, participating in curriculum development, and supporting students in preparing for technical job opportunities.

Requirements
Must have one of the following:
Prior experience teaching technical cohorts or bootcamps, OR
5+ years as a Software Developer with strong DSA fundamentals

Qualifications
Proficiency in Data Structures, Algorithms, and problem-solving techniques

Experience with programming languages such as Python, Java, or C++
Strong teaching, mentoring, and communication skills
Understanding of educational technology and familiarity with online LMS platforms
Experience in software development or technical interview preparation is a plus
Passion for education and empathy for students from diverse backgrounds
Bachelor's degree in Computer Science, Engineering, or related field

The curriculum covers:
Fundamentals:
Linear search, binary search, recursion, backtracking, sorting algorithms
Intermediate:
Two pointers, sliding window, hashmaps, hashsets, stacks, queues
Data Structures:
Linked lists, binary trees, BST, graphs, tries, heaps, segment trees
Advanced Concepts:
Dynamic programming (tabulation, memoization, knapsack, string DP), graph algorithms (DFS, BFS, topological sort, shortest path), greedy algorithms
System Design Foundations: OOPs principles, encapsulation, inheritance, polymorphism, abstraction