Tech And Events 2026
1.11K subscribers
333 photos
23 videos
34 files
749 links
Sharing Events In 2026-2027
Technology Updates
World Level Hackathons
Up To Date In Tech Soft Skills For Your Knowledge
Download Telegram
๐Ÿ”น What is the Bandwagon Effect?

The Bandwagon Effect is a psychological bias in which people start doing something simply because everyone else is doing it.

๐Ÿ‘‰ That is, a person doesn't think whether something is right or not, they just follow the crowd.
This is called โ€”

"Everyone is doing it, so I will too."

๐Ÿ”น Real-life examples ๐Ÿ‘‡

Fashion trends ๐Ÿ‘—
When a new style or clothing item becomes trendy, people start wearing it,
even if it doesn't suit them โ€” just because everyone else is wearing it.

Social media following ๐Ÿ“ฑ
When a celebrity or influencer becomes very popular,
people start following them without any particular reason,
because โ€œeveryone is following them.โ€

Voting in elections ๐Ÿ—ณ๏ธ
Sometimes people vote for a party just because
โ€œit seems like they are going to win.โ€
That is, they make decisions based on the majority, not thoughtful consideration.

Stock market / Crypto ๐Ÿ’ฐ
When people see others investing in a particular stock or cryptocurrency,
they also invest in it โ€”
without knowing whether it's the right choice or not.

๐Ÿ”น Psychological reason

Humans feel safe in a crowd (herd mentality).

We fear that โ€œif I am different, I might be wrong.โ€

That's why we do what others are doing.

๐Ÿ”น Example from India ๐Ÿ‡ฎ๐Ÿ‡ณ

In 2021, when cryptocurrencies like โ€œDogecoinโ€ and โ€œShiba Inuโ€ were trending,
millions of Indians invested money just because
โ€œeveryone was earning.โ€
But later, when the market crashed,
most people suffered heavy losses โ€”
because they hadn't done their own research.

โœ… Simple definition:

Bandwagon Effect means โ€“ when a person starts doing something just because everyone else is doing it.

๐Ÿ•‰ Even in matters of religion, people follow new rituals. They don't even know their meaning, yet they follow them. Why? Because if everyone is doing it, it can't be wrong.

But I have learned from Acharya Ji that if everyone is doing something, there's a higher chance that it might be wrong. And I am seeing this happening around me.
Forwarded from Acharya Prashant
This media is not supported in your browser
VIEW IN TELEGRAM
Do you remember the lockdown days?

When the world came to a halt, flights grounded, factories silent, roads empty.

And suddenly, skies turned blue.

Rivers that hadnโ€™t reflected the sun in decades began to sparkle.

Peacocks danced on highways, dolphins appeared near city shores, and mountains became visible from hundreds of kilometres away.

All within weeks.

That wasnโ€™t a miracle.

It was proof, nature heals fast when we step aside.

And thatโ€™s what the Earth needs today, not more symbolic action, but less action.

Not more planting, but less cutting.

Not more green slogans, but fewer desires that demand destruction.

โ€”โ€”โ€”โ€”โ€”โ€”โ€”โ€”โ€”โ€”โ€”โ€”

As Acharya Prashant reminds us,

โ€œThe solution is not to add new eco-friendly gestures on top of the same destructive lifestyle, but to stop that lifestyle itself.โ€

Because the more we โ€œdoโ€, the more we disturb.

We pollute when we act, and we pollute again when we try to undo that act.
Forwarded from ๐Ÿ’ป Computer Books Chat ๐Ÿ’ป (Admin)
Itโ€™s All Analytics!
The foundations of AI, big data, and data science landscape for professionals in healthcare,.business, and government
Scott Burk & Gary D. Miner
CRC Press, 2021
Forwarded from ๐Ÿ’ป Computer Books Chat ๐Ÿ’ป (Admin)
Its_All_Analytics_The_Foundations_of_AI,_Big_Data,_and_Data_Science.pdf
5.1 MB
Itโ€™s All Analytics!
Scott Burk, 2021
Forwarded from Java Programming
30-day roadmap to learn Java up to an intermediate level.

This roadmap is designed for beginners, so adjust your pace as needed.

Week 1: Java Basics
*Day 1-2:*
- Day 1: Get Java installed on your computer and set up your development environment.
- Day 2: Learn about Java's history, its role in programming, and write your first "Hello, World!" program.

*Day 3-4:*
- Day 3: Study Java syntax, data types, and variables.
- Day 4: Understand operators and perform basic arithmetic operations.

*Day 5-7:*
- Day 5: Explore control flow with if-else statements and loops (for and while).
- Day 6: Dive into switch statements and understand how to handle user choices.
- Day 7: Practice writing small programs that use conditions and loops.

