0600-0699

📄️ 645-Set Mismatch

This is a solution to the Set Mismatch problem on LeetCode.

📄️ 648-Replace Words

This is a solution to the Replace Words problem on LeetCode.

📄️ 647-Palindromic Substrings

This is a solution to the Palindromic Substrings problem on LeetCode.

📄️ Non-negative Integers without Consecutive Ones

This page explains the problem of finding non-negative integers without consecutive ones.

📄️ Human Traffic Of Stadium

This question solve important question of sql which gives us knowledge about writing of sql command.

📄️ Friend Requests II

This question solve important question of sql which gives us knowledge about writing of sql command.

You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots.Given an integer array flowerbed containing 0's and 1's, where 0 means empty and 1 means not empty, and an integer n, return true if n new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule and false otherwise.

📄️ 0606-Construct-String-from-Binary-Tree

Given the root of a binary tree, construct a string consisting of parenthesis and integers from a binary tree with the preorder traversal way.

📄️ 0608-Tree-Node

SQL Schema: Given a table with nodes, write an SQL query to find all nodes which are the only child nodes.

📄️ 0609 - Find Duplicate File in System

This is a solution to the Find Duplicate File in System problem on LeetCode.

📄️ 0611 - Valid Triangle Number

This is a solution to the Valid Triangle Number problem on LeetCode.

📄️ 0617-Merge-Two-Binary-Trees

Given two binary trees, merge them into a new binary tree by adding the values of overlapping nodes.

📄️ 0621 - Task Scheduler

This is a solution to the Task Scheduler problem on LeetCode.

📄️ 0622-DesignCircularQueue

Design your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle, and the last position is connected back to the first position to make a circle. It is also called "Ring Buffer".One of the benefits of the circular queue is that we can make use of the spaces in front of the queue. In a normal queue, once the queue becomes full, we cannot insert the next element even if there is a space in front of the queue. But using the circular queue, we can use the space to store new values.

📄️ 628 Maximum Product of Three Numbers

This is a solution to the Maximum Product of Three Numbers problem on LeetCode.

📄️ 0629 - K Inverse Pairs Array

This is a solution to the K Inverse Pairs Array problem on LeetCode.

📄️ 0630 - Course Schedule III

This is a solution to the Course Schedule III problem on LeetCode.

📄️ 0633. Sum of Square Numbers

This is a solution to the Sum of Square Numbers problem on LeetCode.

📄️ 0641-DesignCircularDeque

Design your implementation of the circular double-ended queue (deque).

📄️ 0643-MaximumAverageSubarrayI

You are given an integer array nums consisting of n elements, and an integer k.Find a contiguous subarray whose length is equal to k that has the maximum average value and return this value. Any answer with a calculation error less than 10-5 will be accepted.