1/6 Si cobraste un seguro de vida como beneficiario, el SAT te puede cobrar ISR sobre ese dinero. Si, aunque sea una indemnizacion por la muerte de un familiar. Te explico cuando SI esta exento y cuando NO en este hilo 🧵
PYTHON is difficult to learn, but not anymore!
Introducing "The Ultimate Python ebook "PDF.
You will get:
• 74+ pages cheatsheet
• Save 100+ hours on research
And for 48 hrs, it's 100% FREE!
To get it, just:
1. Follow (So I can DM you )
2. Like & Retweet
3. Reply "SEND"
Focus on ''Google Drive'' 119 GB+ All paid Courses.
Proven fast systems for closing $9K+ agency clients.
🚨EXPOSED🚨:👇
— AI
— Ethical Hacking
— Cybersecurity Fundamentals
— Prompt Engineering
— Google Cloud Training
— Machine Learning
— DevOps & CI/CD
— Kubernetes & Docker
— Blockchain Development
— Power BI
— React & Node.js
— Cloud Security
— Linux Essentials
— Penetration Testing
— Data Analytics
— Data Science
— BIG DATA
— SQL Mastery
— Tableau
— Python
— AWS
— Java
Just do it:👇
1️⃣ Comment " File "
2️⃣ Follow Me @ai_uncovered for auto DM.
3️⃣ Like and Repost
— Don't forget to BOOKMARK!
ChatGPT is insanely powerful.
But, without proper prompting its nothing.
That's why I built "1000+ GPT-4 Prompts":
• 1000+ Prompts
• 5000 AI Tools
• Full guide.
And for 24 hours, it's 100% FREE!
To get it, just:
1. Like
2. Reply "AI"
3. Follow me (so that I can DM)
Caótica y apocaliptica #CDMX donde la diversión se mueve en un subsuelo acuoso y en cada #Sismocdmx nos recuerda que sigue viva la tierra de nuestros ancestros y dónde aquí nos tocó vivir
🙋🏻♀️Luisa Josefina Hernández escribió más de quince obras de teatro y más de una decena de novelas, entre ellas «El lugar donde crece la hierba», título que inauguró la colección #Vindictas. A tres años de su fallecimiento, compartimos este adelanto de la novela.➡️ https://t.co/QH92vOJfEF
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
Kling AI Dance Challenge Rewards Upgraded
Rewards just got easier. More chances to win.
New 50-like, 300-like, and 1,000-like tiers, and 100K likes unlock a full-year Ultra Plan (worth 312,000 credits).
With Kling 2.6 Motion Control, ONE photo → viral dance, share 260 million credits. It’s that easy.
From Chanel Dance to Cute Baby Dance.
Just remember:
· Include the KlingAI watermark
· Use Hashtag KlingAIDance & mention “Created By KlingAI”
· @ Kling_ai
· DM us your Kling UID before the deadline
Then post it. Get likes. Get rewarded.