Software Engineering Typing speed testing tool using Vanilla JavaScript In this article, we will know how to build a simple tool that can test the typing speed of the users. We will develop this using JavaScript along with HTML and CSS.
Machine Learning (ML) An Introduction to BERT In this article, we have go through some of the basic concept related BERT architecture in general and Try to find the intuition behind using it . We also tried to explore similar models.
Algorithms Knuth's optimization in Dynamic Programming Knuth's optimization is used to optimize the run-time of a subset of Dynamic programming problems from O(N^3) to O(N^2). We have explained this with a sample problem.
Software Engineering Class based Generic Views in Django Class-Based Generic Views are a superior set of Built-in views that are used for the implementation of selective view strategies such as Create, Retrieve, Update, Delete.
Algorithms Tim Sort Tim Sort is a hybrid stable sorting algorithm that takes advantage of common patterns in data, and utilizes a combination of an improved Merge sort and Binary Insertion sort along with some internal logic to optimize the manipulation of large scale real-world data.
Algorithms Overview of Maximum Flow Problem The aim of the max flow problem is to calculate the maximum amount of flow that can reach the sink vertex from the source vertex keeping the flow capacities of edges in consideration.
Software Engineering Creating JWT Authentication in REST API in Flask JSON Web Token is a string which is sent in HTTP request from the browser to the server to validate authenticity of the client. We have demonstrated how to create JWT Authentication in REST API in Flask.
Algorithms Algorithm to find the maximum power of N that divides M factorial (M!) We are given two numbers M and N. Our aim is to find the highest power of N that divides Factorial of M (M!). First we have discussed about the Brute Force approach and then we will be discussing this problem using Legendre’s formula.
Machine Learning (ML) Adversarial Machine Learning Adversarial Machine learning is the technique which involves applying different methods in order to construct or generate examples that are meant to fool the machine learning model.
Machine Learning (ML) K means vs K means++ The main difference between K Means and K Means++ lies in the selection of the centroids around which the clustering takes place and k means++ removes the drawback of K means which is it is dependent on initialization of centroid.
Software Engineering Viewing the history of git commits (git log) In this article, we have explored how we can view the history of git commits that is using git log. We have explored several different options that can be used along with "git log".
Software Engineering Undoing Local Changes in Git when in the Working area or Staging area In this article, we have explored how to can undo Local Changes in Git when in the Working area or Staging area. We have demonstrated this with example and complete understanding.
Software Engineering Explaining Blockchain intuitively to a Five year old! In this article, we have explained Blockchain intuitively so that a five year old can get the basic idea as well. We have covered concepts like decentralization, immutability, fraudulent transaction, consensus protocol and much more.
Software Engineering .norm() method of Numpy library in Python In this article, you will know about vector norm and the method to apply them in python by using the Linear Algebra module of the NumPy library. In general, three types of norms are used: L1 norm, L2 norm and Vector Max Norm
Algorithms Maximum houses a Robber can rob Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money the robber can rob tonight without alerting the police. We have solved this problem using Dynamic Programming.
Software Engineering Unary and Binary Operations in C++ In this article, we have explored the different types of Unary and Binary Operations in C++ in depth. These includes common operators like increment (++) and decrement (--) along with all variants.
Software Engineering Implementing Binary search in C++ We have explained in depth how to implement Binary Search in C++. We have covered 3 approaches: Recursive implementation, Iterative implementation and using STL functions.
Algorithms Kadane's Algorithm for largest subarray sum Kadane's Algorithm is commonly known for Finding the largest sum of a subarray in linear time O(N). We have presented 3 variants of Kadane's Algorithm along with in-depth explanation of basic ideas.
Software Engineering Reducing Time limit of code in Java In this article, we have explored how to make a Java code execute faster by handling Input and Output better. The ways we presented are Scanner class, BufferedReader class, User-defined FastReader Class and Reader Class.
Algorithms Binary GCD Algorithm Binary GCD algorithm or Stein's algorithm is an algorithm that calculates two non-negative integer's largest common divisor by using simpler arithmetic operations than the standard euclidean algorithm and it reinstates division by numerical shifts, comparisons, and subtraction operations.
Software Engineering String Class (java.lang.String) in Java The java.lang.String class provides a lot of methods to work on string. By the help of these methods, we can perform operations on string such as trimming, concatenating, converting, comparing, replacing strings etc. We have explored it in detail.
Software Engineering Auto Key Cipher Autokey (Autoclave) Cipher is a Symmetric polyalphabetic (Polyceaser) substitution cipher. This algorithm is about changing plain text letters based on secret key letters.
Software Engineering Play Fair Cipher Play Fair Cipher was the first practical digraph substitution cipher. In play fair cipher unlike traditional cipher, we encrypt a pair/digraph of alphabets (digraphs) instead of a single alphabet.
Algorithms Finding the Largest Element in an Array We are given an integer array of size N or we can say number of elements is equal to N. We have to find the largest/ maximum element in an array. The time complexity to solve this is linear O(N) and space complexity is O(1).
Software Engineering How is 'this' reference in Java used? The 'this' keyword in Java is a reference ( which means it manages some relation ) to the current object where it is called. We have presented 6 usage of this keyword which includes referring to current class instance variable and much more.