Week 2: Functions and Object-Oriented Programming
*Day 8-9:*
- Day 8: Learn about functions (methods) and how to define your own functions in Java.
- Day 9: Study function parameters, return types, and method overloading.

*Day 10-12:*
- Day 10: Understand the basics of object-oriented programming (OOP) in Java.
- Day 11: Learn about classes, objects, and constructors.
- Day 12: Explore encapsulation, inheritance, and polymorphism.

*Day 13-14:*
- Day 13: Study Java packages and access modifiers (public, private, protected).
- Day 14: Practice creating classes and objects in real-world scenarios.

Week 3: Data Structures and Collections
*Day 15-17:*
- Day 15: Dive into arrays in Java and understand their usage.
- Day 16: Study Java's collection framework and ArrayList.
- Day 17: Learn about iterating through collections using loops and iterators.

*Day 18-19:*
- Day 18: Explore other collection types like LinkedList and HashMap.
- Day 19: Understand when to use different collection types in Java.

*Day 20-21:*
- Day 20: Study exception handling in Java and how to deal with errors.
- Day 21: Practice working with try-catch blocks and handling exceptions effectively.

Week 4: Intermediate Topics and Projects
*Day 22-23:*
- Day 22: Study file handling in Java, including reading and writing files.
- Day 23: Create a small project that involves file operations.

*Day 24-26:*
- Day 24: Learn about multithreading and how to create and manage threads in Java.
- Day 25: Study Java's built-in libraries for networking and socket programming.
- Day 26: Work on a project that involves multithreading or networking.

*Day 27-28:*
- Day 27: Explore more advanced Java topics like JavaFX for GUI development or JDBC for database connectivity.
- Day 28: Work on a more complex project that combines your knowledge from the past weeks.

*Day 29-30:*
- Day 29: Review and revisit any topics you found challenging.
- Day 30: Continue building projects and exploring areas of Java that interest you.

Consider joining Java communities and forums to seek help and advice. Java is a versatile language with many applications, so your learning journey can continue well beyond this roadmap. Good luck!
Javascript  for Everything:

JS + React = Web Development
JS + Three.js = 3D Visualization
JS + Angular = Web Applications

JS + Phaser = Game Development
JS + Vue.js = Progressive Web Apps
JS + TensorFlow.js = Machine Learning

JS + Node.js = Server-Side Development
JS + Electron = DesktopApp Development
JS + React Native = MobileApp Development

#javascript
Top Coding Interview Questions ๐Ÿ’ป

๐Ÿ“ 1. Two Sum Problem
Find two numbers in an array that add up to a target value.
Approach: Use a hash map to store complements for O(n) time.

๐Ÿ“ 2. Reverse a Linked List
Reverse a singly linked list iteratively or recursively.

๐Ÿ“ 3. Binary Tree Traversals
Implement Inorder, Preorder, and Postorder traversals (recursion or stack).

๐Ÿ“ 4. Detect Cycle in a Linked List
Use Floydโ€™s Tortoise and Hare algorithm to detect if a loop exists.

๐Ÿ“ 5. Merge Intervals
Given intervals, merge all overlapping intervals.

๐Ÿ“ 6. Valid Parentheses
Use a stack to check for matching pairs of parentheses/brackets.

๐Ÿ“ 7. Maximum Subarray Sum (Kadaneโ€™s Algorithm)
Find the contiguous subarray with the largest sum.

๐Ÿ“ 8. Search in a Rotated Sorted Array
Modified binary search to find an element in a rotated sorted array.

๐Ÿ“ 9. Implement Queue using Stacks
Use two stacks to simulate a queueโ€™s FIFO behavior.

๐Ÿ“ ๐Ÿ”Ÿ Least Recently Used (LRU) Cache Implementation
Use a hashmap + doubly linked list for O(1) access and updates.

๐Ÿ’ก Pro Tip: Master these core problems and practice explaining your thought process clearly. Also, get comfortable with coding on whiteboard or online editors.
Tech And Events 2026 pinned ยซTop Coding Interview Questions ๐Ÿ’ป ๐Ÿ“ 1. Two Sum Problem Find two numbers in an array that add up to a target value. Approach: Use a hash map to store complements for O(n) time. ๐Ÿ“ 2. Reverse a Linked List Reverse a singly linked list iteratively or recursively.โ€ฆยป
Forwarded from โ““โ’ถโ“โ“˜ โ“Ÿโ“˜โ“’โ“
Algorithms and Data Structures with Python
An interactive learning experience
4 book projects
Cuantum Technologies, 2023
Forwarded from โ““โ’ถโ“โ“˜ โ“Ÿโ“˜โ“’โ“
Algorithms and Data Structures with Python.pdf
6.7 MB
Algorithms and Data Structures with Python
Cuantum Technologies, 2023
โœ… Top Deep Learning Interview Questions & Answers ๐Ÿค–๐Ÿง 

