✅ Authentication & Security – Web Development Interview Questions & Answers 🔐🛡️

1️⃣ What is the difference between Authentication and Authorization? 
Answer: 
- Authentication verifies who the user is (e.g., login). 
- Authorization controls what the user can access (e.g., admin vs user access).

2️⃣ What is JWT (JSON Web Token)?
Answer:
A compact token used for stateless authentication. It contains a header, payload (user info), and signature to verify data integrity.

3️⃣ How is JWT more secure than traditional sessions?
Answer:
JWTs are stored on the client-side and signed with a secret. Unlike sessions, they don’t require server-side storage, making them scalable and tamper-evident.

4️⃣ What's the difference between Cookies and LocalStorage?
Answer: 
- Cookies: Automatically sent with each HTTP request, smaller in size, can be HttpOnly. 
- LocalStorage: Larger, persists longer, not sent with requests (manual access only).

5️⃣ What is CORS? Why is it important?
Answer:
CORS (Cross-Origin Resource Sharing) is a browser mechanism that restricts requests from different origins. It protects against unwanted cross-site access.

6️⃣ What is CSRF and how do you prevent it?
Answer:
CSRF (Cross-Site Request Forgery) tricks a logged-in user into submitting unwanted actions. 
Prevention: Use CSRF tokens, SameSite cookies, and avoid storing sensitive data in localStorage.

7️⃣ What is XSS and how do you prevent it? 
Answer: 
XSS (Cross-Site Scripting) injects malicious noscripts into web pages. 
Prevention:  Escape user input, use Content Security Policy (CSP), and sanitize HTML.

8️⃣ What is HTTPS and why is it critical?
Answer: 
HTTPS encrypts data using SSL/TLS. It ensures data privacy, integrity, and trust between client and server.

9️⃣ How do you implement password security in web apps? 
Answer: 
- Store hashed passwords using bcrypt or Argon2 
- Use salting 
- Enforce strong password rules 
- Implement rate-limiting on login attempts 

🔟 What is OAuth?
Answer: 
OAuth is an authorization protocol that allows users to grant access to third-party apps without sharing credentials (e.g., login with Google/Facebook).

💬 Tap ❤️ if you found this useful!

✅ API & Web Services – Web Development Interview Q&A 🌐💬 

1️⃣ What is an API?
Answer:
API (Application Programming Interface) allows communication between two software systems. It defines how requests and responses should be formatted.

2️⃣ REST vs SOAP – What's the difference?
Answer: 
- REST: Lightweight, uses HTTP, supports JSON/XML 
- SOAP: Protocol-based, strict standards, uses XML 
REST is more common for modern web services.

3️⃣ What is RESTful API? 
Answer: 
An API that follows REST principles: 
- Uses HTTP methods (GET, POST, PUT, DELETE) 
- Stateless 
- Has structured endpoints 
- Supports caching

4️⃣ What are HTTP status codes?
Answer: 
Codes returned in response: 
- 200: OK 
- 201: Created 
- 400: Bad Request 
- 401: Unauthorized 
- 403: Forbidden 
- 404: Not Found 
- 500: Server Error

5️⃣ What is GraphQL?
Answer: 
A query language for APIs by Facebook. 
- Client defines the structure of the response 
- Single endpoint 
- Reduces over-fetching and under-fetching of data

6️⃣ What is CORS?
Answer:
Cross-Origin Resource Sharing – A security feature in browsers that blocks requests from other origins unless explicitly allowed by the server.

7️⃣ What is rate limiting?
Answer:
Limits the number of API requests a user/client can make within a time frame to prevent abuse.

8️⃣ What is an API key and how is it used?
Answer:
An API key is a token used to authenticate and authorize access to APIs. It’s passed in headers or query strings.

9️⃣ Difference between PUT and PATCH?
Answer:
- PUT: Replaces the entire resource 
- PATCH: Updates only specified fields

🔟 What is a webhook?
Answer:
A way for servers to send data automatically to other services (e.g., when an event happens). It’s push-based, unlike APIs which are pull-based.

