@KraantiKumar The idea that Dalits should look only to other Dalits as role models prevents Baba Saheb Ambedkar from being recognized as the universally acknowledged leader he truly deserves to be; it is worth noting that Abhijeet Dipke regards Ambedkar as his ideal.
@KraantiKumar Kranti, this might seem a bit odd to you, but your way of thinking is somewhat outdated; politicians of the new generation think differently than we do. We need to analyze their methods rather than imposing our own views on them.
@RebornManish Only a former sanghi (might attended few baudhdik) can write such a beautiful meaningful and thoughtful lines....you are an inspiration ❤️
🚨 बड़ी खबर! 🇮🇳
एक भारतीय स्टार्टअप ने वो कर दिखाया जिस पर दुनिया के बड़े ऑटोमेकर्स सालों से काम कर रहे थे।
बेंगलुरु की Vimag Labs ने रेयर अर्थ फ्री इलेक्ट्रिक मोटर प्लेटफॉर्म का पेटेंट हासिल कर लिया है।
इस तकनीक में परमानेंट मैग्नेट की जगह सॉफ्टवेयर से नियंत्रित मैग्नेटिक फील्ड का इस्तेमाल किया गया है।
अगर सफल रहा तो EV इंडस्ट्री की चीन पर निर्भरता काफी हद तक कम हो सकती है!
भारत का इनोवेशन फिर चमका ✨
#VimagLabs #MadeInIndia #EVRevolution #RareEarthFree
I left for bombay at 6.30 am like the hard working professional that I am & stopped the car at 7 am to make this reel as I’ve long realised that silence is not a virtue & one must speak up when they are disrespected. Yes if wrong things happen at any workplace that are against basic human rights, me & all of us should speak up. I don’t care about the personal trolling, I’m used to it last 5 years since shark tank but the purpose of this reel is to request all the proud Indians in this country to start speaking up when they see something wrong, out of humanity, out of patriotism. Jai hind. Now off to another joyful & complex day at work !
Yesterday, Adani bought Jaypee Group for Rs 14,535 Cr
But Vedanta had bid around Rs 17,000Cr, over Rs 2,000 Cr MORE than Adani
Yet their higher bid lost and Adani won the bid despite a lower bid!
So how did the lowest bid win one of India's largest bankruptcy deals?
1/16
Want to level up in AI but can't afford expensive courses?
NVIDIA solved that problem.
They just released professional-grade training at no cost here are the top picks: 👇
Top 12 Data Structures You Should Know for Coding Interviews:
1. 𝐀𝐫𝐫𝐚𝐲𝐬
- A fixed-size collection of elements stored in contiguous memory.
- Provides O(1) access based on index.
2. 𝐌𝐚𝐭𝐫𝐢𝐱 (2𝐃 𝐀𝐫𝐫𝐚𝐲)
- A multi-dimensional array used for representing grids, graphs, and dynamic programming problems.
3. 𝐋𝐢𝐧𝐤𝐞𝐝 𝐋𝐢𝐬𝐭
- A dynamic data structure where elements (nodes) are linked via pointers.
- Types: Singly Linked List, Doubly Linked List, Circular Linked List.
4. 𝐒𝐭𝐚𝐜𝐤
- A Last-In-First-Out (LIFO) data structure where the element added last is the first one to be removed.
- Supports push, pop, and peek operations in O(1) time.
5. 𝐐𝐮𝐞𝐮𝐞
- A First-In-First-Out (FIFO) data structure.
- Allows inserting at the back (enqueue) and removing from the front (dequeue) in O(1) time.
- Used to process elements in the same order as they are added.
6. 𝐇𝐚𝐬𝐡𝐌𝐚𝐩
- A key-value data structure that uses a hash function for fast lookups.
- Provides O(1) average-time insert/delete/search, O(N) (Worst-case due to collisions)
7. 𝐓𝐫𝐞𝐞
- A hierarchical data structure with a root node and child nodes.
- Types: Binary Tree, N-ary Tree, AVL Tree, Red-Black Tree.
8. 𝐁𝐢𝐧𝐚𝐫𝐲 𝐒𝐞𝐚𝐫𝐜𝐡 𝐓𝐫𝐞𝐞 (𝐁𝐒𝐓)
- A special tree where the left child < root < right child.
- Enables O(log N) search, insert, and delete in balanced BSTs.
9. 𝐇𝐞𝐚𝐩 (𝐏𝐫𝐢𝐨𝐫𝐢𝐭𝐲 𝐐𝐮𝐞𝐮𝐞)
- A binary tree-based structure where the parent is always greater (max heap) or smaller (min heap) than its children.
- Provides O(log N) insert/delete and O(1) get min/max.
10. 𝐓𝐫𝐢𝐞
- A tree structure used for fast string searches.
- Provides O(M) insert/search/delete, where M is the string length.
11. 𝐆𝐫𝐚𝐩𝐡
- A collection of nodes (vertices) connected by edges.
- Represented using an Adjacency List (efficient) or Adjacency Matrix.
- Types: Directed, Undirected, Weighted, Unweighted.
12. 𝐔𝐧𝐢𝐨𝐧-𝐅𝐢𝐧𝐝 (𝐃𝐢𝐬𝐣𝐨𝐢𝐧𝐭 𝐒𝐞𝐭)
- A data structure used for efficiently handling dynamic connectivity.
- Supports Union(x, y) and Find(x) in nearly O(1) time (with path compression).
- Useful in detecting cycles and finding connected components in a graph.
♻️ Repost to help others in your network
कोटा मे कानून के जानकर लोगो का टोटा थोडी है बस थोडी सी हिम्मत सिस्टम से सवाल करने की दिखानी पडती है जिससे जिम्मेदार जल्दी ही मैदान छोडकर भागते नजर आते है
नगर निगम की सहायक विधि अधिकारी अरुंधति शर्मा D-Mart मे निजी कार्य करने के दौरान सरकारी वाहन का उपयोग कर रही थी जिसे लेकर आम आदमी ने विरोध किया तो फिर मैडम को पैदल चलकर घर जाना पडा।