๐Ÿ“ 1. What is Deep Learning?
Answer: A subset of Machine Learning that uses multi-layered neural networks to learn patterns from large datasets. It excels in image recognition, speech processing, and NLP.

๐Ÿ“ 2. What is a Neural Network?
Answer: A system of interconnected nodes (neurons) organized in layers โ€” input, hidden, and output โ€” that process data using weights and activation functions.

๐Ÿ“ 3. What are Activation Functions?
Answer: They introduce non-linearity into the network. Common types:
โฆ ReLU: max(0, x) โ€” fast and widely used
โฆ Sigmoid: outputs between 0 and 1
โฆ Tanh: outputs between -1 and 1

๐Ÿ“ 4. What is Backpropagation?
Answer: The process of updating weights in a neural network by calculating the gradient of the loss function and propagating it backward using chain rule.

๐Ÿ“ 5. What is Dropout?
Answer: A regularization technique that randomly disables neurons during training to prevent overfitting.

๐Ÿ“ 6. What is Transfer Learning?
Answer: Using a pre-trained model on a new, related task. Example: fine-tuning ResNet for medical image classification.

๐Ÿ“ 7. What are CNNs used for?
Answer: Convolutional Neural Networks are ideal for image and video data. They use filters to detect spatial hierarchies like edges, shapes, and textures.

๐Ÿ“ 8. What are RNNs and LSTMs?
Answer:
โฆ RNNs handle sequential data but suffer from vanishing gradients.
โฆ LSTMs solve this using memory cells and gates to retain long-term dependencies.

๐Ÿ“ 9. What are Autoencoders?
Answer: Unsupervised neural networks that compress data into a lower-dimensional form and then reconstruct it. Used in anomaly detection and denoising.

๐Ÿ“ 10. What are GANs?
Answer: Generative Adversarial Networks consist of a Generator (creates fake data) and a Discriminator (detects fakes). Used in image synthesis, deepfakes, and art generation.

๐Ÿ“ 11. What is Regularization in Deep Learning?
Answer: Techniques like L1/L2 penalties, Dropout, and Early Stopping help reduce overfitting by constraining model complexity.

๐Ÿ“ 12. What is the Vanishing Gradient Problem?
Answer: In deep networks, gradients can become too small during backpropagation, making it hard to update weights. Solutions include using ReLU and batch normalization.

๐Ÿ“ 13. What is Batch Normalization?
Answer: It normalizes inputs to each layer, stabilizing learning and speeding up training.

๐Ÿ“ 14. What is the role of Epochs, Batches, and Iterations?
Answer:
โฆ Epoch: One full pass through the dataset
โฆ Batch: Subset of data used in one forward/backward pass
โฆ Iteration: One update of weights per batch

๐Ÿ“ 15. What is the difference between Training and Inference?
Answer:
โฆ Training: Model learns from data
โฆ Inference: Model makes predictions using learned weights

๐Ÿ’ก Pro Tip: Always explain concepts with examples or analogies in interviews. For instance, compare CNN filters to human vision detecting edges and shapes.

โค๏ธ Tap for more AI/ML interview prep!
โคโ€๐Ÿ”ฅ1
IQVIA hiring for Python Developer!!

๐Ÿ“Location: India (Hybrid)
Expected CTC: โ‚น60K โ€“ โ‚น1L per month
Qualification: Bachelorโ€™s/ Masterโ€™s Degree
Experience: Freshers/ Experienced

Full Details & Apply Link:
https://jobs.iqvia.com/en/job/bengaluru/python-developer/24443/87326209296
[21/10, 8:08 pm] : Vodafone hiring for Executive โ€“ Junior Engineer!!

๐Ÿ“Location: Pune, India
Expected CTC: โ‚น30K โ€“ โ‚น70K per month
Qualification: Bachelorโ€™s/ Masterโ€™s Degree
Experience: Freshers/ Experienced

Full Details & Apply Link:
https://jobs.vodafone.com/careers/job/563018693455424
[21/10, 8:08 pm] : eClerx hiring for Analyst!!

๐Ÿ“Location: Pune (Hybrid)
Expected CTC: โ‚น16K โ€“ โ‚น56K per month
Qualification: Graduate / Post Graduate

Full Details & Apply Link:
https://fa-ewji-saasfaprod1.fa.ocs.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1/job/80028
Company Name: Rubrik
Batch: 2026 passouts
Role: Software Internship - Winter 6 months
Stipend : 1.5L/month

Link : https://www.rubrik.com/company/careers/departments/job.7208329?gh_jid=7208329&gh_src=2e352a8a1us
Top Coding Interview Questions ๐Ÿ’ป