💬 Tap ❤️ if you found this useful!

✅ Git & GitHub Interview Questions & Answers 🧑‍💻🌐 

1️⃣ What is Git? 
A: Git is a distributed version control system to track changes in source code during development.

2️⃣ What is GitHub? 
A: GitHub is a cloud-based platform that hosts Git repositories and supports collaboration, issue tracking, and CI/CD.

3️⃣ Git vs GitHub
- Git: Version control tool (local) 
- GitHub: Hosting service for Git repositories (cloud-based) 

4️⃣ What is a Repository (Repo)?
A: A storage space where your project’s files and history are saved.

5️⃣ Common Git Commands:
- git init → Initialize a repo 
- git clone → Copy a repo 
- git add → Stage changes 
- git commit → Save changes 
- git push → Upload to remote 
- git pull → Fetch and merge from remote 
- git status → Check current state 
- git log → View commit history 

6️⃣ What is a Commit? 
A: A snapshot of your changes. Each commit has a unique ID (hash) and message.

7️⃣ What is a Branch?
A: A separate line of development. The default branch is usually main or master.

8️⃣ What is Merging? 
A: Combining changes from one branch into another.

9️⃣ What is a Pull Request (PR)?
A: A GitHub feature to propose changes, request reviews, and merge code into the main branch.

🔟 What is Forking?
A: Creating a personal copy of someone else’s repo to make changes independently.

1️⃣1️⃣ What is .gitignore? 
A: A file that tells Git which files/folders to ignore (e.g., logs, temp files, env variables).

1️⃣2️⃣ What is Staging Area? 
A: A space where changes are held before committing.

1️⃣3️⃣ Difference between Merge and Rebase
- Merge: Keeps all history, creates a merge commit 
- Rebase: Rewrites history, makes it linear 

1️⃣4️⃣ What is Git Workflow?
A: A set of rules like Git Flow, GitHub Flow, etc., for how teams manage branches and releases.

1️⃣5️⃣ How to Resolve Merge Conflicts?
A: Manually edit the conflicted files, mark resolved, then commit the changes.

💬 Tap ❤️ if you found this useful!

Dear friends 😊,

I want 2026 to be a year of bonding, connections, and real conversations 🤗

For years, we have shared courses, resources, news, and knowledge. But I want to talk with you, ask questions, give answers, and learn together.

With over 10 years in data science, software engineering, and AI 🤓, I have built and shipped real world systems that generated millions of dollars. I have made mistakes, learned valuable lessons, and I am always happy to share my experience openly.

❓ Feel free to ask me anything 
Career, learning paths, real projects, tech decisions, or doubts.

This is why I am reminding you that each channel has its own discussion group. 
You can open it via

channel name → Discuss button

or via the links below 👇

📌 Channels and their discussion groups

• Free courses by Big Data Specialist 
→ linked discussion group

• Data Science / ML / AI 
→ linked discussion group

• GitHub Repositories 
→ linked discussion group

• Coding Interview Preparation 
→ linked discussion group

• Data Visualization 
→ linked discussion group

• Python Learning 
→ linked discussion group

• Tech News 
→ linked discussion group

• Logic Quest 
→ linked discussion group

• Data Science Research Papers 
→ linked discussion group

• Web Development 
→ linked discussion group

• AI Revolution 
→ linked discussion group

• Talks with ChatGPT 
→ linked discussion group

• Programming Memes 
→ linked discussion group

• Code Comics 
→ linked discussion group

💬 Join the conversations, ask questions, share your journey. 
Looking forward to connecting with you all 🚀

I will share this message across all our channels so everyone can see it. Hope you do not mind 🙏 
See you in the discussions 👋

✅ Git & GitHub Interview Questions & Answers (Part 2) 🧠💻

1️⃣6️⃣ What is a Tag in Git?
A: A tag marks a specific point in history, often used for releases (e.g., v1.0).

