Algorithms Longest common substring using rolling hash approach We can solve the longest common substring problem using the rolling hash technique in O(N * log(N)^2) time and O(N) space which is significantly better than other approaches.
Web Development Types of caching in Web Application We will be discussing on the Types of caching in Web Application. Firstly we'll discuss on the Introduction to Cache. Secondly, we'll get familiar with the Types of it.
Software Engineering Forms in HTML HTML Forms are used to collect information from users, such as a user name, email address, passwords, etc. There are various sorts of form controls that you can use to gather information utilizing HTML forms such as text field and others.
Software Engineering A Guide to CSS Pseudo Classes A pseudo class is basically a pseudo state of element which can be later targeted with CSS. They can be used to target and style those elements which cannot be targeted with normal CSS classes or Id.
Machine Learning (ML) Regression vs Correlation We have explored the key differences between Correlation and Regression along with the basic idea behind both concepts. There are mainly 5 differences between Regression and Correlation.
Algorithms Applications of Hash Map HashMap in java.util package implements the Map interface in java collection based on Hashtable. There are three main applications of Hash Map: Priority Queues, Dijkstra's Algorithm and Topological Sort.
Software Engineering Implementing pwd command in C/C++ We will use the header file dirent.h for directory structures and objects and implement our pwd command in C/C++. This will involve the getcwd() function call.
Machine Learning (ML) Wide and Deep Learning Model Wide and Deep Learning Model is a ML/ DL model that has two main components: Memorizing component (Linear model) and a Generalizing component (Neural Network) and a cross product of the previous two components. Wide and Deep Learning Model is used in recommendation systems.
Machine Learning (ML) RoBERTa: Robustly Optimized BERT pre-training Approach RoBERTa (Robustly Optimized BERT pre-training Approach) is a NLP model and is the modified version (by Facebook) of the popular NLP model, BERT. It is more like an approach better train and optimize BERT (Bidirectional Encoder Representations from Transformers).
Software Engineering MineSweeper Game in React.Js In this tutorial, we have explained how to build a MineSweeper Game in React.Js. We have explained the rules of minesweeper and have explained the design of the app like 3 components: app, board and cell.
Machine Learning (ML) Introduction to GPT models Generative Pre-Training (GPT) models are trained on unlabeled dataset (which are available in abundance). There are different variants like GPT-1, GPT-2 and GPT-3 which we have explored.
Data Structures Splay Tree Splay trees are Self adjusting Binary Trees with additional property that recently accessed elements as kept near the top and hence, are quick to access next time.
Software Engineering Function scope in Python Function scope in Python means how a particular function is accessible from different components depending on LEGB (Local -> Enclosing -> Global -> Built-in) rule.
Algorithms Find number of substrings with same first and last characters You are given a string lets say "S" , you need to find the number of all contiguous substrings (part of "S") starting and ending with the same character.
Software Engineering Different ways to print in C Different ways to print in C are Formatted and Unformatted Output Functions, Printing using Formatted Function - printf(), putchar() and puts(). We have covered it with C code examples.
Algorithms Algorithms for Calculating Day of Week Some of the Algorithms for Calculating Day of Week are: Tomohiko Sakamoto Algorithm, Gausses Algorithm and Wang's Algorithm. We have covered the basics of Julian and Georgian calender as well.
Algorithms Set Partition Problem (Same sum) Set Partition Problem: determine whether a given set can be partitioned into two subsets such that the sum of elements in both subsets is same. The time complexity of solving this using Dynamic Programming takes O(N x SUM) time.
Software Engineering Linked List implementation in C language We have designed and implemented Linked List in C Programming Language. We have create a Node structure in C and implemented all Linked List operations in C.
Software Engineering Linked List Implementation in Java We learn how to implement and design Linked List in Java using Object Oriented Programming (OOP) concepts. We have provided the complete Java implementation of Linked List.
Algorithms Wildcard Pattern Matching (Dynamic Programming) In the Wildcard Pattern Matching problem, we find if a pattern matches a given input string. We will be using a Dynamic Programming approach with the time complexity of O(m * n), here m and n represent length of string and pattern respectively.
Software Engineering SHA1 Algorithm (+ JavaScript Implementation) In this article, we have explained the algorithmic steps in SHA1 Algorithm in depth. We have demonstrated an example by implementing SHA1 algorithm in JavaScript.
Machine Learning (ML) Filtering spam using Naive Bayes Naive Bayes is a Bayes Theorem-based probabilistic algorithm used in data analytics for email spam filtering. In this article, we have explored the step to filter spam using Naive Bayes in depth.
Algorithms Binary Search in a Linked List You are given a sorted singly linked list and a key (element to be searched), find the key in the linked list using binary search algorithm. The challenge is to find the middle element as Linked List does not support random access.
Software Engineering Capitalize letters in Python In this article, we have covered how to capitalize the first letter using capitalize() in Python, convert the entire string to upper-case, convert the entire string to lower-case and capitalize first letter of each word.
Machine Learning (ML) Disadvantages of GANs || Am I real or a Trained Model to write? We have explored the problems with GANs in this article and have divided them into two major parts: General Problems with GANs and Technical Disadvantages of GANs.
