Harshit jain

@UCyW9dCDLcrxJPZoi3ep2hDg - 4.3K subscribers

Hello friends .Welcome to my channel .I am currently pursuing B-Tech in CSE @ NITA. This channel has technical videos, college related videos and some funny videos.

Home Videos Live Playlists

My initial days in Hyderabad| VLOG| Corporate life begins 🖥️🧑‍💻

My initial days in Hyderabad| VLOG| Corporate life begins 🖥️🧑‍💻 Harshit jain

550 views - 3 years ago

Last 20 Days of College Life 🎓 | NITA

Last 20 Days of College Life 🎓 | NITA Harshit jain

878 views - 4 years ago

Best Shots of Our Funny Videos | When we were in First Year at NITA | Recompile of funny scenes

Best Shots of Our Funny Videos | When we were in First Year at NITA | Recompile of funny scenes Harshit jain

378 views - 4 years ago

Google internship Swags 2021 | Application Engineer Intern

Google internship Swags 2021 | Application Engineer Intern Harshit jain

8.7K views - 4 years ago

Sikkim Trip Vlogs | College Friends | October 2021 | 4 days trip

Sikkim Trip Vlogs | College Friends | October 2021 | 4 days trip Harshit jain

611 views - 4 years ago

Delete Key operation | Min Heap | part 12

Delete Key operation | Min Heap | part 12 Harshit jain

287 views - 5 years ago

Decrease Key | Min heap| part 11

Decrease Key | Min heap| part 11 Harshit jain

4.2K views - 5 years ago

Build heap| Full explanation | Example 2 | part 10

Build heap| Full explanation | Example 2 | part 10 Harshit jain

51 views - 5 years ago

Build heap | explanation | Example 1 Part 9

Build heap | explanation | Example 1 Part 9 Harshit jain

60 views - 5 years ago

Extract min | code C++ | detailed explanation | part 8

Extract min | code C++ | detailed explanation | part 8 Harshit jain

101 views - 5 years ago

Extract Min in Heap| Full explanation | part 7

Extract Min in Heap| Full explanation | part 7 Harshit jain

1.2K views - 5 years ago

Heapify Concept| Code C++ and explanation | part 6

Heapify Concept| Code C++ and explanation | part 6 Harshit jain

213 views - 5 years ago

heap insert code C++ | explanation | part 5

heap insert code C++ | explanation | part 5 Harshit jain

138 views - 5 years ago

Insertion in Heap| explanation| part 4

Insertion in Heap| explanation| part 4 Harshit jain

50 views - 5 years ago

Heap implementation code C++| part 3

Heap implementation code C++| part 3 Harshit jain

54 views - 5 years ago

Heap implementation| Array | Left and Right child| part 2

Heap implementation| Array | Left and Right child| part 2 Harshit jain

308 views - 5 years ago

Heap Data structure| Types of heap | Introduction | part 1

Heap Data structure| Types of heap | Introduction | part 1 Harshit jain

153 views - 5 years ago

Create Binary Tree | C++ | print nodes using postorder traversal| part 3

Create Binary Tree | C++ | print nodes using postorder traversal| part 3 Harshit jain

85 views - 5 years ago

Tree Traversal Techniques| Depth first traversal| Detailed explanation | part 2

Tree Traversal Techniques| Depth first traversal| Detailed explanation | part 2 Harshit jain

28 views - 5 years ago

Tree Data structure | Types of Binary Tree| Binary Tree| complete information| part 1

Tree Data structure | Types of Binary Tree| Binary Tree| complete information| part 1 Harshit jain

33 views - 5 years ago

Sieve of Eratosthenes Algorithm| prime no between 1 to N | O(n log log n) | code

Sieve of Eratosthenes Algorithm| prime no between 1 to N | O(n log log n) | code Harshit jain

146 views - 5 years ago

Searching algorithms | Linear and Binary search | detailed explanation| Code

Searching algorithms | Linear and Binary search | detailed explanation| Code Harshit jain

16 views - 5 years ago

Linked List Cycle & Linked List Cycle ll Leetcode problems| Floyd Cycle detection algorithm| part 3

Linked List Cycle & Linked List Cycle ll Leetcode problems| Floyd Cycle detection algorithm| part 3 Harshit jain

44 views - 5 years ago

