Advanced Competitive Programming Concepts
These are the articles, dedicated specifically to advanced competitive programming concepts. Modular Multiplicative Inverse, Nth Catalan Number.
Treap (Tree + Heap)
Treap is an efficient and simple data structure that combines the best of both binary search trees and heaps. It provides the benefits of efficient search, insert, and delete operations.
Bayes’ Theorem: Probability and Statistics
Bayesian inference is central to probabilistic models and algorithms like Naive Bayes classifiers, which are widely used in machine learning.
Hiding User Input for Sensitive Fields Like Passwords
Typically, login forms display input characters as asterisks or bullets to prevent shoulder surfing and other forms of eavesdropping.
Regular Expressions in Computer Programming (Quick Notes)
Regex is efficient because most programming languages implement optimized regex engines that handle pattern matching using sophisticated algorithms like finite automata, ensuring fast performance.
Scientific Notation in Computer Programming (Quick Notes)
Scientific notation is a method of expressing very large or very small numbers in a compact and readable form.
How to Check Text Similarity Between Two Documents Using Python?
NLTK (Natural Language Toolkit) is a powerful library in Python that provides easy-to-use interfaces to over 50 corpora and lexical resources, including WordNet.
Caesar Cipher with Implementation
Caesar Cipher is one of the simplest and oldest encryption techniques, named after Julius Caesar, who used it to protect his military communications.
How to Create a Chrome Extension Game – Maths Solver using Phaser Game Framework
We’ll revisit the basics of developing Chrome Extensions, and also explore the Phaser game framework, and finally, learn how to create a ‘maths game’ using Phaser.
Web Crawler in Python | Comparing Yahoo, DuckDuckGo and Bing Search Results
BeautifulSoup is a Python library designed to parse HTML and XML documents. It simplifies tasks like iterating and searching HTML elements by attributes.
Tail Recursion Example: Functional Programming Languages
Tail recursion optimization works by maintaining a single call frame for the recursive calls instead of creating a new one each time.