Longest Common Prefix - LeetCode Fast & Simple Solution
Find the longest common prefix from the given array of strings. Return an empty string "", if no common prefix is found.
top of page
One Stop Code Shop
Pick from a vast collection of quality content across a wide range of topics.
Latest Posts
Code Recipe
Mar 56 min read
Integer to Roman - Short & Simple LeetCode Solution
Convert the given integer to a roman numeral. As we saw in our previous article, roman numerals are represented using seven different
197 views1 comment
Code Recipe
Feb 266 min read
Roman to Integer - Short & Simple LeetCode Solution
Convert the given roman numeral into an integer value.
144 views1 comment
Ashwin Shirva
Sep 24, 20235 min read
Golang - What is go:embed Directive in Go?
Introduction In the previous article we delved into the fascinating world of Go Generics and learnt how to incorporate it in our go...
321 views1 comment
Code Recipe
Jun 7, 202217 min read
URL Shortener (Tiny URL) System Design: A Complete Guide
A URL shortner is a service which takes a long URL and converts it into an equivalent short URL containing lesser characters. When the user
6,791 views1 comment
bottom of page