Longest Palindrome Substring - Leet Code Solution
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
The Archive of
Intentional Thought
Technical essays, architectural deep-dives, and practical guides at the intersection of code and design.
Page 23 of 30
Find the Median of Two Sorted Arrays - Leet Code Solution
There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays.
How to solve java issue - could not load main class - Visual Studio Code
How to resolve the 'could not find or load main class' error when running Java in Visual Studio Code.
Solving Jboss Wildfly Oracle JDBC driver problem, with Dockerfile
How to resolve the Oracle JDBC driver problem when deploying a web application on JBoss Wildfly in Docker.
Longest Substring without repeating characters - Leet Code Solution
Given a string, find the length of the longest substring without repeating characters.
How to take Mongodb Backup and Restore
Step-by-step guide to backing up and restoring MongoDB databases using mongodump, mongorestore, and mongoimport — including remote server scenarios.
Implement a command line shell by using Command Dispatcher in Python
How to implement a command line shell using the Command Dispatcher pattern with Python decorators for extensible command handling.
Multithreading in Python, Lets clear the confusion between Multithreading and Multiprocessing
Understanding the difference between multithreading and multiprocessing in Python and when to use each for parallel execution.
Implementation of Timeit function, Get performance numbers for a function
How to implement a timeit decorator in Python to measure and log method execution times for performance analysis.
React JS router not working on Nginx docker container
How to fix React JS BrowserRouter routes returning 404 on Nginx in a Docker container.
Add two numbers(reverse order) link list Problem - Leet Code Solution
LeetCode "Add Two Numbers" (reverse-order linked lists) solved by traversing both lists and tracking carry, with full code walkthrough.
Radix Sort Algorithm
Learn Radix Sort — a non-comparison algorithm that sorts numbers digit by digit using counting sort as a stable sub-routine, in Java.