Computer science background. Passionate about solving real life problems through algorithms. Intern at GeeksforGeeks. Freelancer.

Dhiman Mayank

In the course, Dhiman has solved problems using Dynamic Programming and also he discussed Fibonacci series, Knapsack, LCS DP.

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE & ESE

Hindi

(Hindi) Dynamic Programming for Beginners

Programming Languages

Algorithms

CS & IT

GATE - CSIT, DSAI & Placements

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

In this lesson, Dhiman has discussed Basics of Dynamic Programming.

Dynamic Programming Intro (in Hindi)

In this lesson, Dhiman has discussed Nth Fibonacci in Linear and Constant Time

Nth Fibonacci in Linear and Constant Time (in Hindi)

In this lesson, Dhiman has discussed the Top down and bottom up approach.

Approaches to Solve Dynamic Programming (in Hindi)

In this lesson, Dhiman has discussed 0/1 Knapsack using DP.

0/1 Knapsack (in Hindi)

In this lesson, Dhiman has discussed Minimum EDIT to convert a string to another.

Minimum Edit (in Hindi)

In this lesson, Dhiman has discussed Longest common substring/subsequence.

LCS DP (in Hindi)

Mentored 81,000+ Students | My Multiple Students secured AIR Below 100 in GATE | Joined top IISc, IITs & NITs | Joined PSUs | 5+ Years Exp.

Sweta Kumari

This course will cover Artificial Neural Networks in just 60 Minutes with full package.

(Hindi) Artificial Neural Networks in 60 Minutes

This course has discussed Sorting Algorithms with Complexities, working and some FAQs. The course will be beneficial for Engineering students and GATE aspirants.

(Hindi) Short Tricks to Remember Complexities of Sorting Algorithms

This course will cover dynamic Programming solution for Matrix Chain Multiplication and Longest Common Subsequence.

(Hindi) Dynamic Programming : MCM & LCS

This course will cover Asymptotic Analysis Of Algorithms with short notes targeted for GATE Aspirants.

(Hindi) Asymptotic Analysis Of Algorithms in 40 Minutes - GATE 2019

This course will cover Searching Algorithms Like Linear , Binary & Interpolation Search for  GATE CS/IT.

(Hindi) Searching Algorithms : Linear , Binary & Interpolation Search - GATE CS/IT

This course will cover 100 Short Tricks To Learn Complexities of Algorithms Easily. This Course is beneficial for  GATE (CS and IT) aspirants.

Lessons

6 lessons • 1h 3m