Aditya Chatterjee - OpenGenus IQ: Learn Algorithms, DL, System Design (Page 7)

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.

Time Complexity

Time Complexity Analysis of Array

We have presented the Time Complexity analysis of different operations in Array. It clears several misconceptions such that Time Complexity to access i-th element takes O(1) time but in reality, it takes O(√N) time. We have presented space complexity of array operations as well.

Time Complexity

Time Complexity of Addition Operation

We have demonstrated the Time Complexity analysis of Addition operation. It is assumed to take constant time O(1) but it takes linear time O(N) in terms of number of bits. We have presented the space complexity along with implementation of addition using bitwise operations.

Algorithms

List of 50+ Binary Tree Problems for Coding Interviews

We have listed important Problems on Binary Tree which you must practice for Coding Interviews and listed introductory and background topics on Binary Tree as well. You must bookmark this page and practice all problems listed.

Culture

"Time Complexity Analysis" book

"Time Complexity Analysis" is a book focused on Mathematical Analysis of Time and Space Complexity of various algorithms and data structures along with basics of Time Complexity like Big-O notations.

Time Complexity

Basics of Time Complexity Analysis [+ notations and Complexity class]

We have explored the Basics of Time Complexity Analysis, various Time Complexity notations such as Big-O and Big-Theta, ideas of calculating and making sense of Time Complexity with a background on various complexity classes like P, NP, NP-Hard and others.

Time Complexity

Time Complexity for non-comparison based Sorting

We have explained why the minimum theoretical Time Complexity of non-comparison based sorting problem is O(N) instead of O(N logN). This is a must read. It will open up new insights.

Time Complexity

Time & Space Complexity of Binary Search [Mathematical Analysis]

We have presented the Mathematical Analysis of Time and Space Complexity of Binary Search for different cases such as Worst Case, Average Case and Best Case. We have presented the exact number of comparisons in Binary Search.

Time Complexity

Time & Space Complexity of Linear Search [Mathematical Analysis]

We have presented the Mathematical Analysis of Time and Space Complexity of Linear Search for different cases such as Worst Case, Average Case and Best Case. We have presented the exact number of comparisons in Linear Search.

Algorithms

Probability of Collision in Hash Function [Complete Analysis]

We present the Mathematical Analysis of the Probability of Collision in a Hash Function. You will learn to calculate the expected number of collisions along with the values till which no collision will be expected and much more.

Data Structures

Array Interview Questions [MCQ with answers]

This is the list of Interview Questions based on Array Data Structure. You must practice these Multiple Choice Questions. This will help you master Array Coding Questions for Interviews at companies like Google and Microsoft.

Culture

Makoto Soejima (rng_58)

Makoto Soejima is a Competitive Programmer from Japan. He is also known as rng_58. He works at AtCoder. His Competitive Programming career started in 1999 and lasted till 2020. He is one of the 4 people ever to have won both Google Code Jam and Facebook Hacker Cup.

Dynamic Programming (DP)

List of 100+ Dynamic Programming Problems

This is the List of 100+ Dynamic Programming Problems along with different types of DP problems such as Mathematical DP, Combination DP, String DP, Tree DP, Standard DP and Advanced DP optimizations.

Culture

Most Dangerous Line of Code 💀

This is the Most Dangerous Line of Code. Do not run it. It has the power to wipe out a Linux system completely and make it useless.

Software Engineering

[SOLVED] TypeError: only integer scalar arrays can be converted to a scalar index

Error encountered is: "TypeError: only integer scalar arrays can be converted to a scalar index". This error comes when we handle Numpy array in the wrong way using Numpy utility functions.