1️⃣7️⃣ Difference between Soft, Mixed, and Hard Reset? 
- git reset --soft → Moves HEAD, keeps changes staged 
- git reset --mixed (default) → Moves HEAD, unstages changes 
- git reset --hard → Removes all changes

1️⃣8️⃣ What is Git Revert?
A: Reverts a commit by creating a new one that undoes changes, keeping history intact.

1️⃣9️⃣ What is Cherry Pick? 
A: Apply a specific commit from one branch to another without merging the whole branch.

2️⃣0️⃣ What is Git Stash?
A: Temporarily saves uncommitted changes so you can switch branches safely.

2️⃣1️⃣ What is HEAD in Git? 
A: A pointer to the current branch reference or latest commit in your working directory.

2️⃣2️⃣ What is the difference between origin and upstream?
- origin: Default remote repo you cloned from 
- upstream: Original repo you forked from (used in collaboration)

2️⃣3️⃣ What is Fast-forward Merge?
A: When no divergence, Git just moves the branch pointer forward — no new commit needed.

2️⃣4️⃣ Git Fetch vs Git Pull
- Fetch: Downloads changes without merging
- Pull:  Fetch + Merge in one step

2️⃣5️⃣ How to Undo Last Commit? 

git reset --soft HEAD~1   # Keeps changes staged
git reset --hard HEAD~1   # Discards changes completely

💬 Tap ❤️ for more!

✅ CI/CD Pipeline Interview Questions & Answers ⚙️🚀 

1️⃣ What is CI/CD?
A: CI/CD stands for Continuous Integration and Continuous Deployment/Delivery — practices that automate code integration, testing, and deployment.

2️⃣ What is Continuous Integration (CI)?
A: Developers frequently merge code into a shared repo. Each merge triggers automated builds & tests to detect issues early.

3️⃣ What is Continuous Deployment/Delivery (CD)? 
- Delivery: Code is automatically prepared for release but needs manual approval. 
- Deployment: Code is automatically pushed to production after passing tests.

4️⃣ Key Stages of a CI/CD Pipeline:
1. Code 
2. Build 
3. Test 
4. Release 
5. Deploy 
6. Monitor

5️⃣ What tools are used in CI/CD?
- CI: Jenkins, GitHub Actions, CircleCI, GitLab CI 
- CD: ArgoCD, Spinnaker, AWS CodeDeploy

6️⃣ What is a Build Pipeline?
A: A sequence of automated steps to compile, test, and prepare code for deployment.

7️⃣ What is a Webhook?
A: A trigger that starts the pipeline when new code is pushed to the repository.

8️⃣ What are Artifacts?
A: Output files generated after a build, like JARs, Docker images, etc., stored for deployment.

9️⃣ What is Rollback?
A: Reverting to the previous stable version if a deployment fails.

🔟 Why is CI/CD important? 
A: It increases code quality, reduces bugs, speeds up delivery, and ensures smoother collaboration.

💬 Tap ❤️ for more!

✅ Docker Interview Questions & Answers 🐳🔧 

1️⃣ What is Docker?
A: Docker is an open-source platform that uses containerization to package, distribute, and run applications in isolated environments called containers.

2️⃣ What is a Container?
A: A lightweight, standalone executable package including code, runtime, libraries, and settings—runs consistently across any system.

3️⃣ Docker vs Virtual Machines (VMs) 
- Docker: Shares host OS kernel, fast & efficient (MBs) 
- VMs: Full OS per instance, heavier (GBs), slower startup 

4️⃣ What is a Docker Image?
A: A read-only template (like a snapshot) used to create containers; built from a Dockerfile with layers of instructions.

5️⃣ Common Docker Commands:
- docker run → Start a container from an image 
- docker build → Create an image from Dockerfile 
- docker ps → List running containers 
- docker images → List available images 
- docker stop → Stop a running container 
- docker pull → Download an image from registry 
- docker push → Upload image to registry 

6️⃣ What is a Dockerfile?
A: A text file with instructions to automate building Docker images (e.g., FROM, RUN, COPY, CMD).

7️⃣ What is Docker Compose?
A: A tool for defining and running multi-container apps using YAML files—manages services, networks, volumes.

