<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title>Bing: LeetCode SQL Certification</title><link>http://www.bing.com:80/search?q=LeetCode+SQL+Certification</link><description>Search results</description><image><url>http://www.bing.com:80/s/a/rsslogo.gif</url><title>LeetCode SQL Certification</title><link>http://www.bing.com:80/search?q=LeetCode+SQL+Certification</link></image><copyright>Copyright © 2026 Microsoft. All rights reserved. These XML results may not be used, reproduced or transmitted in any manner or for any purpose other than rendering Bing results within an RSS aggregator for your personal, non-commercial use. Any other use of these results requires express written permission from Microsoft Corporation. By accessing this web page or using these results in any manner whatsoever, you agree to be bound by the foregoing restrictions.</copyright><item><title>LeetCode - The World's Leading Online Programming Learning Platform</title><link>https://leetcode.com/</link><description>Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.</description><pubDate>Wed, 15 Apr 2026 01:27:00 GMT</pubDate></item><item><title>Contest - LeetCode</title><link>https://leetcode.com/contest/</link><description>Enhance your coding abilities and get valuable real-world feedback by participating in contests on LeetCode. You can also win up to 5000 LeetCoins per contest, as well as bonus prizes from sponsored companies.</description><pubDate>Wed, 15 Apr 2026 04:40:00 GMT</pubDate></item><item><title>LeetCode Interview</title><link>https://interview.leetcode.com/interview/login/</link><description>LeetCode Interview</description><pubDate>Sun, 12 Apr 2026 20:57:00 GMT</pubDate></item><item><title>Isomorphic Strings - LeetCode</title><link>https://leetcode.com/problems/isomorphic-strings/</link><description>Can you solve this real interview question? Isomorphic Strings - Given two strings s and t, determine if they are isomorphic. Two strings s and t are isomorphic if the characters in s can be replaced to get t. All occurrences of a character must be replaced with another character while preserving the order of characters. No two characters may map to the same character, but a character may map ...</description><pubDate>Mon, 13 Apr 2026 05:11:00 GMT</pubDate></item><item><title>3Sum - LeetCode</title><link>https://leetcode.com/problems/3sum/description/</link><description>Can you solve this real interview question? 3Sum - Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j ...</description><pubDate>Tue, 14 Apr 2026 11:51:00 GMT</pubDate></item><item><title>Trapping Rain Water - LeetCode</title><link>https://leetcode.com/problems/trapping-rain-water/description/</link><description>Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Example 1: Input: height = [0,1,0,2,1,0,1,3,2,1,2,1] Output: 6 Explanation: The above elevation map (black section) is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. Example 2 ...</description><pubDate>Tue, 14 Apr 2026 19:29:00 GMT</pubDate></item><item><title>Maximum Subarray - LeetCode</title><link>https://leetcode.com/problems/maximum-subarray/description/</link><description>1. Please don't post any solutions in this discussion. 2. The problem discussion is for asking questions about the problem or for sharing tips - anything except for solutions. 3. If you'd like to share your solution for feedback and ideas, please head to the solutions tab and post it there.</description><pubDate>Wed, 15 Apr 2026 03:29:00 GMT</pubDate></item><item><title>String - LeetCode</title><link>https://leetcode.com/problem-list/string/</link><description>Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.</description><pubDate>Tue, 14 Apr 2026 11:01:00 GMT</pubDate></item><item><title>Search in Rotated Sorted Array II - LeetCode</title><link>https://leetcode.com/problems/search-in-rotated-sorted-array-ii/</link><description>Can you solve this real interview question? Search in Rotated Sorted Array II - There is an integer array nums sorted in non-decreasing order (not necessarily with distinct values). Before being passed to your function, nums is rotated at an unknown pivot index k (0 &lt;= k &lt; nums.length) such that the resulting array is [nums [k], nums [k+1], ..., nums [n-1], nums [0], nums [1], ..., nums [k-1 ...</description><pubDate>Sun, 12 Apr 2026 19:24:00 GMT</pubDate></item><item><title>Longest Repeating Character Replacement - LeetCode</title><link>https://leetcode.com/problems/longest-repeating-character-replacement/</link><description>Can you solve this real interview question? Longest Repeating Character Replacement - You are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform this operation at most k times. Return the length of the longest substring containing the same letter you can get after performing the above operations ...</description><pubDate>Tue, 14 Apr 2026 05:39:00 GMT</pubDate></item></channel></rss>