Convert Roman to Integer number - Leet Code Solution
Convert Roman to Integer number
The Archive of
Intentional Thought
Technical essays, architectural deep-dives, and practical guides at the intersection of code and design.
Page 19 of 28
Longest Common Prefix - Leet Code Solution
Write a function to find the longest common prefix string amongst an array of strings.
Integer to Roman conversion - Leet Code Solution
Integer to Roman Conversion Leet code problem
Container with Most Water - Leet Code Solution
Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.
Check whether an integer number given is palindrome or not - Leet Code Solution
Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.
Remove nth Node from Last - Leet Code Solution
Given a linked list, remove the n-th node from the end of list and return its head.
How to sync Mongodb data to ElasticSearch by using MongoConnector
How to sync MongoDB data to Elasticsearch using the MongoConnector open-source tool.
How to run MongoDB replica set on Docker
How to set up a MongoDB replica set cluster using Docker containers for local development and testing.
How to run ElasticSearch cluster on Docker with Kibana on Linux
Step-by-step guide to running an Elasticsearch cluster with Kibana on Docker using docker-compose on Linux.
How to prepare for your next Coding Interview
Practical tips on how to prepare for coding interviews — study strategies, practice approaches, and what to focus on.
How to calculate angle between hour and minute hand, given a time
Calculate the angle between the hour and minute hands of a clock given any time, using simple degree-per-minute formulas.
How to use NPM Rest API to get audit (npm audit) result
How to use the NPM audit REST API to check for package vulnerabilities without installing packages.