Learn Java, C#, C, C++ and more with 1200+ free tutorials. No fluff, just code.
Interview Prep
Practice real interview questions and answers across 13 languages — free, no signup required.
Tech Trends
Straight takes on AI coding, language trends, and the roles shaping programming careers.
DeepSeek's low-cost open-weight models forced Google, OpenAI, and Anthropic to compete harder — here's what's actually different between DeepSeek, Gemini, GPT, and Claude for coding, and how to think about it without chasing every new release.
Read more
C# just won TIOBE's Language of the Year for 2025 and still powers Unity, enterprise backends, and Azure — here's the real 2026 data on whether it's still worth learning, plus what's new in C# 14.
Read more
SQL shows up in a large share of U.S. tech job postings and most data engineering roles — here's the real data on why it's one of the most durable, undervalued skills a beginner can learn, plus a practical walkthrough to get started.
Read more1142 posts available
You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in lefttoright order. The large integer does not contain any leading zeros, except for the number 0 itself. In
Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique, and you may return the result in any order. Constraints: 1 <= nums1.length, nums2.length <= 1000 0 <= nums1[i], nums2[i] <= 1000 Example: Input: nums1 = [1,2,2,1], nums2 = [2,2
Given a sorted array nums, remove the duplicates inplace such that each unique element appears only once. The relative order of the elements should be kept the same. Your function should return the new length k after removing the duplicates. Do not allocate extra space for another array; you must do
Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". All given inputs are lowercase English letters az. The number of strings n will be between 0 and 200. The length of each string will be between 0 and 200. E
Given an array of strings strs, group the anagrams together. You can return the answer in any order. An anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. Constraints: 1 <= strs.length <= 10^4 0 <= strs[
You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If yo
Given an integer array nums, determine if it contains any duplicates. Return true if any value appears at least twice in the array, and return false if every element is distinct. Constraints: 1 <= nums.length <= 10^5 10^9 <= nums[i] <= 10^9 Example: Input: nums = [1,2,3,1] Output: true Explanation:
Given an input string s, reverse the order of the words. Constraints: A word is defined as a sequence of nonspace characters. Words are separated by at least one space. The input string may contain leading or trailing spaces. Multiple spaces between two words should be reduced to a single space in t
You are given an array nums containing n distinct numbers in the range [0, n]. Your task is to find and return the only number in the range that is missing from the array. n is the length of nums. 1 <= n <= 10^4 0 <= nums[i] <= n All numbers in nums are unique. Example 1: Input: nums = [3,0,1] Outpu
Are you a company or brand with content relevant to our programming and tech audience? We accept paid guest post placements — reach out to discuss your article and publishing options.