*8️⃣ What is Docker Hub?* 
*A:* A public registry for storing and sharing Docker images, like GitHub for code.

9️⃣ What is Docker Swarm?
A: Docker's native clustering/orchestration tool for managing a swarm of Docker nodes and deploying services.

🔟 What are Docker Volumes? 
A: Persistent storage for containers; data survives container lifecycle—mount host directories or use named volumes.

1️⃣1️⃣ What is Docker Networking?
A: Connects containers and services; modes include bridge (default), host, overlay (for Swarm), none.

1️⃣2️⃣ How to Build a Docker Image?
A: Write a Dockerfile, run docker build -t image-name. in the directory—tags it for easy reference.

1️⃣3️⃣ Difference between CMD and ENTRYPOINT?
- CMD: Default args for executable; can be overridden 
- ENTRYPOINT: Sets container's executable; args append to it 

1️⃣4️⃣ What is Container Orchestration? 
A: Managing multiple containers at scale; tools like Kubernetes, Docker Swarm handle deployment, scaling, load balancing.

1️⃣5️⃣ How to Handle Docker Security? 
A: Run as non-root, scan images (e.g., Trivy), use minimal base images, limit privileges, and keep software updated.

💬 Tap ❤️ if you found this useful!

✅ Deployment Interview Questions & Answers ☁️🚀 

1️⃣ What is Deployment?
A: Deployment is the process of making a web application live and accessible to users by hosting it on a server or platform.

2️⃣ What is Netlify? 
A: Netlify is a cloud platform to host static websites and frontend frameworks (like React, Vue). It supports continuous deployment from Git. 
Features: Free SSL, custom domain, form handling, serverless functions, ideal for JAMstack apps.

3️⃣ What is Heroku? 
A: Heroku is a platform-as-a-service (PaaS) that lets you deploy full-stack apps easily using Git. 
Features: Supports Node.js, Python, Ruby, etc., free tier (apps sleep when inactive), one-click deployment & add-ons like PostgreSQL.

4️⃣ What is Vercel?
A: Vercel is a frontend deployment platform optimized for React and especially Next.js apps. 
Features: Fast global CDN, serverless functions, instant preview links for each commit.

5️⃣ How does Continuous Deployment work?
A: You connect your GitHub repo to Netlify, Heroku, or Vercel. On every push, the app builds and deploys automatically.

6️⃣ How do you deploy on Netlify?
A: Push your code to GitHub → Connect repo to Netlify → Configure build settings → Click "Deploy".

7️⃣ How do you deploy on Heroku? 
A: Install Heroku CLI → Run: git push heroku main → App will be deployed on a Heroku domain.

8️⃣ How do you deploy on Vercel?
A: Login to Vercel → Import Git repo → Set up framework and build command → Deploy.

9️⃣ Which platform is best for static sites?
A: Netlify or Vercel – both offer free tiers, CDN, and fast performance.

🔟 How to handle environment variables in these platforms?
A:
- Netlify: Go to Site Settings → Environment 
- Heroku: Use heroku config:set VAR_NAME=value 
- Vercel: Project → Settings → Environment Variables 

💬 Tap ❤️ for more!

6 Space-Efficient Data Structures

Coding Tip For Beginners

Cloud Computing Cheatsheet

Data Analyst Interview Prep: All you need to know

awesome-interview-questions

A massive collection of interview questions for software engineers, data scientists, QA testers, DevOps, and mobile developers. Categorized by role and technology.

Creator: DOP251
Stars ⭐️: 80,500
Forked by: 9,300

Github Repo:
https://github.com/DopplerHQ/awesome-interview-questions

#Interviews #Careers #Tech
➖➖➖➖➖➖➖➖➖➖➖➖➖➖
Join @github_repositories_bds for more cool repositories. This channel belongs to @bigdataspecialist group

✅ Top 50 DSA (Data Structures & Algorithms) Interview Questions 📚⚙️

