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 - Iconic Pro

Hindi

(Hindi) Dynamic Programming for Beginners

Programming Languages

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

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)

III year UG. Information Science Student. Love teaching. 

Sanjetha K S

The various problems solved using the branch and bound method

Branch and Bound

B.tech graduate in computer science 
Ex. Banker (officer in bank of baroda )
Presently software developer (Web, android, desktop application

Nidhi Gupta

in this we discuss about  what is stack and  queue , operation on stack and queue and its algorithm, representation of stack and queue

(Hindi) Stack and Queue

Currently pursuing  Btech in CSE from GGSIPU. Love coding, teaching and participating in many coding competitions. 

Nipun Vats

Covering the first topic "Asymptomatic Analysis of Algorithms" of the chapter "algorithms"

(Hindi) Asymptomatic Analysis of Algorithms for GATE/IES

Jyoti Jha

This course is for those students who are preparing for GATE and BSc in computer .

(Hindi) Data Structures and Algorithms: GATE

AWS Cloud Support Associate(Networking); B.Tech-IT from Maharaja Surajmal Institute of Technology.

Payal Gupta

Learning Sorting is a fundamental step in learning Algorithms. Here's your chance to learn how to perform: Introduction to Sorting Linear Search Binary Search Bubble Sort Insertion Sort Selection Sort Heap Sort Bucket Sort Radix Sort Count Sort Quick Sort

Sorting: GATE (CS and IT)

🌟 Bachelor’s degree in Computer engineering 🌟 CGPA 9.14 🌟 GATE qualified 🌟 Unacademy Verified Educator 🌟 Software engineer 🌟 CS Passionate 🌟

Nisha Sajnani

Understand Sorting algorithms using examples, find it's worst and best case complexity. Additionally we'll cover PYQs on Sorting

Lessons

6 lessons • 1h 3m

Invalid Date

NaN

Dynamic Programming Intro (in Hindi)

Invalid Date

NaN

Nth Fibonacci in Linear and Constant Time (in Hindi)

Invalid Date

NaN

Approaches to Solve Dynamic Programming (in Hindi)

Invalid Date

NaN

0/1 Knapsack (in Hindi)

Invalid Date

NaN

Minimum Edit (in Hindi)

Invalid Date

NaN

LCS DP (in Hindi)