Question: An implementation of a singly double list Explanation: Here we have 6 different methods on the class of the linked list. Where you can get, addAthead, addAtTail, addAtindex and deleteAtI...
485: Max Consecutive Ones: Given a binary array, find the maximum number of consecutive 1s in this array. Explanation: We create two variables, one called counter which keeps track of the number o...
Sorting Techniques Using the built in sort is okay with small data is okay. But when it comes to big data the built in sort is very expensive, the Big O! Sorting is arranging data in a particular...
Building a fair algorithm in an unfair society Abstract Although Artificial Intelligence (AI) has proven to have great potential in many industrial applications [1]–[3], research lacks sufficient...
Introduction This article aims to present the code reviewer developer guide adopted by Google. The goal of having code reviews is to maintain the quality of the code, and ultimately the product. A ...
Writing a Good ChangeList (CL) Description: A CL description is a record of what change is being made, and why it has been made. This is submitted along with the code you have written. It will als...
Algorithms When starting with any problem to solve. Clearly have the input stated and the output stated. Also, right down any edge cases as part of the input. The algorithm bridges the input with ...
Graph Data Structure A graph is a pictorial representation of a set of objects where some pairs of objects are connected by links. The interconnected objects are represented by points termed as ve...
Tree data Structure A tree presents the nodes connected by edges. Binary tree is a special data structure used for data storage purposes. A binary tree has a special condition that each node can h...
Recursion A recursion is where a function calls itself directly, or calls a function to call it directly. A recursive function can go infinite like a loop, therefore there must be 2 conditions. S...
Linked List Basics A linked list is a sequence of data structure which are connected via links. They are a list in a sequence connected by links which contains items. Each link contains a connecti...
Stacks An abstract data structure is defined by a set of values and set of operations. The abstract is used to perform different operations that are abstracted from the user. In other words, an ab...
Hash Table Hash table is a data structure which stores data in an associative manner. In a hash table, data is stored in an array format, where each data value has its own unique index value. Thus...
Big O Asymptotic analysis is defining the mathematical framing of an algorithm run-time performance. This helps us in concluding the best case (minimum time required to run execution), average cas...
Data Structure Introduction: Data structure is a systematic way to organize data to use it efficiently. There are two main data types, Built-in Data Type and Derived Data Type. In other words a da...
Array Introduction An array is a container which holds a fix number of items and these items should be of the same type. Arrays is also known as lists. The two concepts of an array are an element...
Shortest path by Dijkstra: The goal is to find the shortest path between two vertices. The objective is to find the shortest path from the starting vertices to any vertices. An example of greedy al...
Learning how to Learn: As a software engineer, the only thing that does not change about software is that it continuously changes. Therefore, learning is your ultimate destination. Below I summari...
Linear Search A sequential search is made over all items one by one. Every item is checked and if a match is found then the item is returned. Otherwise, the search continues to the end. with O(n)...