1. What is a Data Structure? 
2. What are the different types of data structures? 
3. What is the difference between Array and Linked List? 
4. How does a Stack work? 
5. What is a Queue? Difference between Queue and Deque? 
6. What is a Priority Queue? 
7. What is a Hash Table and how does it work? 
8. What is the difference between HashMap and HashSet? 
9. What are Trees? Explain Binary Tree. 
10. What is a Binary Search Tree (BST)? 
11. What is the difference between BFS and DFS? 
12. What is a Heap? 
13. What is a Trie? 
14. What is a Graph? 
15. Difference between Directed and Undirected Graph? 
16. What is the time complexity of common operations in arrays and linked lists? 
17. What is recursion? 
18. What are base case and recursive case? 
19. What is dynamic programming? 
20. Difference between Memoization and Tabulation? 
21. What is the Sliding Window technique? 
22. Explain Two-Pointer technique. 
23. What is the Binary Search algorithm? 
24. What is the Merge Sort algorithm? 
25. What is the Quick Sort algorithm? 
26. Difference between Merge Sort and Quick Sort? 
27. What is Insertion Sort and how does it work? 
28. What is Selection Sort?
29. What is Bubble Sort and its drawbacks? 
30. What is the time and space complexity of sorting algorithms? 
31. What is Backtracking? 
32. Explain the N-Queens Problem. 
33. What is the Kadane's Algorithm? 
34. What is Floyd’s Cycle Detection Algorithm? 
35. What is the Union-Find (Disjoint Set) algorithm? 
36. What are topological sorting and its uses? 
37. What is Dijkstra's Algorithm? 
38. What is Bellman-Ford Algorithm? 
39. What is Kruskal’s Algorithm? 
40. What is Prim’s Algorithm? 
41. What is Longest Common Subsequence (LCS)? 
42. What is Longest Increasing Subsequence (LIS)? 
43. What is a Palindrome Substring problem? 
44. What is the difference between greedy and dynamic programming? 
45. What is Big-O notation? 
46. What is the difference between time and space complexity? 
47. How to find the time complexity of a recursive function? 
48. What are amortized time complexities? 
49. What is tail recursion? 
50. How do you approach solving a coding problem in interviews?

💬 Tap ❤️ for the detailed answers!

✅ Top DSA Interview Questions with Answers: Part-1 🧠

1. What is a Data Structure? 
A data structure is a way to organize, store, and manage data efficiently so it can be accessed and modified easily. Examples: Arrays, Linked Lists, Stacks, Queues, Trees, Graphs.

2. What are the different types of data structures? 
- Linear: Arrays, Linked Lists, Stacks, Queues 
- Non-linear: Trees, Graphs 
- Hash-based: Hash Tables, Hash Maps 
- Dynamic: Heaps, Tries, Disjoint Sets

3. What is the difference between Array and Linked List? 
- Array: Fixed size, index-based access (O(1)), insertion/deletion is expensive 
- Linked List: Dynamic size, sequential access (O(n)), efficient insertion/deletion at any position

4. How does a Stack work? 
A Stack follows LIFO (Last In, First Out) principle. 
- Operations: push() to add, pop() to remove, peek() to view top 
- Used in: undo mechanisms, recursion, parsing

5. What is a Queue? Difference between Queue and Deque? 
A Queue follows FIFO (First In, First Out). 
- Deque (Double-Ended Queue): Allows insertion/removal from both ends. 
- Used in scheduling, caching, BFS traversal.

6. What is a Priority Queue? 
A type of queue where each element has a priority.
- Higher priority elements are dequeued before lower ones. 
- Implemented using heaps.

7. What is a Hash Table and how does it work? 
A structure that maps keys to values using a hash function. 
- Allows O(1) average-case lookup, insert, delete. 
- Handles collisions using chaining or open addressing.

8. What is the difference between HashMap and HashSet? 
- HashMap: Stores key-value pairs 
- HashSet: Stores only unique keys (no values) 
Both use hash tables internally.

