technifyed

Overview

Check out our Udemy courses at https://hitesh.ai

Humne socha recursion b thoda discuss kr lete h, free baithe the to kuch charcha kr li recursion pe.

Welcome to chai aur code, a coding/programming dedicated channel in Hindi language. Now you can learn best of programming concepts with industry standard practical guide in Hindi language.

00:00:00 Start of the recursion

00:02:32 Foundation of recursion

00:41:58 Three foundation of problem of recursion

01:15:45 Count good number leetcode

01:52:50 Generate Valid Parenthesis leetcode

02:21:52 Letter Combination of a Phone number Leetcode

02:34:54 Prune approach - Combination sum Leetcode

All source code is available at my Github account:

https://github.com/hiteshchoudhary

Our Open-Source Project is here: https://freeapi.app

Join me at whatsapp: https://hitesh.ai/whatsapp

for community discord: https://hitesh.ai/discord

Instagram pe yaha paaye jaate h:

https://www.instagram.com/hiteshchoudharyofficial/

HTML video series: https://www.youtube.com/watch?v=XmLOwJHFHf0&list=PLu71SKxNbfoDBNF5s-WH6aLbthSEIMhMI

Complete javascript series: https://www.youtube.com/watch?v=Hr5iLG7sUa0&list=PLu71SKxNbfoBuX3f4EOACle2y-tRC5Q37

Complete Reactjs series: https://www.youtube.com/watch?v=vz1RlUyrc3w&list=PLu71SKxNbfoDqgPchmvIsL4hTnJIrtige

Javascript and react interview series: https://www.youtube.com/watch?v=1wqCyz7XrV4&list=PLu71SKxNbfoCy_MsA98SBfvUKF5eQit6L

Backend development with Javascript: https://www.youtube.com/watch?v=EH3vGeqeIAo&list=PLu71SKxNbfoBGh_8p_NS-ZAh6v7HhYqHW

Python Series: https://www.youtube.com/watch?v=Ca5DLSDfPec&list=PLu71SKxNbfoBsMugTFALhdLlZ5VOqCg2s

Chapters 7

  1. 00:00:00Start of the recursion
  2. 00:02:32Foundation of recursion
  3. 00:41:58Three foundation of problem of recursion
  4. 01:15:45Count good number leetcode
  5. 01:52:50Generate Valid Parenthesis leetcode
  6. 02:21:52Letter Combination of a Phone number Leetcode
  7. 02:34:54Prune approach - Combination sum Leetcode

Advantages and disadvantages

Advantages

  • Free, one long video that covers a topic end to end.
  • Use the chapters to jump to what you need.
  • Taught in Hindi (or Hinglish), which many students find easier to follow.
  • Made for Indian students, with placement and exam context.
  • Completely free.
  • Self-paced: start any time.
  • A clear syllabus (7 parts) you can see before you start.
  • Start watching right away, no sign-up.

Disadvantages

  • No exercises or certificate: code along to make it stick.
  • Less depth than a university course on some topics.
  • No certificate.
  • No graded assignments or feedback.

Some points apply to every course of this kind; see how we rank.

Free

  • Free: Watch on YouTube, no account needed.
  • Certificate: None. Code or take notes along to make it stick.

Chai aur Code is in Tier 3: good universities, respected companies, nonprofits and well-known teachers of our institution ranking (76/100).

Similar courses

Compare these

Massachusetts Institute of Technology · YouTube

MIT 6.006 Introduction to Algorithms, Fall 2011

This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performa…

Free video47 videos, 42 hours

Massachusetts Institute of Technology · YouTube

MIT 6.006 Introduction to Algorithms, Spring 2020

Instructor: Prof. Erik Demaine, Dr. Jason Ku, Prof. Justin Solomon View the complete course: https://ocw.mit.edu/6-006S20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY This course is an introduction to mathematical modeling of computational problems, as…

Free video32 videos, 35 hours

Massachusetts Institute of Technology · YouTube

MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503),

This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow;…

Free video23 videos, 30 hours

Massachusetts Institute of Technology · YouTube

MIT 6.046J Design and Analysis of Algorithms, Spring 2015

View the complete course: http://ocw.mit.edu/6-046JS15 Instructors: Erik Demaine, Srinivas Devadas, Nancy Ann Lynch 6.046 introduces students to the design of computer algorithms, as well as analysis of sophisticated algorithms. License: Creative Commons BY-NC-SA More information at http://ocw.mit.…

Free video34 videos, 39 hours

Massachusetts Institute of Technology · YouTube

MIT 6.851 Advanced Data Structures, Spring 2012

View the complete course: http://ocw.mit.edu/6-851S12 Instructor: Erik Demaine Videos of 6.851 Lectures Spring 2012 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Free video22 videos, 30 hours

Harvard University · edX

Fundamentals of TinyML

4.567 ratings

Focusing on the basics of machine learning and embedded systems, such as smartphones, this course will introduce you to the “language” of TinyML.

Free to audit5 weeks, 2 - 4 hours per week

Enter your email and the official page opens. Phone is optional.