Skip to content

Only Code

Eat Code Sleep – repeat

  • Github
  • Home
  • Arrays
  • Linked Lists
  • Trees
  • Stacks
  • Queues
  • Heaps
  • Graphs
  • Algorithms+
    • Sorting
    • Dynamic Programming
    • Divide and Conquer
    • Backtracking & Recursion
    • Greedy approach
    • Breadth First Search (BFS)
    • Depth First Search (DFS)

Only Code

Eat Code Sleep – repeat

Close menu
  • Github
  • Home
  • Arrays
  • Linked Lists
  • Trees
  • Stacks
  • Queues
  • Heaps
  • Graphs
  • Algorithms+
    • Sorting
    • Dynamic Programming
    • Divide and Conquer
    • Backtracking & Recursion
    • Greedy approach
    • Breadth First Search (BFS)
    • Depth First Search (DFS)

Only Code

Eat Code Sleep – repeat

Search Toggle menu

Author: Logan

Hiding User Input for Sensitive Fields Like Passwords

Implementing input masking is relatively straightforward in modern programming languages. Most provide built-in mechanisms to hide sensitive fields.

C/C++, Java, Python, Web Development

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.

Computer Science

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.

Computer Science

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.

Machine Learning, Python

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.

Computer Science

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.

Programming Projects, Web Development

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.

Programming Projects, Python, Web Development

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.

Computer Science

Max of All Subarrays of Size k Using Max Heap in C++

This problem, also referred to as the “sliding window maximum” problem, can be efficiently solved using heaps. We’ve already discussed an O(n) solution.

Arrays, Competitive Programming, Heaps, Interview Questions

Finding All Subsequences of a String Using Python | Iterative vs Recursive

Subsequences derived from strings by deleting some or no characters without changing order, are crucial in fields like bioinformatics, data mining, and cryptography.

Competitive Programming

Posts pagination

< 1 2 3 4 … 24 >
  • Algorithms
  • Arrays
  • Backtracking & Recursion
  • Breadth First Search (BFS)
  • C/C++
  • Competitive Programming
  • Computer Science
  • Data Science
  • Databases
  • Depth First Search (DFS)
  • Divide and Conquer
  • Dynamic Programming
  • Graphs
  • Greedy approach
  • Hashmaps
  • Heaps
  • Interview Questions
  • Java
  • Linked Lists
  • Machine Coding Questions
  • Machine Learning
  • Mathematics
  • Networking
  • Programming Projects
  • Python
  • Queues
  • Sorting
  • Special Data Structures
  • Stacks
  • Trees
  • Web Development
© 2025 Only Code | Aureolls
Exit mobile version