Data Structures and Algorithms (DSA) Tutor Job — Remote, Freelance, Rs 500-1,500/hr

Role	Online Data Structures and Algorithms (DSA) Tutor (Freelance)
Pay	Rs 500 – Rs 1,500 per hour
Type	Freelance, part-time, work from home
Location	Remote. India-based tutors preferred; global applicants welcome
Hours	Flexible, mainly 5 PM – 9 AM IST
Students	Mostly USA, Gulf, Europe, Australia
Apply via	Application form on the MEB tutoring jobs hub

The Data Structures and Algorithms (DSA) tutor job at MEB involves running 1:1 live online sessions and providing homework guidance within those sessions, mainly for students in the USA and the Gulf. Most students in this role are enrolled in undergraduate Computer Science or Software Engineering programmes where DSA is examined rigorously and coded solutions are submitted and auto-graded. Sessions typically require you to trace through code, draw memory diagrams on a shared digital whiteboard, and walk the student through the logic of a solution without supplying the answer for them. A pen tablet is not optional in this role — freehand diagrams of trees, graphs, and stack frames are a routine part of every session.

What the role involves

Running 1:1 live sessions via a shared digital whiteboard, covering everything from asymptotic analysis to advanced graph algorithms, depending on where the student is in their syllabus.
Guiding students through their own problem sets by explaining the reasoning behind each step — the choice of data structure, the loop invariant, the recurrence — rather than writing the solution for them.
Helping students interpret compiler errors, trace through failing test cases, and understand why a correct algorithm can still produce wrong output if the implementation is flawed.
Explaining the same concept at multiple levels of abstraction: first in plain English, then as a recurrence or pseudocode, then in the language the student is using (typically Java, Python, or C++).
Keeping sessions moving under time pressure. Students often arrive with a deadline the same night, so the explanation has to be fast, accurate, and sequenced correctly the first time.

Topics you will be expected to teach

Arrays, strings, and in-place manipulation techniques
Linked lists: singly, doubly, and circular; pointer manipulation and edge cases
Stacks and queues: array-backed and linked implementations, monotonic stacks
Recursion and backtracking: base cases, call-stack analysis, pruning strategies
Sorting algorithms: comparison-based sorts (merge, quick, heap) and non-comparison sorts (counting, radix)
Binary search and its generalisations: search on answer spaces, rotated arrays
Trees: binary trees, binary search trees, AVL trees, segment trees, and traversal algorithms
Heaps and priority queues: heap property, heapify, and heap-based algorithm design
Hash tables: collision resolution, load factor, and amortised complexity analysis
Graphs: representations (adjacency list and matrix), BFS, DFS, topological sort, shortest paths (Dijkstra, Bellman-Ford), and minimum spanning trees (Kruskal, Prim)
Dynamic programming: memoisation, tabulation, state-space design, and classic problem patterns (0/1 knapsack, LCS, LIS, coin change)
Greedy algorithms: problem formulation and proof of optimality
Asymptotic analysis: Big-O, Big-Theta, Big-Omega, recurrence relations, and the Master Theorem

A problem you should be able to solve

You are given an unsorted array of n integers and must find the length of the longest increasing subsequence (LIS) in O(n log n) time and O(n) space. Describe the data structure you maintain, explain precisely what each element of that structure represents at any point during the scan, and derive the time complexity from first principles. If you also need to reconstruct the actual subsequence (not just its length), state what additional bookkeeping is required and why the time complexity does not change.

If you cannot set this up and solve it in under five minutes without looking anything up, this role is not the right fit.

Who we are looking for

Subject mastery

You need to be fluent across the full DSA syllabus at the undergraduate level, including algorithm design paradigms (divide and conquer, dynamic programming, greedy), graph theory as it applies to algorithm courses, and the formal analysis of time and space complexity. Familiarity with competitive programming patterns is an advantage, but what matters more is the ability to explain clearly why a particular approach works — not just that it does. Students will ask you to justify every decision, and “because it’s the standard approach” is not an acceptable answer in a live session.

Speed and accuracy under deadline

DSA sessions at MEB routinely happen late at night when a student has a programming assignment or problem set due within hours. You must be able to read an unfamiliar problem, identify the relevant algorithm or data structure, and begin explaining the approach within two or three minutes. Errors made in a session under pressure — a wrong recurrence, an off-by-one in a binary search, a misconception about a graph traversal — are damaging and hard to undo. Accuracy on the first pass is not negotiable.

Education and background

A degree from IIT, IISc, ISI, NIT, or an equivalent institution in Computer Science, Computer Engineering, or a closely related field is the typical background we look for. Candidates from other institutions are considered if they can demonstrate exceptional depth: sustained competitive programming performance, published algorithmic work, or a documented record of high-quality DSA tutoring. The degree requirement can be set aside for genuinely exceptional candidates; the subject-depth requirement cannot.

