DSA INTERVIEW QUESTIONS AND ANSWERS
1. What is the difference between file structure and storage structure?
The difference lies in the memory area accessed. Storage structure refers to the data structure in the memory of the computer system,
whereas file structure represents the storage structure in the auxiliary memory.
2. Are linked lists considered linear or non-linear Data Structures?
Linked lists are considered both linear and non-linear data structures depending upon the application they are used for. When used for
access strategies, it is considered as a linear data-structure. When used for data storage, it is considered a non-linear data structure.
3. How do you reference all of the elements in a one-dimension array?
All of the elements in a one-dimension array can be referenced using an indexed loop as the array subscript so that the counter runs
from 0 to the array size minus one.
4. What are dynamic Data Structures? Name a few.
They are collections of data in memory that expand and contract to grow or shrink in size as a program runs. This enables the programmer
to control exactly how much memory is to be utilized.Examples are the dynamic array, linked list, stack, queue, and heap.
5. What is a Dequeue?
It is a double-ended queue, or a data structure, where the elements can be inserted or deleted at both ends (FRONT and REAR).
6. What operations can be performed on queues?
enqueue() adds an element to the end of the queue
dequeue() removes an element from the front of the queue
init() is used for initializing the queue
isEmpty tests for whether or not the queue is empty
The front is used to get the value of the first data item but does not remove it
The rear is used to get the last item from a queue.
7. What is the merge sort? How does it work?
Merge sort is a divide-and-conquer algorithm for sorting the data. It works by merging and sorting adjacent data to create bigger sorted
lists, which are then merged recursively to form even bigger sorted lists until you have one single sorted list.
8.How does the Selection sort work?
Selection sort works by repeatedly picking the smallest number in ascending order from the list and placing it at the beginning. This process is repeated moving toward the end of the list or sorted subarray.
Scan all items and find the smallest. Switch over the position as the first item. Repeat the selection sort on the remaining N-1 items. We always iterate forward (i from 0 to N-1) and swap with the smallest element (always i).
Time complexity: best case O(n2); worst O(n2)
Space complexity: worst O(1)
9. What are the applications of graph Data Structure?
Transport grids where stations are represented as vertices and routes as the edges of the graph
Utility graphs of power or water, where vertices are connection points and edge the wires or pipes connecting them
Social network graphs to determine the flow of information and hotspots (edges and vertices)
Neural networks where vertices represent neurons and edge the synapses between them
10. What is an AVL tree?
An AVL (Adelson, Velskii, and Landi) tree is a height balancing binary search tree in which the difference of heights of the left
and right subtrees of any node is less than or equal to one. This controls the height of the binary search tree by not letting
it get skewed. This is used when working with a large data set, with continual pruning through insertion and deletion of data.
11. Differentiate NULL and VOID ?
Null is a value, whereas Void is a data type identifier
Null indicates an empty value for a variable, whereas void indicates pointers that have no initial size
Null means it never existed; Void means it existed but is not in effect
Credits: https://t.me/free4unow_backup
All the best ๐๐
1. What is the difference between file structure and storage structure?
The difference lies in the memory area accessed. Storage structure refers to the data structure in the memory of the computer system,
whereas file structure represents the storage structure in the auxiliary memory.
2. Are linked lists considered linear or non-linear Data Structures?
Linked lists are considered both linear and non-linear data structures depending upon the application they are used for. When used for
access strategies, it is considered as a linear data-structure. When used for data storage, it is considered a non-linear data structure.
3. How do you reference all of the elements in a one-dimension array?
All of the elements in a one-dimension array can be referenced using an indexed loop as the array subscript so that the counter runs
from 0 to the array size minus one.
4. What are dynamic Data Structures? Name a few.
They are collections of data in memory that expand and contract to grow or shrink in size as a program runs. This enables the programmer
to control exactly how much memory is to be utilized.Examples are the dynamic array, linked list, stack, queue, and heap.
5. What is a Dequeue?
It is a double-ended queue, or a data structure, where the elements can be inserted or deleted at both ends (FRONT and REAR).
6. What operations can be performed on queues?
enqueue() adds an element to the end of the queue
dequeue() removes an element from the front of the queue
init() is used for initializing the queue
isEmpty tests for whether or not the queue is empty
The front is used to get the value of the first data item but does not remove it
The rear is used to get the last item from a queue.
7. What is the merge sort? How does it work?
Merge sort is a divide-and-conquer algorithm for sorting the data. It works by merging and sorting adjacent data to create bigger sorted
lists, which are then merged recursively to form even bigger sorted lists until you have one single sorted list.
8.How does the Selection sort work?
Selection sort works by repeatedly picking the smallest number in ascending order from the list and placing it at the beginning. This process is repeated moving toward the end of the list or sorted subarray.
Scan all items and find the smallest. Switch over the position as the first item. Repeat the selection sort on the remaining N-1 items. We always iterate forward (i from 0 to N-1) and swap with the smallest element (always i).
Time complexity: best case O(n2); worst O(n2)
Space complexity: worst O(1)
9. What are the applications of graph Data Structure?
Transport grids where stations are represented as vertices and routes as the edges of the graph
Utility graphs of power or water, where vertices are connection points and edge the wires or pipes connecting them
Social network graphs to determine the flow of information and hotspots (edges and vertices)
Neural networks where vertices represent neurons and edge the synapses between them
10. What is an AVL tree?
An AVL (Adelson, Velskii, and Landi) tree is a height balancing binary search tree in which the difference of heights of the left
and right subtrees of any node is less than or equal to one. This controls the height of the binary search tree by not letting
it get skewed. This is used when working with a large data set, with continual pruning through insertion and deletion of data.
11. Differentiate NULL and VOID ?
Null is a value, whereas Void is a data type identifier
Null indicates an empty value for a variable, whereas void indicates pointers that have no initial size
Null means it never existed; Void means it existed but is not in effect
Credits: https://t.me/free4unow_backup
All the best ๐๐
โค6๐6
Preparing for a Java developer interview can be a bit overwhelming,
but breaking it down by difficulty and experience level can make it more manageable.
Whether you're a fresher or an experienced developer, here's a guide to help you focus your preparation and walk into your interview with confidence.
๐๐ผ๐ฟ ๐๐น๐น ๐๐ฒ๐๐ฒ๐น๐ (๐๐ป๐ฐ๐น๐๐ฑ๐ถ๐ป๐ด ๐๐ฟ๐ฒ๐๐ต๐ฒ๐ฟ๐)
โค Topic 1: Project Flow and Architecture (Medium)
- These questions are designed to gauge your understanding of project development, teamwork, and problem-solving. Be ready to discuss a project you've worked on, including the tech stack used, the challenges you faced, and how you overcame them.
๐๐ผ๐ฟ ๐๐ฒ๐๐ฒ๐น๐ผ๐ฝ๐ฒ๐ฟ๐ ๐๐ถ๐๐ต ๐๐ผ๐ฟ๐ฒ ๐๐ฎ๐๐ฎ ๐ฆ๐ธ๐ถ๐น๐น๐ (๐ญ-๐ฏ ๐ฌ๐ฒ๐ฎ๐ฟ๐ ๐๐ ๐ฝ๐ฒ๐ฟ๐ถ๐ฒ๐ป๐ฐ๐ฒ)
โค Topic 2: Core Java (Medium to Hard)
- Fundamental Java concepts. You'll likely face questions on strings, object-oriented programming (OOP), collections, exception handling, and multithreading.
๐๐ผ๐ฟ ๐๐ ๐ฝ๐ฒ๐ฟ๐ถ๐ฒ๐ป๐ฐ๐ฒ๐ฑ ๐๐ฒ๐๐ฒ๐น๐ผ๐ฝ๐ฒ๐ฟ๐ (๐ฏ+ ๐ฌ๐ฒ๐ฎ๐ฟ๐ ๐๐ ๐ฝ๐ฒ๐ฟ๐ถ๐ฒ๐ป๐ฐ๐ฒ)
โค Topic 3: Java 8/11/17 Features (Hard)
- This is where the interview gets more challenging. You'll asked advanced features introduced in recent Java versions, such as lambda expressions, functional interfaces, the Stream API, and modules.
โค Topic 4: Spring Framework, Spring Boot, Microservices, and REST API (Hard)
- Expect questions on popular frameworks and backend development architectures. Be prepared to explain concepts like dependency injection, Spring MVC, and microservices.
๐๐ผ๐ฟ ๐๐ฒ๐๐ฒ๐น๐ผ๐ฝ๐ฒ๐ฟ๐ ๐๐ถ๐๐ต ๐๐ฎ๐๐ฎ๐ฏ๐ฎ๐๐ฒ ๐๐ ๐ฝ๐ฒ๐ฟ๐ถ๐ฒ๐ป๐ฐ๐ฒ
โค Topic 5: Hibernate/Spring Data JPA/Database (Hard)
- This section focuses on data persistence with JPA and working with relational (SQL) or NoSQL databases. Be ready to discuss JPA repositories, entity relationships, and complex querying techniques.
๐๐ผ๐ฟ ๐๐ฒ๐๐ฒ๐น๐ผ๐ฝ๐ฒ๐ฟ๐ ๐๐ถ๐๐ต ๐๐ฑ๐ฑ๐ถ๐๐ถ๐ผ๐ป๐ฎ๐น ๐ฆ๐ธ๐ถ๐น๐น๐
โค Topic 6: Coding (Medium to Hard)
- You'll likely encounter coding challenges related to data structures and algorithms (DSA), as well as using the Java Stream API.
โค Topic 7: DevOps Questions on Deployment Tools (Advanced)
- These questions are often posed by managers or leads, especially if you're applying for a role that involves DevOps. Be prepared to discuss deployment tools like Jenkins, Kubernetes, and cloud platforms.
โค Topic 8: Best Practices (Medium)
- Interviewers may ask about design patterns like Singletons, Factories, or Observers to see how well you write clean, reusable code.
All the best ๐๐
but breaking it down by difficulty and experience level can make it more manageable.
Whether you're a fresher or an experienced developer, here's a guide to help you focus your preparation and walk into your interview with confidence.
๐๐ผ๐ฟ ๐๐น๐น ๐๐ฒ๐๐ฒ๐น๐ (๐๐ป๐ฐ๐น๐๐ฑ๐ถ๐ป๐ด ๐๐ฟ๐ฒ๐๐ต๐ฒ๐ฟ๐)
โค Topic 1: Project Flow and Architecture (Medium)
- These questions are designed to gauge your understanding of project development, teamwork, and problem-solving. Be ready to discuss a project you've worked on, including the tech stack used, the challenges you faced, and how you overcame them.
๐๐ผ๐ฟ ๐๐ฒ๐๐ฒ๐น๐ผ๐ฝ๐ฒ๐ฟ๐ ๐๐ถ๐๐ต ๐๐ผ๐ฟ๐ฒ ๐๐ฎ๐๐ฎ ๐ฆ๐ธ๐ถ๐น๐น๐ (๐ญ-๐ฏ ๐ฌ๐ฒ๐ฎ๐ฟ๐ ๐๐ ๐ฝ๐ฒ๐ฟ๐ถ๐ฒ๐ป๐ฐ๐ฒ)
โค Topic 2: Core Java (Medium to Hard)
- Fundamental Java concepts. You'll likely face questions on strings, object-oriented programming (OOP), collections, exception handling, and multithreading.
๐๐ผ๐ฟ ๐๐ ๐ฝ๐ฒ๐ฟ๐ถ๐ฒ๐ป๐ฐ๐ฒ๐ฑ ๐๐ฒ๐๐ฒ๐น๐ผ๐ฝ๐ฒ๐ฟ๐ (๐ฏ+ ๐ฌ๐ฒ๐ฎ๐ฟ๐ ๐๐ ๐ฝ๐ฒ๐ฟ๐ถ๐ฒ๐ป๐ฐ๐ฒ)
โค Topic 3: Java 8/11/17 Features (Hard)
- This is where the interview gets more challenging. You'll asked advanced features introduced in recent Java versions, such as lambda expressions, functional interfaces, the Stream API, and modules.
โค Topic 4: Spring Framework, Spring Boot, Microservices, and REST API (Hard)
- Expect questions on popular frameworks and backend development architectures. Be prepared to explain concepts like dependency injection, Spring MVC, and microservices.
๐๐ผ๐ฟ ๐๐ฒ๐๐ฒ๐น๐ผ๐ฝ๐ฒ๐ฟ๐ ๐๐ถ๐๐ต ๐๐ฎ๐๐ฎ๐ฏ๐ฎ๐๐ฒ ๐๐ ๐ฝ๐ฒ๐ฟ๐ถ๐ฒ๐ป๐ฐ๐ฒ
โค Topic 5: Hibernate/Spring Data JPA/Database (Hard)
- This section focuses on data persistence with JPA and working with relational (SQL) or NoSQL databases. Be ready to discuss JPA repositories, entity relationships, and complex querying techniques.
๐๐ผ๐ฟ ๐๐ฒ๐๐ฒ๐น๐ผ๐ฝ๐ฒ๐ฟ๐ ๐๐ถ๐๐ต ๐๐ฑ๐ฑ๐ถ๐๐ถ๐ผ๐ป๐ฎ๐น ๐ฆ๐ธ๐ถ๐น๐น๐
โค Topic 6: Coding (Medium to Hard)
- You'll likely encounter coding challenges related to data structures and algorithms (DSA), as well as using the Java Stream API.
โค Topic 7: DevOps Questions on Deployment Tools (Advanced)
- These questions are often posed by managers or leads, especially if you're applying for a role that involves DevOps. Be prepared to discuss deployment tools like Jenkins, Kubernetes, and cloud platforms.
โค Topic 8: Best Practices (Medium)
- Interviewers may ask about design patterns like Singletons, Factories, or Observers to see how well you write clean, reusable code.
All the best ๐๐
โค8๐2
5 Sites to Prepare for Tech Interviews:
1. Leetcode
๐ leetcode.com
2. Interviewing .io
๐ interviewing.io
3. Coding Interview University
๐ https://github.com/jwasham/coding-interview-university
4. JavaScript Algorithms
๐ https://github.com/trekhleb/javascript-algorithms
5. JavaScript Questions
๐ https://github.com/lydiahallie/javascript-questions
โก๏ธ Give Reactions ๐ค
1. Leetcode
๐ leetcode.com
2. Interviewing .io
๐ interviewing.io
3. Coding Interview University
๐ https://github.com/jwasham/coding-interview-university
4. JavaScript Algorithms
๐ https://github.com/trekhleb/javascript-algorithms
5. JavaScript Questions
๐ https://github.com/lydiahallie/javascript-questions
โก๏ธ Give Reactions ๐ค
๐11โค8๐1
International students are having a tough time securing a full time job in Tech.
Reasons
1. Market has limited opportunities for entry level junior data/software engineers.
2. People having 0-3 years of workex are competing against job seekers having 8+ years of seasoned experience.
3. Lot of companies have their operations in off-shore, as companies grow the headcount of offshore>>onshore.
Solution :
Build up relevant skillsets, latch on to the newer technologies that will bring you at par with experienced candidates.
Build apps/ai models/data pipelines/dashboards that tracks live data.
People who have secured job has everything to lose and their routine is restricted and have limitied time to be dedicated to learning. You on the other hand have nothing to lose and everything to gain.
Request for that coffee chat.
Take that certification exam.
Attend that quarterly event.
Success is sweeter when its delayed.
Reasons
1. Market has limited opportunities for entry level junior data/software engineers.
2. People having 0-3 years of workex are competing against job seekers having 8+ years of seasoned experience.
3. Lot of companies have their operations in off-shore, as companies grow the headcount of offshore>>onshore.
Solution :
Build up relevant skillsets, latch on to the newer technologies that will bring you at par with experienced candidates.
Build apps/ai models/data pipelines/dashboards that tracks live data.
People who have secured job has everything to lose and their routine is restricted and have limitied time to be dedicated to learning. You on the other hand have nothing to lose and everything to gain.
Request for that coffee chat.
Take that certification exam.
Attend that quarterly event.
Success is sweeter when its delayed.
๐17๐ฅฐ2
Leetcode is a tool to learn
Neetcode is a tool to learn
CodeChef is a tool to learn
Codeforces is a tool to learn
HackerRank is a tool to learn
GeeksForGeeks is a tool to learn
It doesn't matter:
- which platform you are using
- or how many problems you solve
All that matters is how strong you grasp concepts and adapt to problems.
Don't chase the status of 500 or 1000 problems solved.
Chase proper learning & training your mind for problem-solving.
Best DSA RESOURCES: https://topmate.io/coding/886874
All the best ๐๐
Neetcode is a tool to learn
CodeChef is a tool to learn
Codeforces is a tool to learn
HackerRank is a tool to learn
GeeksForGeeks is a tool to learn
It doesn't matter:
- which platform you are using
- or how many problems you solve
All that matters is how strong you grasp concepts and adapt to problems.
Don't chase the status of 500 or 1000 problems solved.
Chase proper learning & training your mind for problem-solving.
Best DSA RESOURCES: https://topmate.io/coding/886874
All the best ๐๐
๐27
โญ TECH MAHINDRA Interview Exp โญ
1) Self Intro.
2) Project.
3) Qns on Project.
4) Which Programming Language
you r Familiar with It.
5) What is Primarykey, Foreignkey.
6) Views in SQL.
7) Syntax of View.
8) Rank.
9) External Table.
10) Method Overloading.
11) Method Overriding.
12) Inheritance.
13) Explain Types of Inheritance
14) Why Multiple Inheritance is not
Supported.
15) Is Multiple Inheritance.
Supported injava and wha is it.
16) Relocation.
17) Night Shifts.
18) Why you Choose TechM.
19) About TechM.
1) Self Intro.
2) Project.
3) Qns on Project.
4) Which Programming Language
you r Familiar with It.
5) What is Primarykey, Foreignkey.
6) Views in SQL.
7) Syntax of View.
8) Rank.
9) External Table.
10) Method Overloading.
11) Method Overriding.
12) Inheritance.
13) Explain Types of Inheritance
14) Why Multiple Inheritance is not
Supported.
15) Is Multiple Inheritance.
Supported injava and wha is it.
16) Relocation.
17) Night Shifts.
18) Why you Choose TechM.
19) About TechM.
โค10๐5
Commonly asked System Design CONCEPT BASED interview topics -
1. Horizontal vs Vertical Partitioning:
Vertical partitioning splits tables by columns, often separating different features. Horizontal partitioning splits tables by rows, distributing data across multiple servers. Vertical organizes data logically, while horizontal improves scalability + performance.
2. Apache Kafka:
Kafka is a distributed streaming platform using a publish-subscribe model. It's fast due to the sequential disk I/O, zero-copy principle, and efficient batching of messages.
3. Rate Limiter:
A rate limiter controls the rate of requests a client can make to a service. It prevents overload and ensures fair resource usage.
4. JWT vs OAuth vs SAML:
JWT is a compact, self-contained token for secure information transmission. OAuth is an authorization framework for delegated access. SAML is an XML-based standard for exchanging authentication and authorization data.
5. Single Sign-On (SSO):
SSO allows users to access multiple applications with one set of credentials. It typically uses a central authentication server and protocols like SAML/OAuth.
6. Microservices vs Monolithic Architecture:
Microservices architecture breaks an application into small, independent services. Monolithic architecture is a single, tightly-coupled unit. Microservices offer scalability while monoliths are simpler to develop + deploy.
7. Reverse Proxy vs Forward Proxy:
A reverse proxy sits in front of web servers, forwarding client requests to backend servers. A forward proxy sits in front of clients, forwarding their requests to the internet. Reverse proxies are used for load balancing and security, while forward proxies are used for anonymity and filtering.
8. CAP Theorem:
The CAP theorem states that a distributed system can only provide two of three guarantees: Consistency, Availability, and Partition tolerance. In practice, partition tolerance is necessary, so systems must choose between consistency and availability during network partitions.
10. Efficient Caching Strategy:
Implement multi-level caching (browser, CDN, application server, database). Use appropriate cache invalidation strategies (TTL, event-based). Consider cache coherence for distributed systems.
Best DSA RESOURCES: https://topmate.io/coding/886874
All the best ๐๐
1. Horizontal vs Vertical Partitioning:
Vertical partitioning splits tables by columns, often separating different features. Horizontal partitioning splits tables by rows, distributing data across multiple servers. Vertical organizes data logically, while horizontal improves scalability + performance.
2. Apache Kafka:
Kafka is a distributed streaming platform using a publish-subscribe model. It's fast due to the sequential disk I/O, zero-copy principle, and efficient batching of messages.
3. Rate Limiter:
A rate limiter controls the rate of requests a client can make to a service. It prevents overload and ensures fair resource usage.
4. JWT vs OAuth vs SAML:
JWT is a compact, self-contained token for secure information transmission. OAuth is an authorization framework for delegated access. SAML is an XML-based standard for exchanging authentication and authorization data.
5. Single Sign-On (SSO):
SSO allows users to access multiple applications with one set of credentials. It typically uses a central authentication server and protocols like SAML/OAuth.
6. Microservices vs Monolithic Architecture:
Microservices architecture breaks an application into small, independent services. Monolithic architecture is a single, tightly-coupled unit. Microservices offer scalability while monoliths are simpler to develop + deploy.
7. Reverse Proxy vs Forward Proxy:
A reverse proxy sits in front of web servers, forwarding client requests to backend servers. A forward proxy sits in front of clients, forwarding their requests to the internet. Reverse proxies are used for load balancing and security, while forward proxies are used for anonymity and filtering.
8. CAP Theorem:
The CAP theorem states that a distributed system can only provide two of three guarantees: Consistency, Availability, and Partition tolerance. In practice, partition tolerance is necessary, so systems must choose between consistency and availability during network partitions.
10. Efficient Caching Strategy:
Implement multi-level caching (browser, CDN, application server, database). Use appropriate cache invalidation strategies (TTL, event-based). Consider cache coherence for distributed systems.
Best DSA RESOURCES: https://topmate.io/coding/886874
All the best ๐๐
๐11โค1
Here's a short roadmap to crack an IT job with a non-CS background ๐
1. ๐ Learn basics of CS and programming.
2. ๐ฏ Choose a specialization (e.g., web dev, data analysis).
3. ๐ Complete online courses and certifications.
4. ๐ ๏ธ Build a portfolio of projects.
5. ๐ค Network with professionals.
6. ๐ผ Seek internships for experience.
7. ๐ Keep learning and stay updated.
8. ๐ง Develop soft skills.
9. ๐ Prepare for interviews.
10. ๐ช Stay persistent and positive! Good luck!
1. ๐ Learn basics of CS and programming.
2. ๐ฏ Choose a specialization (e.g., web dev, data analysis).
3. ๐ Complete online courses and certifications.
4. ๐ ๏ธ Build a portfolio of projects.
5. ๐ค Network with professionals.
6. ๐ผ Seek internships for experience.
7. ๐ Keep learning and stay updated.
8. ๐ง Develop soft skills.
9. ๐ Prepare for interviews.
10. ๐ช Stay persistent and positive! Good luck!
๐15โค2๐2
No matter how poorly a candidate is doing.There is always something they got right. Find a way to infuse some positivity into the interview.
๐22โค7
List of most asked Programming Interview Questions.
Are you preparing for a coding interview? This tweet is for you. It contains a list of the most asked interview questions from each topic.
Arrays
- How is an array sorted using quicksort?
- How do you reverse an array?
- How do you remove duplicates from an array?
- How do you find the 2nd largest number in an unsorted integer array?
Linked Lists
- How do you find the length of a linked list?
- How do you reverse a linked list?
- How do you find the third node from the end?
- How are duplicate nodes removed in an unsorted linked list?
Strings
- How do you check if a string contains only digits?
- How can a given string be reversed?
- How do you find the first non-repeated character?
- How do you find duplicate characters in strings?
Binary Trees
- How are all leaves of a binary tree printed?
- How do you check if a tree is a binary search tree?
- How is a binary search tree implemented?
- Find the lowest common ancestor in a binary tree?
Graph
- How to detect a cycle in a directed graph?
- How to detect a cycle in an undirected graph?
- Find the total number of strongly connected components?
- Find whether a path exists between two nodes of a graph?
- Find the minimum number of swaps required to sort an array.
Dynamic Programming
1. Find the longest common subsequence?
2. Find the longest common substring?
3. Coin change problem?
4. Box stacking problem?
5. Count the number of ways to cover a distance?
Best DSA RESOURCES: https://topmate.io/coding/886874
All the best ๐๐
Are you preparing for a coding interview? This tweet is for you. It contains a list of the most asked interview questions from each topic.
Arrays
- How is an array sorted using quicksort?
- How do you reverse an array?
- How do you remove duplicates from an array?
- How do you find the 2nd largest number in an unsorted integer array?
Linked Lists
- How do you find the length of a linked list?
- How do you reverse a linked list?
- How do you find the third node from the end?
- How are duplicate nodes removed in an unsorted linked list?
Strings
- How do you check if a string contains only digits?
- How can a given string be reversed?
- How do you find the first non-repeated character?
- How do you find duplicate characters in strings?
Binary Trees
- How are all leaves of a binary tree printed?
- How do you check if a tree is a binary search tree?
- How is a binary search tree implemented?
- Find the lowest common ancestor in a binary tree?
Graph
- How to detect a cycle in a directed graph?
- How to detect a cycle in an undirected graph?
- Find the total number of strongly connected components?
- Find whether a path exists between two nodes of a graph?
- Find the minimum number of swaps required to sort an array.
Dynamic Programming
1. Find the longest common subsequence?
2. Find the longest common substring?
3. Coin change problem?
4. Box stacking problem?
5. Count the number of ways to cover a distance?
Best DSA RESOURCES: https://topmate.io/coding/886874
All the best ๐๐
๐15โค5
Free Resources To Crack Coding Interviews
๐๐
Coding Interview Prep FREE CERTIFIED COURSE
https://www.freecodecamp.org/learn/coding-interview-prep/#take-home-projects
Python Interview Questions and Answers
https://t.me/dsabooks/75
Beginner's guide for DSA
https://www.geeksforgeeks.org/the-ultimate-beginners-guide-for-dsa/amp/
Cracking the coding interview FREE BOOK
https://www.pdfdrive.com/cracking-the-coding-interview-189-programming-questions-and-solutions-d175292720.html
DSA Interview Questions and Answers
https://t.me/crackingthecodinginterview/77
Cracking the Coding interview: Learn 5 Essential Patterns
[4.5 star ratings out of 5]
https://bit.ly/3GUBk56
Data Science Interview Questions and Answers
https://t.me/datasciencefun/958
Java Interview Questions with Answers
https://t.me/Curiousprogrammer/106
ENJOY LEARNING ๐๐
๐๐
Coding Interview Prep FREE CERTIFIED COURSE
https://www.freecodecamp.org/learn/coding-interview-prep/#take-home-projects
Python Interview Questions and Answers
https://t.me/dsabooks/75
Beginner's guide for DSA
https://www.geeksforgeeks.org/the-ultimate-beginners-guide-for-dsa/amp/
Cracking the coding interview FREE BOOK
https://www.pdfdrive.com/cracking-the-coding-interview-189-programming-questions-and-solutions-d175292720.html
DSA Interview Questions and Answers
https://t.me/crackingthecodinginterview/77
Cracking the Coding interview: Learn 5 Essential Patterns
[4.5 star ratings out of 5]
https://bit.ly/3GUBk56
Data Science Interview Questions and Answers
https://t.me/datasciencefun/958
Java Interview Questions with Answers
https://t.me/Curiousprogrammer/106
ENJOY LEARNING ๐๐
๐7โค3
A microservice is a software development technique where an application is structured as a collection of small, loosely coupled services. Each service is designed to perform a specific function or task within the application and can be developed, deployed, and scaled independently. Microservices communicate with each other through well-defined APIs, allowing for flexibility, scalability, and resilience in the overall system. This approach enables teams to work on different services simultaneously, promotes faster development cycles, and makes it easier to update or replace individual services without affecting the entire application. Overall, microservices architecture is known for its agility, maintainability, and ability to adapt to changing business requirements.
๐15
12 things an API Gateway can do for your application:
โ Single entry point for incoming requests.
โ Parameter Validation for the various attributes within the HTTP request
โ Whitelist checks to allow or deny requests based on pre-defined rules
โ Authentication and authorization by talking to an identity provider
โ Rate Limiting requests based on application-defined rules and reject requests if the limit is violated.
โ Route the requests to the relevant service based on path-matching.
โ Service Discovery by contacting the service registry and finding the appropriate service instances.
โ Request transformation from one protocol to another if needed. For example, REST to gRPC and vice-versa.
โ Handling errors for some basic issues
โ Circuit breakers for preventing cascading failures and providing fallback responses to the client
โ Caching common responses
โ Logging request data and error data for efficient monitoring.
โ Single entry point for incoming requests.
โ Parameter Validation for the various attributes within the HTTP request
โ Whitelist checks to allow or deny requests based on pre-defined rules
โ Authentication and authorization by talking to an identity provider
โ Rate Limiting requests based on application-defined rules and reject requests if the limit is violated.
โ Route the requests to the relevant service based on path-matching.
โ Service Discovery by contacting the service registry and finding the appropriate service instances.
โ Request transformation from one protocol to another if needed. For example, REST to gRPC and vice-versa.
โ Handling errors for some basic issues
โ Circuit breakers for preventing cascading failures and providing fallback responses to the client
โ Caching common responses
โ Logging request data and error data for efficient monitoring.
๐13
Software development is complex, and the fancy names don't help.
Hashing vs. Encryption vs. Encoding
๐๐ฎ๐๐ต๐ถ๐ป๐ด
This is a one-way process used for data integrity verification.
When you hash data, you get a unique string representing the original data.
It's a one-way street; once you hash something, you can't get the original data back from the hash.
While multiple values can theoretically yield the same hash, well-crafted cryptographic hash functions make such collisions incredibly rare and nearly impossible to compute.
This property makes it perfect for verifying if someone altered the data.
If even one-bit changes in the original data, the hash changes dramatically.
๐๐ป๐ฐ๐ฟ๐๐ฝ๐๐ถ๐ผ๐ป
This is the real deal when it comes to data security.
It uses algorithms and keys to transform readable data (plaintext) into an unreadable format (ciphertext).
Only those with the correct key can unlock (decrypt) the data and read it.
This process is reversible, unlike hashing.
Encryption is critical for protecting sensitive data from unauthorized access.
๐๐ป๐ฐ๐ผ๐ฑ๐ถ๐ป๐ด
This is all about data representation.
It converts data from one format to another, making it easier to interpret and display.
Common formats:
โข Base64
โข UTF-8
โข ASCII
Encoding does NOT provide security! It's for data transmission and storage convenience.
One common use of hashing is for secure password storage.
When you create an account or set a password, the system hashes and stores the password in the database.
During login, the system hashes the provided password and compares it to the stored hash without revealing the password.
Hashing vs. Encryption vs. Encoding
๐๐ฎ๐๐ต๐ถ๐ป๐ด
This is a one-way process used for data integrity verification.
When you hash data, you get a unique string representing the original data.
It's a one-way street; once you hash something, you can't get the original data back from the hash.
While multiple values can theoretically yield the same hash, well-crafted cryptographic hash functions make such collisions incredibly rare and nearly impossible to compute.
This property makes it perfect for verifying if someone altered the data.
If even one-bit changes in the original data, the hash changes dramatically.
๐๐ป๐ฐ๐ฟ๐๐ฝ๐๐ถ๐ผ๐ป
This is the real deal when it comes to data security.
It uses algorithms and keys to transform readable data (plaintext) into an unreadable format (ciphertext).
Only those with the correct key can unlock (decrypt) the data and read it.
This process is reversible, unlike hashing.
Encryption is critical for protecting sensitive data from unauthorized access.
๐๐ป๐ฐ๐ผ๐ฑ๐ถ๐ป๐ด
This is all about data representation.
It converts data from one format to another, making it easier to interpret and display.
Common formats:
โข Base64
โข UTF-8
โข ASCII
Encoding does NOT provide security! It's for data transmission and storage convenience.
One common use of hashing is for secure password storage.
When you create an account or set a password, the system hashes and stores the password in the database.
During login, the system hashes the provided password and compares it to the stored hash without revealing the password.
๐14โค1
The reason youโre struggling with ๐ฆ๐๐๐๐ฒ๐บ ๐๐ฒ๐๐ถ๐ด๐ป interviews isn't because you havenโt studied countless case studies or designed multitude of systems.
It is because you haven't mastered the core concepts.
You can study all the complex systems, like distributed databases or scalable microservices architectures or designing a large-scale distributed system or a high-throughput messaging service. But these aren't as common as you might think.
Focus on strengthening your foundational knowledge first. No matter the language you prefer, whether Python, C++, Java, or JavaScript, start by building a solid understanding of core system design principles.
โค System Design Key Concepts:
1. Scalability: https://lnkd.in/gpge_z76
2. Latency vs Throughput: https://lnkd.in/g_amhAtN
3. CAP Theorem: https://lnkd.in/g3hmVamx
4. ACID Transactions: https://lnkd.in/gMe2JqaF
5. Rate Limiting: https://lnkd.in/gWsTDR3m
6. API Design: https://lnkd.in/ghYzrr8q
7. Strong vs Eventual Consistency: https://lnkd.in/gJ-uXQXZ
8. Distributed Tracing: https://lnkd.in/d6r5RdXG
9. Synchronous vs. asynchronous communications: https://lnkd.in/gC3F2nvr
10. Batch Processing vs Stream Processing: https://lnkd.in/g4_MzM4s
11. Fault Tolerance: https://lnkd.in/dVJ6n3wA
โค System Design Building Blocks:
1. Databases: https://lnkd.in/gti8gjpz
2. Horizontal vs Vertical Scaling: https://lnkd.in/gAH2e9du
3. Caching: https://lnkd.in/gC9piQbJ
4. Distributed Caching: https://lnkd.in/g7WKydNg
5. Load Balancing: https://lnkd.in/gQaa8sXK
6. SQL vs NoSQL: https://lnkd.in/g3WC_yxn
7. Database Scaling: https://lnkd.in/gAXpSyWQ
8. Data Replication: https://lnkd.in/gVAJxTpS
9. Data Redundancy: https://lnkd.in/gNN7TF7n
10. Database Sharding: https://lnkd.in/gMqqc6x9
11. Database Index's: https://lnkd.in/gCeshYVt
12. Proxy Server: https://lnkd.in/gi8KnKS6
13. WebSocket: https://lnkd.in/g76Gv2KQ
14. API Gateway: https://lnkd.in/gnsJGJaM
15. Message Queues: https://lnkd.in/gTzY6uk8
โค System Design Architectural Patterns:
1. Event-Driven Architecture: https://lnkd.in/dp8CPvey
2. Client-Server Architecture: https://lnkd.in/dAARQYzq
3. Serverless Architecture: https://lnkd.in/gQNAXKkb
4. Microservices Architecture: https://lnkd.in/gFXUrz_T
โค Machine Coding Round and Low Level Design Problems:
1. Design a Parking Lot: https://lnkd.in/dQaAuFd2
2. Design Splitwise: https://lnkd.in/dF5fBnex
3. Design Chess Validator: https://lnkd.in/dfAQHvN4
4. Design a Distributed Queue | Kafka: https://lnkd.in/dQ6_B4_M
5. Design Tic-Tac-Toe: https://lnkd.in/dFDApUBt
Python Interview Questions and Answers
https://t.me/dsabooks/75
Beginner's guide for DSA
https://www.geeksforgeeks.org/the-ultimate-beginners-guide-for-dsa/amp/
Cracking the coding interview FREE BOOK
https://www.pdfdrive.com/cracking-the-coding-interview-189-programming-questions-and-solutions-d175292720.html
DSA Interview Questions and Answers
https://t.me/crackingthecodinginterview/77
Data Science Interview Questions and Answers
https://t.me/datasciencefun/958
Java Interview Questions with Answers
https://t.me/Curiousprogrammer/106
โค System Design and Architecture (HLD):
1. Design a Unique ID Generator Service
2. Design a URL Shortening Service
3. Design Whatsapp
4. Design Instagram/Twitter News Feed
5. Design Search Autocomplete | Design Typeahead
6. Design Zomato Restaurant Search | Design Proximity Service
Best DSA RESOURCES: https://topmate.io/coding/886874
All the best ๐๐
It is because you haven't mastered the core concepts.
You can study all the complex systems, like distributed databases or scalable microservices architectures or designing a large-scale distributed system or a high-throughput messaging service. But these aren't as common as you might think.
Focus on strengthening your foundational knowledge first. No matter the language you prefer, whether Python, C++, Java, or JavaScript, start by building a solid understanding of core system design principles.
โค System Design Key Concepts:
1. Scalability: https://lnkd.in/gpge_z76
2. Latency vs Throughput: https://lnkd.in/g_amhAtN
3. CAP Theorem: https://lnkd.in/g3hmVamx
4. ACID Transactions: https://lnkd.in/gMe2JqaF
5. Rate Limiting: https://lnkd.in/gWsTDR3m
6. API Design: https://lnkd.in/ghYzrr8q
7. Strong vs Eventual Consistency: https://lnkd.in/gJ-uXQXZ
8. Distributed Tracing: https://lnkd.in/d6r5RdXG
9. Synchronous vs. asynchronous communications: https://lnkd.in/gC3F2nvr
10. Batch Processing vs Stream Processing: https://lnkd.in/g4_MzM4s
11. Fault Tolerance: https://lnkd.in/dVJ6n3wA
โค System Design Building Blocks:
1. Databases: https://lnkd.in/gti8gjpz
2. Horizontal vs Vertical Scaling: https://lnkd.in/gAH2e9du
3. Caching: https://lnkd.in/gC9piQbJ
4. Distributed Caching: https://lnkd.in/g7WKydNg
5. Load Balancing: https://lnkd.in/gQaa8sXK
6. SQL vs NoSQL: https://lnkd.in/g3WC_yxn
7. Database Scaling: https://lnkd.in/gAXpSyWQ
8. Data Replication: https://lnkd.in/gVAJxTpS
9. Data Redundancy: https://lnkd.in/gNN7TF7n
10. Database Sharding: https://lnkd.in/gMqqc6x9
11. Database Index's: https://lnkd.in/gCeshYVt
12. Proxy Server: https://lnkd.in/gi8KnKS6
13. WebSocket: https://lnkd.in/g76Gv2KQ
14. API Gateway: https://lnkd.in/gnsJGJaM
15. Message Queues: https://lnkd.in/gTzY6uk8
โค System Design Architectural Patterns:
1. Event-Driven Architecture: https://lnkd.in/dp8CPvey
2. Client-Server Architecture: https://lnkd.in/dAARQYzq
3. Serverless Architecture: https://lnkd.in/gQNAXKkb
4. Microservices Architecture: https://lnkd.in/gFXUrz_T
โค Machine Coding Round and Low Level Design Problems:
1. Design a Parking Lot: https://lnkd.in/dQaAuFd2
2. Design Splitwise: https://lnkd.in/dF5fBnex
3. Design Chess Validator: https://lnkd.in/dfAQHvN4
4. Design a Distributed Queue | Kafka: https://lnkd.in/dQ6_B4_M
5. Design Tic-Tac-Toe: https://lnkd.in/dFDApUBt
Python Interview Questions and Answers
https://t.me/dsabooks/75
Beginner's guide for DSA
https://www.geeksforgeeks.org/the-ultimate-beginners-guide-for-dsa/amp/
Cracking the coding interview FREE BOOK
https://www.pdfdrive.com/cracking-the-coding-interview-189-programming-questions-and-solutions-d175292720.html
DSA Interview Questions and Answers
https://t.me/crackingthecodinginterview/77
Data Science Interview Questions and Answers
https://t.me/datasciencefun/958
Java Interview Questions with Answers
https://t.me/Curiousprogrammer/106
โค System Design and Architecture (HLD):
1. Design a Unique ID Generator Service
2. Design a URL Shortening Service
3. Design Whatsapp
4. Design Instagram/Twitter News Feed
5. Design Search Autocomplete | Design Typeahead
6. Design Zomato Restaurant Search | Design Proximity Service
Best DSA RESOURCES: https://topmate.io/coding/886874
All the best ๐๐
๐18โค6๐ฅฐ1
You MUST Learn CI/CD with Github Actions. ๐
GitHub Actions workflow is a typical setup for automating the process of building, testing, and deploying code, ensuring that only code that passes all tests gets deployed to production. ๐ก
1. Workflow :
โ The title at the top (
2. Trigger (
โ The
3. Jobs:
โ The
3.1 Build Job: โ
-
- โ Steps:
1. Checkout Repository: Uses the
2. Set up Node.js: Uses the
3. Install Dependencies: Runs
4. Run Tests: Executes
3.2 Deploy Job: โ
-
-
- Steps: โ
1. Deploy to Production:
The
GitHub Actions workflow is a typical setup for automating the process of building, testing, and deploying code, ensuring that only code that passes all tests gets deployed to production. ๐ก
1. Workflow :
โ The title at the top (
name: CI/CD with GitHub Actions) indicates the name of the workflow. This name helps to identify the workflow among others in the repository.2. Trigger (
on):โ The
on keyword specifies the event that triggers this workflow. In this case, the workflow is triggered by a push event to the main branch. This means that whenever a commit is pushed to the main branch, the workflow will run automatically.3. Jobs:
โ The
jobs section defines the tasks that will be executed in this workflow. There are two jobs defined here: build and deploy.3.1 Build Job: โ
-
runs-on: specifies the virtual environment where the job will run. Here, ubuntu-latest means it will run on the latest version of Ubuntu provided by GitHub Actions.- โ Steps:
1. Checkout Repository: Uses the
actions/checkout@v2 action to clone the repository's code into the workflow environment. 2. Set up Node.js: Uses the
actions/setup-node@v3 action to install Node.js version 14, preparing the environment to run Node.js commands. 3. Install Dependencies: Runs
npm install to install the project's dependencies defined in package.json. 4. Run Tests: Executes
npm test to run the project's tests. 3.2 Deploy Job: โ
-
needs: specifies that the deploy job depends on the success of the build job. It will only run if the build job completes successfully.-
runs-on: Like the build job, the deploy job also runs on ubuntu-latest.- Steps: โ
1. Deploy to Production:
The
run block contains a simple shell script that checks if the build job was successful. If it was, it echoes "Deployment logic goes here" (which is where you would put the actual deployment commands). If the build failed, it outputs "Build failed, skipping deployment".๐10
Forwarded from Google Jobs - FAANG Companies โข Facebook โข Microsoft โข Amazon โข Netflix โข Apple
Unpopular opinion: FAANG job interviews are harder than the actual job.
๐9โค2
I have created the list of top 100 product based companies to target in 2024. You can access it for free now
๐๐
https://topmate.io/coding/1076270
Please give your ratings if you like the product
ENJOY LEARNING ๐๐
๐๐
https://topmate.io/coding/1076270
Please give your ratings if you like the product
ENJOY LEARNING ๐๐
๐9โค2๐ฅฐ2
API design involves making decisions about how your API will interact with consumers.
The major API design choices are:
REST (Representational State Transfer): It uses HTTP methods (GET, POST, PUT, DELETE) for CRUD operations on resources. It's stateless and commonly used for web-based APIs
GraphQL: Query language for APIs, it allows clients to request specific data
RPC (Remote Procedure Call): High-performance, language-agnostic framework, often used in microservices architectures
The major API design choices are:
REST (Representational State Transfer): It uses HTTP methods (GET, POST, PUT, DELETE) for CRUD operations on resources. It's stateless and commonly used for web-based APIs
GraphQL: Query language for APIs, it allows clients to request specific data
RPC (Remote Procedure Call): High-performance, language-agnostic framework, often used in microservices architectures
๐9โค1