Algorithms "Linked List Problems" book This article introduces the exclusive book on Linked List Data Structure titled "Linked List Problems: For Interviews and Competitive Programming". It is a part of the book series "Must for Coding Interviews".
Algorithms What is Algorithm ? Algorithm is an ordered well defined series of steps that can be followed to solve a problem. A problem can be finding a definitive answer or a yes or no decision.
Machine Learning (ML) SGEMM In this article, we have covered SGEMM (Single Precision General Matrix Multiplication) which is a standard library function for Matrix Multiplication.
linked list Linked List Interview Questions [with answers] This is the list of Interview Questions based on Linked List Data Structure. You must practice these Multiple Choice Questions. This will help you master Linked List Coding Questions for Interviews at companies like Google and Microsoft.
Machine Learning (ML) Questions on Convolution operation in ML In this article, we have presented several Interview Questions (MCQs) with detailed answers on Convolution in Machine Learning models.
Software Engineering Your Career as a Computer Research Scientist In a world that is rapidly adopting new technologies, it’s no surprise that computer and information scientists are in high demand, with their employment rates projected to grow by 22% from 2020 to 2030.
Culture Inventor of Linked List Linked List is one of the most fundamental Data Structure and it was developed in 1953 by Hans Peter Luhn, Allen Newell, Cliff Shaw and Herbert Simon from IBM and RAND Corporation.
Linux Resolve merge conflict on Gerrit In this article, we have explained the steps to resolve merge conflict on Gerrit with the detailed step by step commands. This can be solved in the console using rebase command and manually, fixing the conflicts in code.
Software Engineering Review a Merge Request on Gerrit In this article, we have explained the detailed steps to review a Merge Request on Gerrit. Code Review is an important step in Software Development.
Software Engineering Open a pull request on Gerrit In this article, we have explained the detailed steps to open a pull request on Gerrit. The process is distinct from the process of opening a pull request on GitHub.
Linux Copy files from one server to another server In this article, we have explored the steps to copy files from one remote server to another remote server. This involve using commands like scp or utilities like WinSCP.
Dynamic Programming (DP) Dynamic Programming on Trees In this article, we have explored the idea of Dynamic Programming on Trees in depth and presented some practice problems.
Culture Awards for Open Source Contributions In this article, we have mentioned the major Awards you can win for your Open Source Contributions and get recognized by major companies like Microsoft (GitHub), Google, IBM (RedHat) and others.
Culture "Problems on Array: For Interviews and Competitive Programming" book This book "Problems on Array: For Interviews and Competitive Programming" is a deep dive into Array Data Structure, important algorithms and Practice problems on Array. There is no other book like this in the market. A must read.
Data Structures Array Data Structure In this article, we have explored Array Data Structure in depth. We explore key ideas in Array and how we develop our own custom implementation of Array along with different Array operations.
books "50+ Linux Commands before joining a Company" book A serious Developer uses Linux as his / her Development System. The book "50+ Linux Commands before joining a Company" cover the most important commands and tasks that you need to know to make a good impression at your workspace.
Theory of Computation Interview Questions on Theory of Computation (MCQ) In this article, we have present Interview Questions on Theory of Computation (MCQ). You must attempt these questions. All answers have been provided which will help you get prepared in Theory of Computation.
Java Interview Questions in Java (MCQ) In this article, we have presented several Interview Questions in Java (MCQ) covering all important topics in Java. These questions are frequently asked in Coding Interviews and you must attempt these questions.
Theory of Computation Church Turing Thesis in Theory of Computation We have explain the meaning and importance of Church Turing Thesis in Theory of Computation along with its applications and limitations.
Theory of Computation Pumping Lemma Questions We have presented some Questions which can be solving using Pumping Lemma in Theory of Computation. You must try these questions to test your understanding of Pumping Lemma before your examination.
Data Structures "Design a Data Structure" problems We have present some must practice "Design a Data Structure" problems. These are important problems for Coding Interviews at Google and other companies. You need to modify standard data structure to form new data structures to solve this problem efficiently.
Graph Algorithms 100+ Graph Algorithms and Techniques [Complete List] We have listed 100+ problems on Graph data structure, Graph Algorithms, related concepts, Competitive Programming techniques and Algorithmic problems.
Time Complexity Time Complexity of Multiplication The Brute force Time Complexity of Multiplication operation is O(logM x logM) while the Theoretical limit of Time Complexity of Multiplication operation is O(logM x loglogM) for multiplying number number M x M.
Time Complexity Time Complexity of Dynamic Array We have explained Complexity Analysis of Dynamic Array along with Time and Space Complexity of different operations of Dynamic Array.
Time Complexity Time Complexity Analysis of Linked List We have presented the Time Complexity analysis of different operations in Linked List. It clears several misconceptions such that Time Complexity to access i-th element takes O(1) time but in reality, it takes O(√N * N) time. We have presented space complexity of Linked List operations as well.
