My initial days in Hyderabad| VLOG| Corporate life begins 🖥️🧑💻 Harshit jain 4,29 тыс. подписчиков Скачать
Best Shots of Our Funny Videos | When we were in First Year at NITA | Recompile of funny scenes Скачать
Linked List Cycle & Linked List Cycle ll Leetcode problems| Floyd Cycle detection algorithm| part 3 Скачать
FREE CRASH COURSE ON C++ STL| Udemy | 10000+ enrollments from 130+ countries| Hurry up| Promo video Скачать
NIT Agartala | Location, Fees, Placement, Facilities,Clubs| complete details 2020| Harshit[NITA] Скачать
Associative Container-Set,unordered set,map and Hashmap| implementation| C++ code| Harshit[NITA] Скачать
Comparison between Shortest Path Algorithms| Which one is better?| Time complexity| Harshit[NITA] Скачать
Floyd-warshall algorithm| All pair shortest path algorithm| detailed explanation| Harshit[NITA] Скачать
Bellman Ford Algorithm| Single source shortest path Algorithm| detailed explanation| Harshit[NITA] Скачать
Kruskal's Algorithm MST | Disjoint set data structure|detailed explanation| O(e loge)|Harshit[NITA] Скачать
1.3 Union by Rank &Find using Path compression| Disjoint set datastructure| optimized implementation Скачать
1.2 Disjoint set in C++|Simple implementation| find and union functions| Code C++| Harshit [NITA] Скачать
Course Scheduler problem| Task scheduler| Kahn's algorithm| topological sort| code C++| Harshit jain Скачать
Shortest path in unweighted graph from source to all vertices| BFS| Code | detailed explanation | Скачать
Strongly Connected Components| KOSARAJU Algorithm| Directed graph| DFS |Graph | Harshit [ NITA] Скачать
Topological Sorting| job scheduling| Graph| DFS with stack | Recursive tree| code explanation Скачать
Graph representation | adjacency list and Matrix| differences| complexity| Harshit Jain[NITA] Скачать
Backtracking |part 3|Generalized code| recursive flow| detailed explanation|Harshit jain[NITA] Скачать
Errors and Exception handling |Raise your own exception| complie time, runtime and logical errors | Скачать
Dictionary in Python| keys() | values() | del()|deep and shallow copy| conversion to list| Harshit Скачать
List |Tuple| Set| Python |built-in functions| reverse() sort() count() union() | Harshit jain[NITA] Скачать
Operators+ Number system in python| Assignment, Relationship, Arithmetic, bitwise, logical operator Скачать
Which programming language to begin with?|Detailed explanation|C, C++, Java or python|Harshit|NITA Скачать
Csab business rules 2019|online reporting|Affidavit for participating in csab|options after round 1| Скачать
🚫|Ragging in college life|It still happens???? |How to tackle it in college|Harshit jain[NITA] Скачать
Josaa+csab 2019|must watch it |clear all your doubts regarding counselling|Part 1|Harshit [NITA] Скачать
Josaa seat acceptance fee +refund system |Csab participation fee|JOSAA and CSAB| 2019|Harshit jain Скачать
Dinosaur ek khauf |Types of Movie directors|Funny Video|Harshit jain|Director Funny and comedy Скачать
No seats in 1st round |What to do after 1st round of josaa counselling |josaa 2019|Harshit jain Скачать
Provisional Seat acceptance|Reporting center|seat acceptance fee|Dual reporting|Josaa 2019|Harshit Скачать
Registration procedure &seat acceptance |csab info |Special round|2019|About Csab|Harshit jain Скачать
Breaking news regarding josaa counselling|20th June,2019||freeze option |EWS no of seats reserved | Скачать
Csab special round 2019 based on 2018|opening and closing rank|All Nits|spot round|Harshit jain Скачать
IIITS between 40 k to 1lac||closing rank category wise|low rank in jee mains 2019|Harshit jain Скачать
Admission in NIT colleges at low rank |2019|closing rank of Nits|genral,obc and sc st|Harshit jain Скачать
Should you take drop for IIT-JEE|Reasons of failure,Drop|jee aspirants|Harshit and Arun|Nit Agartala Скачать
Relativistic addition of velocities|Velocity addition theorem|part -6| theory of relativity|Harshit Скачать
Schordinger's theory|part 1|intro,wave funtion,probability density,superposition|Harshit jain Скачать
LGBT Section 377|the rainbow act|Team Nazaria|Nukkad natak|NIT agartala|prize winning act|Moksha Скачать
Statistical mechanics|intro|phase space|no of quantum states|engineering physics|Harshit jain Скачать
Semiconductor physics|intro|intrinsic and extrinsic|N type and p type semiconductors |Harshit jain Скачать
![NIT Agartala | Location, Fees, Placement, Facilities,Clubs| complete details 2020| Harshit[NITA]](http://i.ytimg.com/vi/x5Y9kRx_nt4/mqdefault.jpg)
![Associative Container-Set,unordered set,map and Hashmap| implementation| C++ code| Harshit[NITA]](http://i.ytimg.com/vi/ShgEAm-bcm8/mqdefault.jpg)
![Open addressing| Linear and Quadratic Probing| Hashing| Harshit jain[NITA]](http://i.ytimg.com/vi/DBIICDmbMWI/mqdefault.jpg)
![Linear chaining | Collision resolution Technique| Hashing| Harshit jain[NITA]](http://i.ytimg.com/vi/0lInqhCVCjg/mqdefault.jpg)
![Hashing data structure|introduction|detailed explanation|Harshit jain[NITA]](http://i.ytimg.com/vi/XlkqSfOEuHc/mqdefault.jpg)
![Bipartite Graph| properties| 2-coloring| Harshit jain[NITA]](http://i.ytimg.com/vi/nXYy_XZaWo8/mqdefault.jpg)
![Transitive closure of graph |Intuition| Reachability Matrix| Harshit[NITA]](http://i.ytimg.com/vi/g1i9mP5cxJE/mqdefault.jpg)
![Comparison between Shortest Path Algorithms| Which one is better?| Time complexity| Harshit[NITA]](http://i.ytimg.com/vi/LY_MWRKfBAc/mqdefault.jpg)
![Johnson's Algorithm| All pair shortest path algorithm| Harshit jain[NITA]](http://i.ytimg.com/vi/wCjEP8TYi-E/mqdefault.jpg)
![Floyd-warshall algorithm| All pair shortest path algorithm| detailed explanation| Harshit[NITA]](http://i.ytimg.com/vi/94iss9jlNJc/mqdefault.jpg)
![Bellman Ford Algorithm| Single source shortest path Algorithm| detailed explanation| Harshit[NITA]](http://i.ytimg.com/vi/HavyQB4UQYM/mqdefault.jpg)
![DijsKtra's Algorithm | Single source shortes path| Detailed explanation| Harshit jain[NITA]](http://i.ytimg.com/vi/MJoPoXnQ_eA/mqdefault.jpg)
![Kruskal's Algorithm MST | Disjoint set data structure|detailed explanation| O(e loge)|Harshit[NITA]](http://i.ytimg.com/vi/x3PXJv7Lx0c/mqdefault.jpg)
![1.2 Disjoint set in C++|Simple implementation| find and union functions| Code C++| Harshit [NITA]](http://i.ytimg.com/vi/o3CL64S0LtA/mqdefault.jpg)
![1.1 Disjoint set data Structure| intuition| find and merge| Harshit jain[NITA]](http://i.ytimg.com/vi/Ln9HZKvXXrs/mqdefault.jpg)
![Prims algorithm| Minimum cost spanning tree| priority_queue|explanation|Harshit[NITA]](http://i.ytimg.com/vi/g97G5NaWHsw/mqdefault.jpg)
![Spanning Tree| Minimum cost spanning tree| Harshit jain[NITA]](http://i.ytimg.com/vi/qXVnQ8EY0Is/mqdefault.jpg)
![Bridges in Graph| critical connections in network problem| Code |C++| Harshit [NITA]](http://i.ytimg.com/vi/Fu4ZgYLiYYM/mqdefault.jpg)
![Articulation point| overview| Graph| dfs|Harshit jain[NITA]](http://i.ytimg.com/vi/XVuTrjg2QQg/mqdefault.jpg)
![Types of Edges in Dfs tree| Graph| Detailed explanation| Harshit jain[NITA]](http://i.ytimg.com/vi/xBsIZyykLRM/mqdefault.jpg)
![Clone Graph| Bfs+ map | explanation| C++ Code| Harshit jain[NITA]](http://i.ytimg.com/vi/ELxEPpogZ1Q/mqdefault.jpg)
![Kahn's algorithm | Topological sort| Cycle detection| Bfs| Graph| Harshit jain[NITA]](http://i.ytimg.com/vi/RKBF0P7ezCg/mqdefault.jpg)
![Rotten orange Code C++| Bfs|Graph|Harshit jain[NITA]](http://i.ytimg.com/vi/sBplLqDDRxU/mqdefault.jpg)
![Rotten orange| Bfs| explanation| Harshit jain[NITA]](http://i.ytimg.com/vi/2OqadHlARgU/mqdefault.jpg)
![Breadth First search|Bfs code explanation|Graph traversal |queue|Harshit jain[NITA]](http://i.ytimg.com/vi/_llHMo8SCfI/mqdefault.jpg)
![Applications of Depth first traversal| DFS| Graph| Harshit jain [NITA]](http://i.ytimg.com/vi/MMr_NnLMuKs/mqdefault.jpg)
![Strongly Connected Components| KOSARAJU Algorithm| Directed graph| DFS |Graph | Harshit [ NITA]](http://i.ytimg.com/vi/JdC69-dwEtU/mqdefault.jpg)
![Path Finding | DFS | Recursive tree| code C++| Graph| Harshit jain[NITA]](http://i.ytimg.com/vi/epXFq3KIvOA/mqdefault.jpg)
![Cycle detection in Directed Graph| DFS| Recursive tree | Harshit jain[ NITA]](http://i.ytimg.com/vi/Z2f61IBQy_c/mqdefault.jpg)
![Cycle detection undirected graph| DFS | Recursive tree| Code C++| Harshit jain[NITA]](http://i.ytimg.com/vi/1E0QbJ9cC9k/mqdefault.jpg)
![Flood fill algorithm Code C++| Dfs| Harshit jain[NITA]](http://i.ytimg.com/vi/1i8Ic_oly5Q/mqdefault.jpg)
![Flood Fill Algorithm | Dfs | recursive tree | detailed explanation| Harshit jain[NITA]](http://i.ytimg.com/vi/hipUa0NfUPc/mqdefault.jpg)
![Number of Islands| Code C++| Dfs| Harshit Jain[NITA]](http://i.ytimg.com/vi/V3yZVE9z9G4/mqdefault.jpg)
![Number of ISLANDS 🏝| DFS recursive tree |Detailed explanation| Graph| Harshit jain[NITA]](http://i.ytimg.com/vi/nfuMXc1Rrso/mqdefault.jpg)
![Print DFS of undirected, directed and disconnected graph | Code | C++ | Harshit Jain[NITA]](http://i.ytimg.com/vi/GM53DmbLwTw/mqdefault.jpg)
![1.2 Dfs tree | depth first traverse| Graph |Harshit jain[ NITA]](http://i.ytimg.com/vi/Z-seKD8XL10/mqdefault.jpg)
![1.1 Depth First search| DFS| stack|Graph| Harshit jain[NITA]](http://i.ytimg.com/vi/IwecrTGoAdc/mqdefault.jpg)
![Adjacency Matrix representation| Graph| Code |C++|Harshit jain[NITA]](http://i.ytimg.com/vi/YJ7SyFATWgY/mqdefault.jpg)
![Adjacency list representation| Graph| code| detailed explanation|C++|Harshit jain[NITA]](http://i.ytimg.com/vi/CF8sq3M-tgM/mqdefault.jpg)
![Graph representation | adjacency list and Matrix| differences| complexity| Harshit Jain[NITA]](http://i.ytimg.com/vi/ho1rHdkcIoQ/mqdefault.jpg)
![Graph Data structures|basic terms| part 1 | Harshit Jain [NITA]](http://i.ytimg.com/vi/PX_IlkSYmaQ/mqdefault.jpg)
![m coloring problem| Recursive tree| Backtracking| Logic| Harshit jain[NITA]](http://i.ytimg.com/vi/613C16SrnUw/mqdefault.jpg)
![Print all subsets| Backtracking| recursive tree| CODE|Harshit jain[NITA]](http://i.ytimg.com/vi/z8efUCGa8Xk/mqdefault.jpg)
![Combination Sum -I | Backtracking | recursion| explanation| Harshit jain[NITA]](http://i.ytimg.com/vi/LxOncNHqMFs/mqdefault.jpg)
![Knight Tour| code|explanation |Backtracking| Algorithm| Harshit jain[NITA]](http://i.ytimg.com/vi/uhxE2Uy_GYE/mqdefault.jpg)
![3.Knight's Tour | Backtracking | recursive flow| generalized code|Harshit jain[NITA]](http://i.ytimg.com/vi/1SCmbXpkTzg/mqdefault.jpg)
![2.N Queen problem👑💍👸| Backtracking| problem Approach and code structure | Harshit Jain[NITA]](http://i.ytimg.com/vi/bm14GtQHqVM/mqdefault.jpg)
![Backtracking |part 3|Generalized code| recursive flow| detailed explanation|Harshit jain[NITA]](http://i.ytimg.com/vi/A4vKFCkEkuU/mqdefault.jpg)
![Functions and Types of arguments |*args, **kwargs| Harshit jain[NITA]](http://i.ytimg.com/vi/4EM78yjYv7w/mqdefault.jpg)
![Normal Array and Numpy array in python| ones, zeros arrange transpose| |Harshit jain[NITA]](http://i.ytimg.com/vi/qsMp_uaHbPY/mqdefault.jpg)
![Conditional and loops in python |For while| nested if else and elif| Harshit jain[NITA]](http://i.ytimg.com/vi/CEjw5bBYLO0/mqdefault.jpg)
![Strings in Python | indexing, slicing, formatting and fstrings|Harshit jain[NITA]](http://i.ytimg.com/vi/vbPNP7Cjal0/mqdefault.jpg)
![List |Tuple| Set| Python |built-in functions| reverse() sort() count() union() | Harshit jain[NITA]](http://i.ytimg.com/vi/HS8G9ALP3-0/mqdefault.jpg)
![Variables |Data type|Numeric |User input|Python|Harshit jain[NITA]](http://i.ytimg.com/vi/0oDIASQuVM0/mqdefault.jpg)
![Introduction to python |Day 1| Harshit jain[NITA]](http://i.ytimg.com/vi/keR5r-1N9rk/mqdefault.jpg)
![Python fundamentals| course for beginners |OVERVIEW| Harshit jain[NITA]](http://i.ytimg.com/vi/NNcC4CXk2Io/mqdefault.jpg)
![Proof of work|Blockchain |Day 6|Harshit jain[NITA]](http://i.ytimg.com/vi/hQJgt8hfmPU/mqdefault.jpg)
![Blockchain Mining|Cryptographic puzzle| Nonce|timestamp| Day 5(video 2) | Harshit jain[NITA]](http://i.ytimg.com/vi/J93_4dmETPk/mqdefault.jpg)
![Byzantine fault tolerance problem|Blockchain|Day 5|Harshit jain[NITA]](http://i.ytimg.com/vi/AOqAt-qv3CI/mqdefault.jpg)
![Distributed Peer to peer network|| P2P||Blockchain|Day 4| Harshit Jain[NITA]](http://i.ytimg.com/vi/WoUE5DQsjh4/mqdefault.jpg)
![Immutable Ledger| Blockchain | Day 3 |Harshit jain[NITA]](http://i.ytimg.com/vi/NjnivA6bG7I/mqdefault.jpg)
![Understand SHA256 Hash |Hashing| Blockchain |Day 2|Harshit jain[NITA]](http://i.ytimg.com/vi/H-CGtXPYwzo/mqdefault.jpg)
![What is Blockchain? |detailed explanation| topic 1|Day 1| Harshit jain[NITA]](http://i.ytimg.com/vi/EGL22KNJV78/mqdefault.jpg)
![Blockchain Fundamentals| Course overview|Harshit jain[NITA]](http://i.ytimg.com/vi/047MDcDJPDM/mqdefault.jpg)
![C++ STL| LAST PART |TUPLE, ALGORITHM, BUILTINPOPCOUNT| HARSHIT JAIN[NITA]](http://i.ytimg.com/vi/Jl2iG2KsWzM/mqdefault.jpg)
![C++ STL | ASSOCIATIVE CONTAINER| DAY 3 |SET AND MAP| HARSHIT JAIN[NITA]](http://i.ytimg.com/vi/XOrbEo2-8bE/mqdefault.jpg)
![JEE AND NEET POSTPONED|NTA NOTIFICATIONS| LOCKDOWN| NTA|HARSHIT JAIN[ NITA]](http://i.ytimg.com/vi/wJRFcpDQFzs/mqdefault.jpg)
![C++STL| Simple Container| DAY 1 |Pair, vector and linked list|Harshit jain[NITA]](http://i.ytimg.com/vi/rDetYKSbXjI/mqdefault.jpg)
![C++ STL COURSE OVERVIEW| use your QUARANTINE TIME | Learn with me|Harshit jain[NITA]](http://i.ytimg.com/vi/y7oIb16FQb4/mqdefault.jpg)
![Problem 1:Factorial of Large Number|JAVA|Geeksforgeeks|Harshit jain[NITA]](http://i.ytimg.com/vi/FGlqj3uDz0w/mqdefault.jpg)
![competitive programming|How to begin|overview of geeksforgeeks platform|Harshit jain[NITA]](http://i.ytimg.com/vi/P-6v-_eoYoY/mqdefault.jpg)
![Jee main 2020|New pattern|NTA|change of no of questions|Marking schemes|Harshit jain[NITA]](http://i.ytimg.com/vi/WKA1ec3RJkg/mqdefault.jpg)
![Branch change in Nits|Engineering|Harshit jain[NITA]](http://i.ytimg.com/vi/lmEIzPmKxUI/mqdefault.jpg)
![Things to do in 1st year of college life|Engineering|college life|Harshit jain[NITA]](http://i.ytimg.com/vi/dh1y91WX2Mo/mqdefault.jpg)
![Csab 2019|Info about Fee refund policy|csab participation fee|Harshit jain[NITA]](http://i.ytimg.com/vi/TPtFQ3aB1lY/mqdefault.jpg)
![🚫|Ragging in college life|It still happens???? |How to tackle it in college|Harshit jain[NITA]](http://i.ytimg.com/vi/y-qcN7jqKjQ/mqdefault.jpg)
![Josaa+csab 2019|must watch it |clear all your doubts regarding counselling|Part 1|Harshit [NITA]](http://i.ytimg.com/vi/49n6OoGe5tg/mqdefault.jpg)
![Freeze,Float,Slide |josaa 2019| in undertaking by candidate form|Harshit Jain.[NITA]](http://i.ytimg.com/vi/iA6kFh1XXxg/mqdefault.jpg)
![Michelson Morley experiment|Special theory of relativity|Part 5|Harshit jain[NITA]](http://i.ytimg.com/vi/agVZe4ID_do/mqdefault.jpg)
![NIT Agartala | Location, Fees, Placement, Facilities,Clubs| complete details 2020| Harshit[NITA]](https://i.ytimg.com/vi/x5Y9kRx_nt4/mqdefault.jpg)
![Associative Container-Set,unordered set,map and Hashmap| implementation| C++ code| Harshit[NITA]](https://i.ytimg.com/vi/ShgEAm-bcm8/mqdefault.jpg)
![Open addressing| Linear and Quadratic Probing| Hashing| Harshit jain[NITA]](https://i.ytimg.com/vi/DBIICDmbMWI/mqdefault.jpg)
![Linear chaining | Collision resolution Technique| Hashing| Harshit jain[NITA]](https://i.ytimg.com/vi/0lInqhCVCjg/mqdefault.jpg)
![Hashing data structure|introduction|detailed explanation|Harshit jain[NITA]](https://i.ytimg.com/vi/XlkqSfOEuHc/mqdefault.jpg)
![Bipartite Graph| properties| 2-coloring| Harshit jain[NITA]](https://i.ytimg.com/vi/nXYy_XZaWo8/mqdefault.jpg)
![Transitive closure of graph |Intuition| Reachability Matrix| Harshit[NITA]](https://i.ytimg.com/vi/g1i9mP5cxJE/mqdefault.jpg)
![Comparison between Shortest Path Algorithms| Which one is better?| Time complexity| Harshit[NITA]](https://i.ytimg.com/vi/LY_MWRKfBAc/mqdefault.jpg)
![Johnson's Algorithm| All pair shortest path algorithm| Harshit jain[NITA]](https://i.ytimg.com/vi/wCjEP8TYi-E/mqdefault.jpg)
![Floyd-warshall algorithm| All pair shortest path algorithm| detailed explanation| Harshit[NITA]](https://i.ytimg.com/vi/94iss9jlNJc/mqdefault.jpg)
![Bellman Ford Algorithm| Single source shortest path Algorithm| detailed explanation| Harshit[NITA]](https://i.ytimg.com/vi/HavyQB4UQYM/mqdefault.jpg)
![DijsKtra's Algorithm | Single source shortes path| Detailed explanation| Harshit jain[NITA]](https://i.ytimg.com/vi/MJoPoXnQ_eA/mqdefault.jpg)
![Kruskal's Algorithm MST | Disjoint set data structure|detailed explanation| O(e loge)|Harshit[NITA]](https://i.ytimg.com/vi/x3PXJv7Lx0c/mqdefault.jpg)
![1.2 Disjoint set in C++|Simple implementation| find and union functions| Code C++| Harshit [NITA]](https://i.ytimg.com/vi/o3CL64S0LtA/mqdefault.jpg)
![1.1 Disjoint set data Structure| intuition| find and merge| Harshit jain[NITA]](https://i.ytimg.com/vi/Ln9HZKvXXrs/mqdefault.jpg)
![Prims algorithm| Minimum cost spanning tree| priority_queue|explanation|Harshit[NITA]](https://i.ytimg.com/vi/g97G5NaWHsw/mqdefault.jpg)
![Spanning Tree| Minimum cost spanning tree| Harshit jain[NITA]](https://i.ytimg.com/vi/qXVnQ8EY0Is/mqdefault.jpg)
![Bridges in Graph| critical connections in network problem| Code |C++| Harshit [NITA]](https://i.ytimg.com/vi/Fu4ZgYLiYYM/mqdefault.jpg)
![Articulation point| overview| Graph| dfs|Harshit jain[NITA]](https://i.ytimg.com/vi/XVuTrjg2QQg/mqdefault.jpg)
![Types of Edges in Dfs tree| Graph| Detailed explanation| Harshit jain[NITA]](https://i.ytimg.com/vi/xBsIZyykLRM/mqdefault.jpg)
![Clone Graph| Bfs+ map | explanation| C++ Code| Harshit jain[NITA]](https://i.ytimg.com/vi/ELxEPpogZ1Q/mqdefault.jpg)
![Kahn's algorithm | Topological sort| Cycle detection| Bfs| Graph| Harshit jain[NITA]](https://i.ytimg.com/vi/RKBF0P7ezCg/mqdefault.jpg)
![Rotten orange Code C++| Bfs|Graph|Harshit jain[NITA]](https://i.ytimg.com/vi/sBplLqDDRxU/mqdefault.jpg)
![Rotten orange| Bfs| explanation| Harshit jain[NITA]](https://i.ytimg.com/vi/2OqadHlARgU/mqdefault.jpg)
![Breadth First search|Bfs code explanation|Graph traversal |queue|Harshit jain[NITA]](https://i.ytimg.com/vi/_llHMo8SCfI/mqdefault.jpg)
![Applications of Depth first traversal| DFS| Graph| Harshit jain [NITA]](https://i.ytimg.com/vi/MMr_NnLMuKs/mqdefault.jpg)
![Strongly Connected Components| KOSARAJU Algorithm| Directed graph| DFS |Graph | Harshit [ NITA]](https://i.ytimg.com/vi/JdC69-dwEtU/mqdefault.jpg)
![Path Finding | DFS | Recursive tree| code C++| Graph| Harshit jain[NITA]](https://i.ytimg.com/vi/epXFq3KIvOA/mqdefault.jpg)
![Cycle detection in Directed Graph| DFS| Recursive tree | Harshit jain[ NITA]](https://i.ytimg.com/vi/Z2f61IBQy_c/mqdefault.jpg)
![Cycle detection undirected graph| DFS | Recursive tree| Code C++| Harshit jain[NITA]](https://i.ytimg.com/vi/1E0QbJ9cC9k/mqdefault.jpg)
![Flood fill algorithm Code C++| Dfs| Harshit jain[NITA]](https://i.ytimg.com/vi/1i8Ic_oly5Q/mqdefault.jpg)
![Flood Fill Algorithm | Dfs | recursive tree | detailed explanation| Harshit jain[NITA]](https://i.ytimg.com/vi/hipUa0NfUPc/mqdefault.jpg)
![Number of Islands| Code C++| Dfs| Harshit Jain[NITA]](https://i.ytimg.com/vi/V3yZVE9z9G4/mqdefault.jpg)
![Number of ISLANDS 🏝| DFS recursive tree |Detailed explanation| Graph| Harshit jain[NITA]](https://i.ytimg.com/vi/nfuMXc1Rrso/mqdefault.jpg)
![Print DFS of undirected, directed and disconnected graph | Code | C++ | Harshit Jain[NITA]](https://i.ytimg.com/vi/GM53DmbLwTw/mqdefault.jpg)
![1.2 Dfs tree | depth first traverse| Graph |Harshit jain[ NITA]](https://i.ytimg.com/vi/Z-seKD8XL10/mqdefault.jpg)
![1.1 Depth First search| DFS| stack|Graph| Harshit jain[NITA]](https://i.ytimg.com/vi/IwecrTGoAdc/mqdefault.jpg)
![Adjacency Matrix representation| Graph| Code |C++|Harshit jain[NITA]](https://i.ytimg.com/vi/YJ7SyFATWgY/mqdefault.jpg)
![Adjacency list representation| Graph| code| detailed explanation|C++|Harshit jain[NITA]](https://i.ytimg.com/vi/CF8sq3M-tgM/mqdefault.jpg)
![Graph representation | adjacency list and Matrix| differences| complexity| Harshit Jain[NITA]](https://i.ytimg.com/vi/ho1rHdkcIoQ/mqdefault.jpg)
![Graph Data structures|basic terms| part 1 | Harshit Jain [NITA]](https://i.ytimg.com/vi/PX_IlkSYmaQ/mqdefault.jpg)
![m coloring problem| Recursive tree| Backtracking| Logic| Harshit jain[NITA]](https://i.ytimg.com/vi/613C16SrnUw/mqdefault.jpg)
![Print all subsets| Backtracking| recursive tree| CODE|Harshit jain[NITA]](https://i.ytimg.com/vi/z8efUCGa8Xk/mqdefault.jpg)
![Combination Sum -I | Backtracking | recursion| explanation| Harshit jain[NITA]](https://i.ytimg.com/vi/LxOncNHqMFs/mqdefault.jpg)
![Knight Tour| code|explanation |Backtracking| Algorithm| Harshit jain[NITA]](https://i.ytimg.com/vi/uhxE2Uy_GYE/mqdefault.jpg)
![3.Knight's Tour | Backtracking | recursive flow| generalized code|Harshit jain[NITA]](https://i.ytimg.com/vi/1SCmbXpkTzg/mqdefault.jpg)
![2.N Queen problem👑💍👸| Backtracking| problem Approach and code structure | Harshit Jain[NITA]](https://i.ytimg.com/vi/bm14GtQHqVM/mqdefault.jpg)
![Backtracking |part 3|Generalized code| recursive flow| detailed explanation|Harshit jain[NITA]](https://i.ytimg.com/vi/A4vKFCkEkuU/mqdefault.jpg)
![Functions and Types of arguments |*args, **kwargs| Harshit jain[NITA]](https://i.ytimg.com/vi/4EM78yjYv7w/mqdefault.jpg)
![Normal Array and Numpy array in python| ones, zeros arrange transpose| |Harshit jain[NITA]](https://i.ytimg.com/vi/qsMp_uaHbPY/mqdefault.jpg)
![Conditional and loops in python |For while| nested if else and elif| Harshit jain[NITA]](https://i.ytimg.com/vi/CEjw5bBYLO0/mqdefault.jpg)
![Strings in Python | indexing, slicing, formatting and fstrings|Harshit jain[NITA]](https://i.ytimg.com/vi/vbPNP7Cjal0/mqdefault.jpg)
![List |Tuple| Set| Python |built-in functions| reverse() sort() count() union() | Harshit jain[NITA]](https://i.ytimg.com/vi/HS8G9ALP3-0/mqdefault.jpg)
![Variables |Data type|Numeric |User input|Python|Harshit jain[NITA]](https://i.ytimg.com/vi/0oDIASQuVM0/mqdefault.jpg)
![Introduction to python |Day 1| Harshit jain[NITA]](https://i.ytimg.com/vi/keR5r-1N9rk/mqdefault.jpg)
![Python fundamentals| course for beginners |OVERVIEW| Harshit jain[NITA]](https://i.ytimg.com/vi/NNcC4CXk2Io/mqdefault.jpg)
![Proof of work|Blockchain |Day 6|Harshit jain[NITA]](https://i.ytimg.com/vi/hQJgt8hfmPU/mqdefault.jpg)
![Blockchain Mining|Cryptographic puzzle| Nonce|timestamp| Day 5(video 2) | Harshit jain[NITA]](https://i.ytimg.com/vi/J93_4dmETPk/mqdefault.jpg)
![Byzantine fault tolerance problem|Blockchain|Day 5|Harshit jain[NITA]](https://i.ytimg.com/vi/AOqAt-qv3CI/mqdefault.jpg)
![Distributed Peer to peer network|| P2P||Blockchain|Day 4| Harshit Jain[NITA]](https://i.ytimg.com/vi/WoUE5DQsjh4/mqdefault.jpg)
![Immutable Ledger| Blockchain | Day 3 |Harshit jain[NITA]](https://i.ytimg.com/vi/NjnivA6bG7I/mqdefault.jpg)
![Understand SHA256 Hash |Hashing| Blockchain |Day 2|Harshit jain[NITA]](https://i.ytimg.com/vi/H-CGtXPYwzo/mqdefault.jpg)
![What is Blockchain? |detailed explanation| topic 1|Day 1| Harshit jain[NITA]](https://i.ytimg.com/vi/EGL22KNJV78/mqdefault.jpg)
![Blockchain Fundamentals| Course overview|Harshit jain[NITA]](https://i.ytimg.com/vi/047MDcDJPDM/mqdefault.jpg)
![C++ STL| LAST PART |TUPLE, ALGORITHM, BUILTINPOPCOUNT| HARSHIT JAIN[NITA]](https://i.ytimg.com/vi/Jl2iG2KsWzM/mqdefault.jpg)
![C++ STL | ASSOCIATIVE CONTAINER| DAY 3 |SET AND MAP| HARSHIT JAIN[NITA]](https://i.ytimg.com/vi/XOrbEo2-8bE/mqdefault.jpg)
![JEE AND NEET POSTPONED|NTA NOTIFICATIONS| LOCKDOWN| NTA|HARSHIT JAIN[ NITA]](https://i.ytimg.com/vi/wJRFcpDQFzs/mqdefault.jpg)
![C++STL| Simple Container| DAY 1 |Pair, vector and linked list|Harshit jain[NITA]](https://i.ytimg.com/vi/rDetYKSbXjI/mqdefault.jpg)
![C++ STL COURSE OVERVIEW| use your QUARANTINE TIME | Learn with me|Harshit jain[NITA]](https://i.ytimg.com/vi/y7oIb16FQb4/mqdefault.jpg)
![Problem 1:Factorial of Large Number|JAVA|Geeksforgeeks|Harshit jain[NITA]](https://i.ytimg.com/vi/FGlqj3uDz0w/mqdefault.jpg)
![competitive programming|How to begin|overview of geeksforgeeks platform|Harshit jain[NITA]](https://i.ytimg.com/vi/P-6v-_eoYoY/mqdefault.jpg)
![Jee main 2020|New pattern|NTA|change of no of questions|Marking schemes|Harshit jain[NITA]](https://i.ytimg.com/vi/WKA1ec3RJkg/mqdefault.jpg)
![Branch change in Nits|Engineering|Harshit jain[NITA]](https://i.ytimg.com/vi/lmEIzPmKxUI/mqdefault.jpg)
![Things to do in 1st year of college life|Engineering|college life|Harshit jain[NITA]](https://i.ytimg.com/vi/dh1y91WX2Mo/mqdefault.jpg)
![Csab 2019|Info about Fee refund policy|csab participation fee|Harshit jain[NITA]](https://i.ytimg.com/vi/TPtFQ3aB1lY/mqdefault.jpg)
![🚫|Ragging in college life|It still happens???? |How to tackle it in college|Harshit jain[NITA]](https://i.ytimg.com/vi/y-qcN7jqKjQ/mqdefault.jpg)
![Josaa+csab 2019|must watch it |clear all your doubts regarding counselling|Part 1|Harshit [NITA]](https://i.ytimg.com/vi/49n6OoGe5tg/mqdefault.jpg)
![Freeze,Float,Slide |josaa 2019| in undertaking by candidate form|Harshit Jain.[NITA]](https://i.ytimg.com/vi/iA6kFh1XXxg/mqdefault.jpg)
![Michelson Morley experiment|Special theory of relativity|Part 5|Harshit jain[NITA]](https://i.ytimg.com/vi/agVZe4ID_do/mqdefault.jpg)
