Algorithms Time & Space Complexity of Bellman Ford Algorithm In this post, we do an analysis the Bellman Ford's single source shortest path graph algorithm to find its computational Time and Space complexity for Best case, Worst case and Average Case.
Software Engineering Power and Exponential functions in math.h Header file in C/ C++ In a simple way, a Library is collection of built in functions. One of the header file of standard C library is "math.h". As the name itself suggests, It defines various mathematical functions.
Machine Learning (ML) Types of Dimensionality Reduction Techniques In this article, we will learn Why is Dimensionality Reduction important and 5 different Types of Dimensionality Reduction Techniques like Principal Component Analysis, Missing Value Ratio, Random Forest, Backward Elimination and Forward Selection.
Python Get current stock price in Python In this article, we have covered how to get the current stock price in Python from Yahoo Finance using two Python libraries, Beautiful Soup, and the Requests library.
Algorithms Maximum String Partition problem: Partition Labels In this article, we have explored approaches to solve the maximum string partition problem (Partition Labels) efficiently.
Algorithms Alien Dictionary problem: Sorted order of characters In this article, we are given a sorted list of words in some alien dictionary. Based on the list, we have to generate the sorted order of characters in that alphabet. This problem can be solved using the idea of Topological Sort and Direct Acyclic Graphs.
Algorithms Shortest Superstring problem In this article, we have explained three approaches to solve the Shortest Superstring problem. This involve concepts like DFS and Dynamic Programming.
Algorithms Swap Nodes in Pairs In this article, we have explained an efficient approach to Swap adjacent nodes in a Singly Linked List inplace. We have presented both Iterative and Recursive implementation.
Data Structures All O`one Data Structure In this post, we will design a Data Structure that returns the string occurring maximum and minimum times in constant time O(1). This will use a hashmap and a doubly linked list utilizing the advantages of each to solve the problem.
Algorithms Substring with Concatenation of All Words In this article, we have explained two approaches to solve the problem Substring with Concatenation of All Words. This involves the idea of Hash Map and Two Pointer.
Time Complexity Time & Space Complexity of Heap Sort In this article, we have explained Time & Space Complexity of Heap Sort with detailed analysis of different cases like Worst case, Best case and Average Case.
Algorithms Rotate Image: matrix of size NxN by 90 degrees (clockwise) In this article, we have explored an efficient way to Rotate Image: matrix of size NxN by 90 degrees (clockwise) inplace by using a property of XOR operation.
Machine Learning (ML) The ShuffleNet Series (Part 3): Implementation using Pytorch We have covered every step involved in training and testing our ShuffleNet model that performs multi-class image classification. The introduction of the CIFAR 10 dataset and result discussion are also included.
Machine Learning (ML) Precision, Recall, Sensitivity and Specificity In this article, we have explained 4 core concepts which are used to evaluate accuracy of techniques namely Precision, Recall, Sensitivity and Specificity. We have explained this with examples.
Algorithms Reverse part of Singly Linked List In this post, we have demonstrated ways in which we can not only reverse a singly linked list but also some part of Singly Linked List. It takes linear time O(N) to Reverse part of Singly Linked List.
C++ Different ways to initialize Deque in C++ STL In this article, we will learn about the concept behind a deque and different ways to initialize a deque in C++ Standard Template Library (STL) like using default constructor, fill, range, move and others.
System Design Federation: Functional Partitioning of Database + FDBS In this article, we have explained the concept of Federation including Functional Partitioning of Database + Federated Database System (FDBS). These System Design concepts are important to design efficient Database for systems.
Algorithms Remove N-th Node from end of Singly Linked List In this article, we have explained two approaches to Remove N-th Node from end of Singly Linked List. We can do this in single pass / one traversal in O(N) time.
List of Interview Questions Interview Questions on Quick Sort In this article, we have presented Interview Questions on Quick Sort (MCQ) with detailed answers. You must practice this as Quick Sort is the most important topic for Coding Interviews.
Algorithms Letter Combinations of a Phone Number In this article, we have discussed two approaches (recursive + iterative) to solve the problem "Letter Combinations of a Phone Number" in C++ language with explanation of Time and Space complexity.
Algorithms Roman to Integer In this article, we have explained two efficient approaches / algorithms to convert Roman number to Integer. We have presented the implementation as well.
Algorithms Merge Intervals problem In this article, we will learn how to solve the Merge Overlapping Intervals problem in most efficient and easy to understand method with the help of stack. We do this in linear time O(N).
Algorithms Number of Islands in MxN matrix (of 0 and 1) In this article, we have explored an insightful approach/ algorithm to find the number of islands in MxN matrix. An extension of this algorithm is used by online battleship game engine.
Rust Programming Error Handling in Rust Let's tackle 2 topics today. One of them is about dealing with possible errors and/or mistakes we might encounter in our developing journey in Rust. The other is about learning how to write code with these in mind.
Software Engineering Web Sockets (ws:// , wss://) In this article, we will talk about webockets, it's a very important and fundamental topic for anyone interested in web and communication protocols. WebSocket is a computer communication protocol, providing full connections over a single TCP connection.
