Author: Editorial Team
-
Working with ChromaDB Using LangChain + Hugging Face Embeddings
Vector databases play a crucial role in modern LLM-powered applications. Whenever we want to store, search, or retrieve information semantically (using meaning instead of keywords), we rely on vector stores. In this tutorial, we will focus on ChromaDB, one of the most popular and developer-friendly open-source vector databases. This guide is written in simple language…
-
Building a Vector Store Using FAISS and HuggingFace Embeddings
In modern RAG (Retrieval-Augmented Generation) systems, embeddings and vector stores are core components.This tutorial walks you step-by-step through: We will use open-source embeddings and run everything locally with no external API requirements. 1. Understanding Vector Stores A vector store is a special database designed to store high-dimensional vectors (embeddings).It enables fast similarity search and is…
-
Using Hugging Face Embeddings with LangChain
In this tutorial, you’ll learn how to: This is one of the key building blocks in a RAG (Retrieval-Augmented Generation) or search system: converting text into vectors (embeddings) that capture semantic meaning. 1. What Are Embeddings (Quick Recap)? Embeddings are numeric representations of text (usually large vectors of floats). Texts that are semantically similar (e.g.,…
-
Converting Text Chunks into Vector Embeddings Using HuggingFace
In the previous sessions, you learned: We now move to Step 3, where you convert these text chunks into vector embeddings.These embeddings are the foundation of modern retrieval systems, semantic search, and RAG (Retrieval-Augmented Generation) applications. This tutorial focuses entirely on OpenAI embeddings. What Are Embeddings? Embeddings are one of the most important concepts in…
-
Building a Custom JSON Splitter for Large and Nested API Responses
When working with real-world APIs, we often receive large JSON responses that contain deeply nested objects, arrays, and long fields. Before we send this data to an LLM or convert it into embeddings for retrieval, we must break it into smaller and meaningful chunks. However, depending on your LangChain version, the built-in RecursiveJsonSplitter may not…
-
Splitting Text Using the HTML Header Text Splitter in LangChain
In earlier lessons, we explored several text-splitting techniques in LangChain. In this tutorial, we will focus on a powerful and lesser-known utility: the HTML Header Text Splitter. This splitter helps you break down HTML documents into logical, structured chunks based on the hierarchy of HTML header tags such as <h1>, <h2>, and <h3>. This becomes…
-
LeetCode 2444 — Count Subarrays With Fixed Bounds
Problem Summary You are given an integer array nums and two integers minK and maxK. A fixed-bounds subarray is a subarray that satisfies: Your task is to count how many such subarrays exist. ExampleInput: Valid fixed-bound subarrays: Output: Constraints Approach (Simple English) We must count subarrays where: A naive O(n²) approach is too slow. We…
-
LeetCode 2145 — Count the Hidden Sequences
Problem Summary You are given an integer array differences and two integers lower and upper. There exists a hidden array nums of length n = differences.length + 1 such that: Your task is to return how many possible hidden arrays nums exist such that every element in nums is within the inclusive range: If no…
-
LeetCode 781 — Rabbits in Forest
Problem Summary You are given an integer array answers, where each answers[i] represents: A rabbit says:“There are answers[i] other rabbits that have the same color as me.” Your task is to compute the minimum number of rabbits that could be in the forest. ExampleInput: answers = [1, 1, 2]Output: 5Explanation: ExampleInput: answers = [10, 10,…
-
LeetCode 38 — Count and Say
Problem Summary The count-and-say sequence is defined as follows: For example: Your task:Given an integer n, return the nth term of this sequence as a string. Constraints1 ≤ n ≤ 30 Understanding the Sequence List of first few terms: Each term depends only on the previous term. Approach (Simple English) To generate the nth term:…
