Here are stories and journeys we would like to share with our fellow engineers, from coding to life experience, and everything in between. We might learn from each other, or have some fun.
A Cheat Sheet of AI Agent API Pricing Comparison
When building a conversational voice AI application, developers need to understand the costs of the three core components: speech-to-text (STT), a large language model (LLM), and text-to-speech (TTS). Each provider charges differently—some by tokens, some ...
Web scraping in Java – Jsoup and selenium
Web scraping is a great way to retrieve data and save the information. with a simple Java web scraping setup, you can download content using Jsoup and selenium. Download the source code from the GitHub ...
Get suggested friends (2 solutions) – DFS and Union Find
Get suggested friends is one of a coding question in social network applications. The data structures for social network is usually a graph. In the graph, you can use depth first search(DFS) or breadth first ...
Hierholzer’s algorithm to find an Euler path
An Euler path is a trail in a graph that visits every edge exactly once. Here we use graph data structure to simulate the set of linked porker cards and find the Euler path between ...
Modulo operation and circular array
The modulo operation returns the remainder of one number divided by another. Modulo operator is a arithmetical operator, represented as %. For example, 6 % 4 is 2. The modulo operation is very useful in ...
Topological sort using DFS and BFS
Topological sort is a graph traversal in which node v is visited only after all its dependencies are visited. The graph has to be directed and has no cycles, i.e. directed acyclic graph (DAG). Once ...
Word ladder using bidirectional BFS
Word ladder is to find the number of steps to convert one string to another by changing one letter at a time. The intermediate words should be valid and can be found in pre-defined dictionary ...
Autocorrect and edit distance problem in Java
When you search in Google, it provides autocorrect for validating the keywords you enter into the input box. Behind the scene, it checks the input words against a dictionary. If it doesn’t find the keyword ...
Software Engineering Concepts – Student Guide
This post is an illustrated explanation of Software Engineering Concepts and terminologies. It helps you to decide which areas you would like to specialize in. Table of Content MathematicsSystemsProgrammingNetworksData ScienceApplicationsArtificial intelligenceFor your consideration 1. Mathematics ...
Domino Eulerian path problem using backtracking
A Euler path (Eulerian path) is a path in a graph that you visit each edge exactly once. You can visit the same vertex multiple times though. Dominoes is one example of finding Euler path ...