9. What are Trees? Explain Binary Tree. 
A tree is a non-linear structure with nodes connected hierarchically. 
- Binary Tree: Each node has at most 2 children (left, right). 
Used in hierarchical data, parsers, expression trees.

10. What is a Binary Search Tree (BST)? 
A special binary tree where: 
- Left child < Node < Right child 
- Enables fast lookup, insert, and delete in O(log n) (average case). 
Maintains sorted structure.

Double Tap ♥️ For Part-2

✅ Top DSA Interview Questions with Answers: Part-2 🧠

11. What is the difference between BFS and DFS? 
- BFS (Breadth-First Search): Explores neighbors first (level by level). Uses a queue. 
- DFS (Depth-First Search): Explores depth (child nodes) first. Uses a stack or recursion. 
Used in graph/tree traversals, pathfinding, cycle detection.

12. What is a Heap? 
A binary tree with heap properties: 
- Max-Heap: Parent ≥ children 
- Min-Heap: Parent ≤ children 
Used in priority queues, heap sort, scheduling algorithms.

13. What is a Trie? 
A tree-like data structure used to store strings. 
Each node represents a character. 
Used in: autocomplete, spell-checkers, prefix search.

14. What is a Graph? 
A graph is a collection of nodes (vertices) and edges. 
- Can be directed/undirected, weighted/unweighted. 
Used in: networks, maps, recommendation systems.

15. Difference between Directed and Undirected Graph? 
- Directed: Edges have direction (A → B ≠ B → A) 
- Undirected: Edges are bidirectional (A — B) 
Used differently based on relationships (e.g., social networks vs. web links).

16. What is the time complexity of common operations in arrays and linked lists? 
- Array: 
  - Access: O(1)
- Insert/Delete: O(n) 
- Linked List: 
  - Access: O(n) 
  - Insert/Delete: O(1) at head

17. What is recursion? 
When a function calls itself to solve a smaller subproblem. 
Requires a base case to stop infinite calls. 
Used in: tree traversals, backtracking, divide & conquer.

18. What are base case and recursive case? 
- Base Case: Condition that ends recursion 
- Recursive Case: Part where the function calls itself 
Example: 

def fact(n):
    if n == 0: return 1   # base case
    return n * fact(n-1)  # recursive case

19. What is dynamic programming? 
An optimization technique that solves problems by breaking them into overlapping subproblems and storing their results (memoization). 
Used in: Fibonacci, knapsack, LCS.

20. Difference between Memoization and Tabulation? 
- Memoization (Top-down): Uses recursion + caching 
- Tabulation (Bottom-up): Uses iteration + table 
Both store solutions to avoid redundant calculations.

Double Tap ♥️ For Part-3

✅ Top DSA Interview Questions with Answers: Part-3 🧠

21. What is the Sliding Window technique? 
It’s an optimization method used to reduce time complexity in problems involving arrays or strings. You create a "window" over a subset of data and slide it as needed, updating results on the go. 
Example use case: Find the maximum sum of any k consecutive elements in an array.

22. Explain the Two-Pointer technique. 
This involves using two indices (pointers) to traverse a data structure, usually from opposite ends or the same direction. It's helpful for searching pairs or reversing sequences efficiently. 
Common problems: Two-sum, palindrome check, sorted array partitioning.

23. What is the Binary Search algorithm? 
It’s an efficient algorithm to find an element in a sorted array by repeatedly dividing the search range in half. 
Time Complexity: O(log n) 
Key idea: Compare the target with the middle element and eliminate half the array each step.

24. What is the Merge Sort algorithm? 
A divide-and-conquer sorting algorithm that splits the array into halves, sorts them recursively, and then merges them. 
Time Complexity: O(n log n) 
Stable? Yes 
Extra space? Yes, due to merging.

25. What is the Quick Sort algorithm?
It chooses a pivot, partitions the array so elements < pivot are left, and > pivot are right, then recursively sorts both sides. 
Time Complexity: Avg – O(n log n), Worst – O(n²) 
Fast in practice, but not stable.