Floyd Cycle detection algorithm| Mathematical Intuition| proof | Loop detection | part 2

Floyd Cycle detection algorithm| Mathematical Intuition| proof | Loop detection | part 2 Harshit jain

391 views - 5 years ago

Floyd Cycle detection Algorithm | LinkedList | Loop detection| introduction| part 1

Floyd Cycle detection Algorithm | LinkedList | Loop detection| introduction| part 1 Harshit jain

157 views - 5 years ago

FREE CRASH COURSE ON C++ STL| Udemy | 10000+ enrollments from 130+ countries| Hurry up| Promo video

FREE CRASH COURSE ON C++ STL| Udemy | 10000+ enrollments from 130+ countries| Hurry up| Promo video Harshit jain

195 views - 5 years ago

GIVEAWAY🎁✨Valentine's Day offer| Free Coupon code of My Udemy Course| OOP in C++

GIVEAWAY🎁✨Valentine's Day offer| Free Coupon code of My Udemy Course| OOP in C++ Harshit jain

99 views - 5 years ago

Fresher's Talk 2020 | NIT Agartala | Introduction of Freshers

Fresher's Talk 2020 | NIT Agartala | Introduction of Freshers Harshit jain

13K views - 5 years ago

Road map For First year Students | Engineering colleges| NITA | Harshit Jain

Road map For First year Students | Engineering colleges| NITA | Harshit Jain Harshit jain

318 views - 5 years ago

NIT Agartala | Location, Fees, Placement, Facilities,Clubs| complete details 2020| Harshit[NITA]

NIT Agartala | Location, Fees, Placement, Facilities,Clubs| complete details 2020| Harshit[NITA] Harshit jain

776 views - 5 years ago

Associative Container-Set,unordered set,map and Hashmap| implementation| C++ code| Harshit[NITA]

Associative Container-Set,unordered set,map and Hashmap| implementation| C++ code| Harshit[NITA] Harshit jain

182 views - 5 years ago

Open addressing| Linear and Quadratic Probing| Hashing| Harshit jain[NITA]

Open addressing| Linear and Quadratic Probing| Hashing| Harshit jain[NITA] Harshit jain

49 views - 5 years ago

Linear chaining | Collision resolution Technique| Hashing| Harshit jain[NITA]

Linear chaining | Collision resolution Technique| Hashing| Harshit jain[NITA] Harshit jain

54 views - 5 years ago

Hashing data structure|introduction|detailed explanation|Harshit jain[NITA]

Hashing data structure|introduction|detailed explanation|Harshit jain[NITA] Harshit jain

96 views - 5 years ago

Bipartite Graph| properties| 2-coloring| Harshit jain[NITA]

Bipartite Graph| properties| 2-coloring| Harshit jain[NITA] Harshit jain

76 views - 5 years ago

Transitive closure of graph |Intuition| Reachability Matrix| Harshit[NITA]

Transitive closure of graph |Intuition| Reachability Matrix| Harshit[NITA] Harshit jain

607 views - 5 years ago

Comparison between Shortest Path Algorithms| Which one is better?| Time complexity| Harshit[NITA]

Comparison between Shortest Path Algorithms| Which one is better?| Time complexity| Harshit[NITA] Harshit jain

424 views - 5 years ago

Johnson's Algorithm| All pair shortest path algorithm| Harshit jain[NITA]

Johnson's Algorithm| All pair shortest path algorithm| Harshit jain[NITA] Harshit jain

20K views - 5 years ago

Floyd-warshall algorithm| All pair shortest path algorithm| detailed explanation| Harshit[NITA]

Floyd-warshall algorithm| All pair shortest path algorithm| detailed explanation| Harshit[NITA] Harshit jain

89 views - 5 years ago

Bellman Ford Algorithm| Single source shortest path Algorithm| detailed explanation| Harshit[NITA]

Bellman Ford Algorithm| Single source shortest path Algorithm| detailed explanation| Harshit[NITA] Harshit jain

106 views - 5 years ago

DijsKtra's Algorithm | Single source shortes path| Detailed explanation| Harshit jain[NITA]

DijsKtra's Algorithm | Single source shortes path| Detailed explanation| Harshit jain[NITA] Harshit jain

109 views - 5 years ago

Kruskal's Algorithm MST | Disjoint set data structure|detailed explanation| O(e loge)|Harshit[NITA]

