codeN’
Hey, I’m Nishchal 👋
I’m an SDE-III at Oracle and Ex-Flipkart Engineer, passionate about writing clean code, designing scalable systems, and helping others master the art of problem-solving.
On this channel, you’ll find in-depth tutorials on DSA, System Design, and Core Programming Concepts — all explained in a simple, structured, and practical way.
Whether you’re preparing for FAANG-level interviews, strengthening your logic-building skills, or just want to think like a real engineer, this channel will guide you step by step.
My goal is to help you go beyond rote learning — to actually understand how things work under the hood and build a strong foundation that lasts your entire career.
🚀 The best DSA and System Design videos are on the way — stay tuned!
📩 Business enquiries: [email protected]
L10: Recursive Programs Time complexity calculation | Recursive Tree method | CodeWithNishchal
L9: Recursive Program Time complexity calculation | Back substitution method | CodeWithNishchal
L8: Recursive Program Time complexity calculation | Recurrence Relation | CodeWithNishchal
L7: Time Complexity Measure Functions | Time Complexity | CodeWithNishchal
L6: Iterative Program Time complexity calculation | Part-2 | All unique patterns | CodeWithNishchal
L5: Iterative Program Time complexity calculation | Part-1 | All unique patterns | CodeWithNishchal
L4: Asymptotic Notation | Theta Notation | Time Complexity | CodeWithNishchal
L3: Asymptotic Notation | Big Omega Notation | Time Complexity | CodeWithNishchal
L2: Asymptotic Notation | Big O Notation | Time Complexity | CodeWithNishchal
L:1 Time Complexity | Introduction to Time Complexity | CodeWithNishchal