26. Difference between Merge Sort and Quick Sort 
- Merge Sort is stable, consistent in performance (O(n log n)), but uses extra space. 
- Quick Sort is faster in practice and works in-place, but may degrade to O(n²) if pivot is poorly chosen.

27. What is Insertion Sort and how does it work? 
It builds the sorted list one item at a time by comparing and inserting items into their correct position. 
Time Complexity: O(n²) 
Best Case (nearly sorted): O(n) 
Stable? Yes 
Space: O(1)

28. What is Selection Sort? 
It finds the smallest element from the unsorted part and swaps it with the beginning. 
Time Complexity: O(n²) 
Space: O(1) 
Stable? No 
Rarely used due to inefficiency.

29. What is Bubble Sort and its drawbacks? 
It repeatedly compares and swaps adjacent elements if out of order. 
Time Complexity: O(n²) 
Space: O(1) 
Drawback: Extremely slow for large data. Educational, not practical.

30. What is the time and space complexity of common sorting algorithms?
- Bubble Sort → Time: O(n²), Space: O(1), Stable: Yes 
- Selection Sort → Time: O(n²), Space: O(1), Stable: No 
- Insertion Sort → Time: O(n²), Space: O(1), Stable: Yes 
- Merge Sort → Time: O(n log n), Space: O(n), Stable: Yes 
- Quick Sort → Avg Time: O(n log n), Worst: O(n²), Space: O(log n), Stable: No

Double Tap ♥️ For Part-4

✅ Top DSA Interview Questions with Answers: Part-4 📘⚙️

4️⃣1️⃣ What is Longest Common Subsequence (LCS)? 
LCS is the longest sequence that appears in the same order in both strings but not necessarily contiguously. 
Used in: diff tools, DNA sequencing. 
Approach: Dynamic Programming, O(n × m)

4️⃣2️⃣ What is Longest Increasing Subsequence (LIS)? 
It is the longest subsequence where each element is greater than the previous one. 
Approach: 
- DP: O(n²) 
- Binary Search: O(n log n)

4️⃣3️⃣ What is a Palindrome Substring problem? 
Find the longest or total number of substrings that are palindromes. 
Approach: 
- Expand Around Center (O(n²)) 
- DP Table 
- Manacher’s Algorithm (O(n))

4️⃣4️⃣ Difference between Greedy and Dynamic Programming? 
- Greedy: Makes the best local choice, may miss optimal global solution. 
- DP: Explores all choices with memoization, guarantees optimality. 
Example: 
- Greedy: Coin change (not always optimal) 
- DP: Coin change (optimal)

4️⃣5️⃣ What is Big-O Notation? 
It expresses time/space complexity in terms of input size n. 
Examples: 
- O(1): Constant 
- O(n): Linear 
- O(n²): Quadratic 
- O(log n): Binary Search

4️⃣6️⃣ Time vs Space Complexity? 
- Time Complexity: Time taken vs input size
- Space Complexity: Memory used 
Goal: Optimize both without sacrificing correctness.

4️⃣7️⃣ How to find time complexity of recursive function? 
Use Recurrence Relation 
Example: 
T(n) = T(n/2) + O(1) → O(log n) 
T(n) = 2T(n/2) + O(n) → O(n log n)

4️⃣8️⃣ What are Amortized Time Complexities? 
It’s the average time per operation over a sequence of operations. 
Example: Dynamic array resizing: 
- Most inserts: O(1) 
- Occasional resize: O(n) 
- Amortized: O(1)

4️⃣9️⃣ What is Tail Recursion? 
Recursive call is the last operation in the function. 
Benefit: Optimized by compilers to reduce stack usage. 
Example: 

def factorial(n, acc=1):
    if n == 0:
        return acc
    return factorial(n-1, acc*n)

5️⃣0️⃣ How to solve coding questions in interviews? 
- Understand the problem 
- Ask clarifying questions 
- Think out loud 
- Start with brute force 
- Optimize step-by-step 
- Test edge cases 
- Use clean, modular code

💬 Tap ❤️ for more!

Useful Algorithms for System Design Interviews