Setup, availability and communication

You need a reliable laptop, a stable broadband connection, a working camera and microphone, and a pen tablet. Most students are in the USA or the Gulf, so the work falls mainly between 5 PM and 9 AM IST — you should be comfortable working in that window, typically one or two nights a week depending on what is available. Your English must be clear and precise: students are almost entirely non-Indian, and the ability to explain a complex algorithm in plain, unambiguous English is as important as knowing the algorithm itself.

Do not apply if

You need a guaranteed monthly income or a minimum number of hours per week.
You cannot work between 5 PM and 9 AM IST on short notice.
You do not own a pen tablet and are not willing to buy one before onboarding.
You need to look up time complexities, recurrences, or algorithm logic mid-session.
You are not comfortable teaching in C++, Java, and Python interchangeably, since students come with different language requirements and you must follow theirs.

What this job is not

This is not a salaried position. MEB does not offer a fixed monthly income, a retainer, or a guaranteed number of sessions per week. The volume of work available varies, and there will be weeks with no work at all.

This is not a route to completing students’ graded work on their behalf. The tutor’s role is to help the student understand and solve the problem themselves. Any tutor who writes, submits, or directly supplies solutions to graded assignments will be removed from the platform immediately.

This is not a fixed-shift job. You are a verified freelancer who accepts or declines each assignment as it comes. MEB offers work; it does not schedule shifts.

Pay and payment terms

Pay is between Rs 500 and Rs 1,500 per hour. The rate for a given session depends on the level and complexity of the material, the timing of the request, and the urgency of the deadline. The fee is agreed before any session begins. You may accept or decline any assignment; there is no penalty for declining.

Payment is made on time. There is no minimum threshold that must be reached before payment is released. Work is freelance and part-time; there is no fixed monthly income and no retainer.

How work is assigned at MEB

Work arrives job-by-job as student requests come in. Assignments are distributed fairly among tutors who are available and qualified for the specific request. There is no queue-jumping and no preferential allocation based on anything other than subject fit and availability.

Global applicants are welcome, though pay rates are calibrated to India-level costs and will not be adjusted upward for applicants in higher-cost countries.

Academic integrity rules for tutors

MEB’s model is built on guiding students to understand material and work through problems themselves. Tutors must not complete graded assignments, problem sets, or exams on a student’s behalf. Tutors must not share personal contact details with students or agree to fees directly with them outside the MEB platform; doing so ends the engagement without appeal.

Every tutor is expected to read and follow the full policy before onboarding: MEB Academic Integrity Policy.

Selection process

Submit the application form on the tutoring jobs hub.
Shortlisting based on subject depth, educational background, and the quality of the application.
A subject test covering DSA problems at undergraduate difficulty, followed by a short mock session on a shared digital whiteboard using a pen tablet.
Onboarding, after which work is offered job-by-job as it arises.

For questions about the application, contact us on WhatsApp at +91 8971 383660 or by email at meb@myengineeringbuddy.com.

Questions from applicants

Do I need to be available every night?: No fixed nightly availability is required. Most DSA sessions at MEB fall between 5 PM and 9 AM IST because that is when students in the USA and Gulf are active. You are free to indicate your preferred availability window, and assignments are offered within that window. You may decline any assignment that does not suit you.
Does MEB require me to know a specific programming language for DSA sessions?: DSA tutors at MEB need to be comfortable working in at least Python, Java, and C++. Students arrive with their own language requirements, and the tutor is expected to follow the student’s language rather than the other way around. Fluency in one language and superficial familiarity with the others is not sufficient for this role.
Is there a minimum number of sessions I must complete per month to remain active?: There is no monthly session minimum. If no work is available in a given period, or if you choose not to accept any assignments, your position as a verified freelancer is not affected. Work is offered as it arises, and there is no requirement to maintain a minimum throughput.
What does the subject test involve?: The test presents DSA problems at undergraduate level — problems of the kind that MEB’s students actually bring to sessions. You will be expected to solve them correctly, explain your reasoning clearly, and demonstrate that you can trace through logic and draw diagrams on a digital whiteboard. The mock session that follows simulates a real student interaction. Both are assessed on accuracy, speed, and the clarity of the explanation.
Can freshers with no tutoring experience apply for this DSA tutor job?: Freshers are eligible if their subject depth is genuinely exceptional. A strong academic background from a top institution, combined with competitive programming performance or published algorithmic work, can offset the absence of formal tutoring experience. Applications that demonstrate subject depth clearly — through solved problems, a competitive programming profile, or a portfolio of relevant work — will be given full consideration.