๐Ÿ“ 1. Two Sum Problem
Find two numbers in an array that add up to a target value.
Approach: Use a hash map to store complements for O(n) time.

๐Ÿ“ 2. Reverse a Linked List
Reverse a singly linked list iteratively or recursively.

๐Ÿ“ 3. Binary Tree Traversals
Implement Inorder, Preorder, and Postorder traversals (recursion or stack).

๐Ÿ“ 4. Detect Cycle in a Linked List
Use Floydโ€™s Tortoise and Hare algorithm to detect if a loop exists.

๐Ÿ“ 5. Merge Intervals
Given intervals, merge all overlapping intervals.

๐Ÿ“ 6. Valid Parentheses
Use a stack to check for matching pairs of parentheses/brackets.

๐Ÿ“ 7. Maximum Subarray Sum (Kadaneโ€™s Algorithm)
Find the contiguous subarray with the largest sum.

๐Ÿ“ 8. Search in a Rotated Sorted Array
Modified binary search to find an element in a rotated sorted array.

๐Ÿ“ 9. Implement Queue using Stacks
Use two stacks to simulate a queueโ€™s FIFO behavior.

๐Ÿ“ ๐Ÿ”Ÿ Least Recently Used (LRU) Cache Implementation
Use a hashmap + doubly linked list for O(1) access and updates.

๐Ÿ’ก Pro Tip: Master these core problems and practice explaining your thought process clearly. Also, get comfortable with coding on whiteboard or online editors.

For More Resources Check out

https://topmate.io/sumit_kumar80/
*๐Ÿš€ SQL Interview Questions with Answers โ€” Made Easy!*

*1. How to rename a table in SQL?*
Use this command:
ALTER TABLE old_table_name RENAME TO new_table_name;
โ†’ Simple: use ALTER, mention the current name, then RENAME TO and the new name. โœ…

*2. How to use LIKE in SQL?*
Use LIKE to match patterns:
SELECT * FROM employees WHERE first_name LIKE 'Steven';
โ†’ It fetches all rows where first_name is exactly โ€œStevenโ€.

*3. Does dropping a table delete related objects too?*
Yes โœ…: Constraints, indexes, columns, and defaults *inside* the table are deleted.
No โŒ: Views and stored procedures stay โ€” they exist *outside* the table.

*4. What are SQL Constraints?*
They define rules on table data. Common constraints include:
NOT NULL, CHECK, DEFAULT, UNIQUE, PRIMARY KEY, FOREIGN KEY

---

*React โค๏ธ if you're preparing for placements or interviews!*
๐Ÿ‘‰ Access curated *SQL + DSA + Resume tips* here: https://topmate.io/sumit_kumar80/1151675
Narrative is hiring Founding Engineer

For 2021, 2022, 2023, 2024 gards
Location: Remote

https://www.ycombinator.com/companies/narrative/jobs/vWU80OJ-founding-engineer
AI agent is a software system that can perceive its environment, make decisions, and take actions to achieve specific goals with some degree of independence. The word โ€œagentโ€ is key here. Just as a travel agent acts on our behalf to find flights and negotiate deals, an AI agent acts on behalf of users or systems to accomplish tasks without needing constant guidance for every single step.
Top Coding Interview Questions ๐Ÿ’ป

๐Ÿ“ 1. Two Sum Problem
Find two numbers in an array that add up to a target value.
Approach: Use a hash map to store complements for O(n) time.

๐Ÿ“ 2. Reverse a Linked List
Reverse a singly linked list iteratively or recursively.

๐Ÿ“ 3. Binary Tree Traversals
Implement Inorder, Preorder, and Postorder traversals (recursion or stack).

๐Ÿ“ 4. Detect Cycle in a Linked List
Use Floydโ€™s Tortoise and Hare algorithm to detect if a loop exists.

๐Ÿ“ 5. Merge Intervals
Given intervals, merge all overlapping intervals.

๐Ÿ“ 6. Valid Parentheses
Use a stack to check for matching pairs of parentheses/brackets.

๐Ÿ“ 7. Maximum Subarray Sum (Kadaneโ€™s Algorithm)
Find the contiguous subarray with the largest sum.

๐Ÿ“ 8. Search in a Rotated Sorted Array
Modified binary search to find an element in a rotated sorted array.

๐Ÿ“ 9. Implement Queue using Stacks
Use two stacks to simulate a queueโ€™s FIFO behavior.

๐Ÿ“ ๐Ÿ”Ÿ Least Recently Used (LRU) Cache Implementation
Use a hashmap + doubly linked list for O(1) access and updates.

๐Ÿ’ก Pro Tip: Master these core problems and practice explaining your thought process clearly. Also, get comfortable with coding on whiteboard or online editors.

For More Resources Check out

https://topmate.io/sumit_kumar80/