Kruskal's Algorithm MST | Disjoint set data structure|detailed explanation| O(e loge)|Harshit[NITA] Harshit jain

706 views - 5 years ago

1.3 Union by Rank &Find using Path compression| Disjoint set datastructure| optimized implementation

1.3 Union by Rank &Find using Path compression| Disjoint set datastructure| optimized implementation Harshit jain

126 views - 5 years ago

1.2 Disjoint set in C++|Simple implementation| find and union functions| Code C++| Harshit [NITA]

1.2 Disjoint set in C++|Simple implementation| find and union functions| Code C++| Harshit [NITA] Harshit jain

59 views - 5 years ago

1.1 Disjoint set data Structure| intuition| find and merge| Harshit jain[NITA]

1.1 Disjoint set data Structure| intuition| find and merge| Harshit jain[NITA] Harshit jain

77 views - 5 years ago

Prims algorithm| Minimum cost spanning tree| priority_queue|explanation|Harshit[NITA]

Prims algorithm| Minimum cost spanning tree| priority_queue|explanation|Harshit[NITA] Harshit jain

67 views - 5 years ago

Spanning Tree| Minimum cost spanning tree| Harshit jain[NITA]

Spanning Tree| Minimum cost spanning tree| Harshit jain[NITA] Harshit jain

17 views - 5 years ago

Bridges in Graph| critical connections in network problem| Code |C++| Harshit [NITA]

Bridges in Graph| critical connections in network problem| Code |C++| Harshit [NITA] Harshit jain

129 views - 5 years ago

Articulation point| overview| Graph| dfs|Harshit jain[NITA]

Articulation point| overview| Graph| dfs|Harshit jain[NITA] Harshit jain

209 views - 5 years ago

Types of Edges in Dfs tree| Graph| Detailed explanation| Harshit jain[NITA]

Types of Edges in Dfs tree| Graph| Detailed explanation| Harshit jain[NITA] Harshit jain

4.2K views - 5 years ago

Clone Graph| Bfs+ map | explanation| C++ Code| Harshit jain[NITA]

Clone Graph| Bfs+ map | explanation| C++ Code| Harshit jain[NITA] Harshit jain

134 views - 5 years ago

Course Scheduler problem| Task scheduler| Kahn's algorithm| topological sort| code C++| Harshit jain

Course Scheduler problem| Task scheduler| Kahn's algorithm| topological sort| code C++| Harshit jain Harshit jain

78 views - 5 years ago

Kahn's algorithm | Topological sort| Cycle detection| Bfs| Graph| Harshit jain[NITA]

Kahn's algorithm | Topological sort| Cycle detection| Bfs| Graph| Harshit jain[NITA] Harshit jain

123 views - 5 years ago

Rotten orange Code C++| Bfs|Graph|Harshit jain[NITA]

Rotten orange Code C++| Bfs|Graph|Harshit jain[NITA] Harshit jain

107 views - 5 years ago

Rotten orange| Bfs| explanation| Harshit jain[NITA]

Rotten orange| Bfs| explanation| Harshit jain[NITA] Harshit jain

46 views - 5 years ago

Shortest path in unweighted graph from source to all vertices| BFS| Code | detailed explanation |

Shortest path in unweighted graph from source to all vertices| BFS| Code | detailed explanation | Harshit jain

1.9K views - 5 years ago

Breadth First search|Bfs code explanation|Graph traversal |queue|Harshit jain[NITA]

Breadth First search|Bfs code explanation|Graph traversal |queue|Harshit jain[NITA] Harshit jain

112 views - 5 years ago

Applications of Depth first traversal| DFS| Graph| Harshit jain [NITA]

Applications of Depth first traversal| DFS| Graph| Harshit jain [NITA] Harshit jain

296 views - 5 years ago

Strongly Connected Components| KOSARAJU Algorithm| Directed graph| DFS |Graph | Harshit [ NITA]

Strongly Connected Components| KOSARAJU Algorithm| Directed graph| DFS |Graph | Harshit [ NITA] Harshit jain

124 views - 5 years ago

Path Finding | DFS | Recursive tree| code C++| Graph| Harshit jain[NITA]

Path Finding | DFS | Recursive tree| code C++| Graph| Harshit jain[NITA] Harshit jain

117 views - 6 years ago