dev.deriveit.org Open in urlscan Pro
76.76.21.98  Public Scan

Form analysis
0 forms found in the DOM

Text Content

DeriveIt
Course
Cheat Sheets
Premium
Log In


DERIVEIT


THE RIGHT WAY TO PREPARE FOR CODING INTERVIEWS.

Premium
DATA STRUCTURES

ALGORITHMS

ADVANCED

Get started


A BETTER WAY TO SOLVE PROBLEMS.


NEETCODE

A treacherous journey through every problem.
Trees
Graphs
Binary Search
Dynamic Programming
class Solution:
    def isSameTree(self, p, q):
        if not p and not q:
            return True
        if p and q and p.val == q.val:
            return self.isSameTree(p.left, q.left) and self.
            isSameTree(p.right, q.right)
        else:
            return False












DERIVEIT

One simple approach - Recursion.
Trees
Graphs
Binary Search
Dynamic Programming
class Solution:
    def isSameTree(self, p, q):
        # base case
        if not p and not q: return True
        if not p or not q:  return False

        # recursion
        return p.val == q.val and isSameTree(p.left, q.
        left) and isSameTree(p.right, q.right)












SIMPLE CATEGORIES.

We know how difficult it can be to juggle all the ideas that go into a coding
interview. That's why we have simple, well-motivated categories that teach you
everything you need to know.
Recursion

Tree Traversals

Graphs

Dynamic Programming

Backtracking

Sorted Data Structures

Data Structure Problems

Single Pass Tricks

Greedy Problems



DEVELOPED AND REVIEWED BY ENGINEERS FROM THESE COOL PLACES.


Get Started


SOLVE PROBLEMS IN THE RIGHT ORDER.

We start with the fundamentals and gradually crank up the difficulty, reaching
very advanced concepts. You'll be solving problems you previously thought were
hard without even realizing it.



DATA STRUCTURES FROM THE GROUND UP.

Want to know where every Data Structure comes from, and when you should use each
one? You're in the right place. We're also home to the well-known cheat sheet,
Every Data Structure on 1 Page.


UNPARALLELED ORGANIZATION.

Each group of problems on DeriveIt is highly related. We don't just lump all the
problems that have a Tree under a "Trees" category. You'll have a crystal clear
picture of exactly what ideas you're practicing in each problem, so that you can
remember things better when interview day rolls around.



BE BIG O READY.

Every solution has a detailed time and space complexity analysis that even
includes the Call Stack. You'll learn unique insights like why recursion usually
takes up O(N) space, and why your time complexity is always ≥\ge≥ your space
complexity.



EVERYTHING YOU NEED.

We cover everything you learn from the famous Blind75 and NC150 problem lists,
and more. Our experts have curated some of the best practice problems you'll
find anywhere.
Get Started


FAQ

Who is DeriveIt for?
DeriveIt is for anyone who's preparing for coding interviews at FAANG and other
tech companies. Ideally you are currently a college student (any year), recent
graduate, or currently working a tech job.
What do we cover in a nutshell?
We cover all the standard material like the B75 and NC150, and more. Here's what
you learn in 3 bullet points.
1. Recursion - the simplest (and easiest) way to solve most problems. 2. Data
Structures from the very basics to the very advanced, and how to use them to
speed up your algorithm. 3. Common tricks that appear in interviews, and how to
approach the standard problems that don't use recursion.
Are we complete?
Yes, DeriveIt is 100% complete. We teach you all the standard content you need
to get a FAANG job.
What programming languages does DeriveIt cover?
We strongly recommend Python in an interview. It's the easiest way to go from
ideas to code, and you can learn it in a weekend using our lessons and Cheat
Sheets. Python is the only language we cover right now.

Terms
Privacy
About
Contact

Copyright © 2024 DeriveIt. All rights reserved.