วีดีโอ

Good one

[::0] this is possible ryt?

1.25x for better experience

Major Anand👑

🔥👍

Op Anand 🔥

Comment !🤝🏻

Ban dravid 🤬🤬

dravid op

Comment

git commit -m "super ✨"

🤝

No Audio?

But set cannot be sorted🙄. Well, I wish to try this code. I would have done sorted(list(set(nums))).

You rock! bro 🎉

Super bro

Hello Mr. Sheninth, all concept you listed on video enough for fresher interview right ? I had some interviews and they usually ask me all above concept. I need to improve my thinking in algorithm to crack my interview.

Neenga third year subject topics ah explain panni video pota helpful ah irukum

I've been learning React.js for 6 months and have a basic understanding, including hooks, custom hooks, and data fetching. Should I start learning Next.js now, or should I strengthen my React skills further?

Hii bro I've been learning React.js for 6 months and have a basic understanding, including hooks, custom hooks, and data fetching. Should I start learning Next.js now, or should I strengthen my React skills further? ❤

Thanks for bringing my suggestion into work and this is very helpful to learn ❤

nice explanation

Bro don't post leetcode please post data structure full tutorial first and then with leetcode

Bro dsa learn pannumbhodhu .. ipo first first ta dsa learn pandrom na ... Suppose graph algorithm erukunaa adhoooda pseudo code laam namaku therinji erukanumaa or adhooda concept mattum therinja pothuma bro

Well explained bro ✨

There is an error in line 8. It should be "hash_map[nums[x]] = x". The variable "i" is undefined here.

It's very useful 😊

Very useful bro 🎉

Bro ,do tutorial video for next js project deployment video

Bro,do more videos about leetcode problem

Its enough to learn? you miss some topics Binary Trees. Binary Search Trees (BST). AVL Trees. B-Trees. Tries. Min-Heap and Max-Heap. Priority Queues. Representation (Adjacency Matrix/List). Graph Traversal (BFS, DFS). Shortest Path Algorithms (Dijkstra, Bellman-Ford). Minimum Spanning Tree (Prim’s, Kruskal’s). Bubble Sort, Selection Sort, Insertion Sort. Merge Sort, Quick Sort, Heap Sort. Hash Tables and Hash Functions. Collision Resolution Techniques. Segment Trees, Fenwick Trees (Binary Indexed Tree). Suffix Trees and Arrays.

Well explained bro 💥

✨ clear explanation bro

Broo ipdiye niraiyaa leetcode problems ku solutions kudunga bro pls useful ah irukum 🙏🏻

I need dsa roadmap bro..✨

Next time increase your ediotr font size and add music and also edit your videos

next topic pls upload bro

✨

very helpful, start a small playlist for whole git commands and github

Very helpful 💚

If you want the code of this project please comment it below? 👇

Thank you for this video bro...

Nice🔥🔥

Awesome

"I just wanted to drop by and express my gratitude for your amazing content. Your coding tutorials have helped me level up my skills in ways I never thought possible. Thank you for sharing your knowledge with the world!"

🔥🔥

🎉....we are waiting for ur next video

????

Try it out now: code-jr.vercel.app GitHub Repo: github.com/sheninthjr/CodeJr