Goal

Competitive Programming

Show only

Special classes

Filter by

All courses

Ongoing

Upcoming

Completed

Language

English

Topic

All topics

Miscellaneous

Advanced

Intermediate

In this class, I will discuss how fenwick trees work and how you should be thinking when solving a problem using segment trees. I will also also be discussing some nice applications of this data structure.

Fenwick trees made easy - Advanced DSA

Segment Trees & BIT

In this class, I will discuss how segment trees work and how you should be thinking when solving a problem using segment trees. I will also also be discussing some nice applications of this data structure.

Segment trees made easy - Advanced DSA

Segment Trees

In this session, I will take up any questions/doubts from students regarding interview preparation. I bring in the experience of taking multiple coding interviews at Google and being a competitive coder myself.

AMA on Final Plan for Your Interview Preparation in 2021

Interview Preparation

In this class we shall be discussing graph algorithms like DFS, BFS, Shortest paths(Djikstra, BellmanFord, Floyd Warshall), Topological sort, Spanning trees(Prim) that are useful in interviews.

Graph algorithms For Interview Prep

Interview Preparedness

In this class, I will be discussing spanning tree algorithms and their applications. From my experience of taking many coding interviews at Google, I will also be sharing common mistakes that candidates do and how to avoid them.

Graphs for Coding interviews(Part 4) - Spanning trees

Graph Algorithms

In this class, I will be discussing some nice applications of BFS/DFS and Djikstra's algorithm. From my experience of taking many coding interviews at Google, I will also be sharing common mistakes that candidates do and how to avoid them.

Graphs for Coding interviews(Part 3)

In this class, I will be discussing Dijkstra's algorithm and applications of it. From my experience of taking many coding interviews at Google, I will also be sharing common mistakes that candidates do and how to avoid them.

Graphs for Coding interviews(Part 2) - Djikstra's algorithm

In this class, I will be discussing graph basics and implementation details. From my experience of taking many coding interviews at Google, I will also be sharing common mistakes that candidates do and how to avoid them.

Graphs for Coding interviews (Part 1)

In this class, I will be discussing dynamic programming problems over strings. From my experience of taking many coding interviews at Google, I will also be sharing common mistakes that candidate

Dynamic Programming for Coding interviews (Part 3)

Advanced Dynamic Programming

In this class, I will be discussing slightly harder problems than my Part-1 that are commonly asked in interviews. From my experience of taking many coding interviews at Google, I will also be sharing common mistakes that candidates do that you can avoid during an interview.

Dynamic Programming for Coding interviews (Part 2)

Dynamic Programming & Recursion

In this class, I will be discussing basic dynamic programming problems and will move to more advanced problems in further parts. From my experience of taking many coding interviews at Google, I will also be sharing common mistakes that candidates do that you can avoid during an interview.

Dynamic Programming for Coding interviews (Part 1)

I will be discussing slightly advanced binary search questions and binary search over answer in this session. I will also be sharing my experience on how to handle these questions in an actual interview.

Venkateswara Rao Chippada

Ex-Educator

Fenwick trees made easy - Advanced DSA

Segment trees made easy - Advanced DSA

AMA on Final Plan for Your Interview Preparation in 2021

Graph algorithms For Interview Prep

Graphs for Coding interviews(Part 4) - Spanning trees

Graphs for Coding interviews(Part 3)

Graphs for Coding interviews(Part 2) - Djikstra's algorithm

Graphs for Coding interviews (Part 1)

Dynamic Programming for Coding interviews (Part 3)

Dynamic Programming for Coding interviews (Part 2)

Dynamic Programming for Coding interviews (Part 1)

Binary Search for Coding interviews(Part 2)

Venkateswara Rao Chippada

Ex-Educator .css-1icgrfo-StyledTypography{font-weight:600;text-transform:initial;}.css-kc26im-StyledTypography{margin:0;color:var(--color-text-secondary);font-weight:600;text-transform:initial;}

Fenwick trees made easy - Advanced DSA

Segment trees made easy - Advanced DSA

AMA on Final Plan for Your Interview Preparation in 2021

Graph algorithms For Interview Prep

Graphs for Coding interviews(Part 4) - Spanning trees

Graphs for Coding interviews(Part 3)

Graphs for Coding interviews(Part 2) - Djikstra's algorithm

Graphs for Coding interviews (Part 1)

Dynamic Programming for Coding interviews (Part 3)

Dynamic Programming for Coding interviews (Part 2)

Dynamic Programming for Coding interviews (Part 1)

Binary Search for Coding interviews(Part 2)

Ex-Educator