Запросы в Яндексе
В топ 10
В топ 20
Органическая выдача
Конкурентов
8
Упущенных запросов
5
Ссылки
в графе ссылок Common Crawl домена нет: на него почти не ссылаются или он новыйОрганическая выдача
Запросы сайта
| Запрос | Частота | Место |
|---|---|---|
| ugly number | 5 | 4 |
Упущенные запросы
| Запрос | Частота | У конкурентов в топ-10 |
|---|---|---|
| happy number | 15 | leetcode.com |
| find numbers | 12 | leetcode.com |
| add two numbers | 11 | leetcode.com |
| number of islands | 10 | leetcode.com |
| 2 add two numbers | 7 | leetcode.com |
Доля в топе
По 500 частотным запросам самого сайта, поэтому он здесь всегда заметен. Место в нише среди конкурентов — в блоке «Рейтинг среди конкурентов».
Ядро конкурентов
| Запрос | Частота | Сайтов | tahanima | leetcode | medium | geeksforge | algo |
|---|---|---|---|---|---|---|---|
| ugly number | 5 | 5 | 4 | 1 | 2 | 3 | 5 |
| reverse linked list | 26 | 4 | 1 | 2 | 3 | 5 | |
| merge k sorted lists | 23 | 4 | 1 | 2 | 3 | 5 | |
| container with most water | 20 | 4 | 1 | 2 | 5 | 7 | |
| longest palindromic substring | 20 | 4 | 1 | 2 | 3 | 7 | |
| median of two sorted arrays | 17 | 4 | 1 | 2 | 3 | 5 | |
| roman to integer | 16 | 4 | 2 | 3 | 1 | 7 | |
| valid parentheses | 15 | 4 | 1 | 2 | 5 | 4 | |
| longest increasing subsequence | 15 | 4 | 1 | 4 | 5 | 9 | |
| remove duplicates from sorted array | 14 | 4 | 1 | 2 | 3 | 4 | |
| perfect squares | 12 | 4 | 3 | 2 | 4 | 7 | |
| add two numbers | 11 | 4 | 1 | 2 | 10 | 5 | |
| trapping rain water | 9 | 4 | 1 | 2 | 7 | 8 | |
| best time to buy and sell stock | 7 | 4 | 1 | 2 | 7 | 3 | |
| preorder traversal | 5 | 4 | 5 | 1 | 2 | 8 | |
| majority element | 3 | 4 | 1 | 2 | 4 | 5 | |
| maximum subarray | 3 | 4 | 1 | 2 | 5 | 6 | |
| linked list cycle | 3 | 4 | 1 | 2 | 4 | 6 | |
| binary tree preorder traversal | 3 | 4 | 1 | 3 | 2 | 7 | |
| максимум в скользящем окне | 2 | 4 | 3 | 2 | 1 | 5 | |
| non decreasing order | 2 | 4 | 9 | 4 | 2 | 7 | |
| binary tree level order traversal | 1 | 4 | 1 | 2 | 3 | 4 | |
| binary tree inorder traversal | 1 | 4 | 4 | 3 | 1 | 5 | |
| minimum height trees | 0 | 4 | 1 | 2 | 4 | 3 | |
| line reflection | 54 | 3 | 7 | 3 | 6 | ||
| knapsack | 51 | 3 | 2 | 9 | 10 | ||
| combinations | 34 | 3 | 11 | 3 | 10 | ||
| two sum | 32 | 3 | 1 | 2 | 11 | ||
| monotonic stack | 32 | 3 | 3 | 2 | 6 | ||
| zigzag iterator leetcode | 29 | 3 | 3 | 4 | 6 | ||
| 3sum | 27 | 3 | 4 | 3 | 7 | ||
| design hit counter | 27 | 3 | 6 | 3 | 4 | ||
| pandas задачи | 27 | 3 | 10 | 3 | 2 | ||
| segment tree | 27 | 3 | 2 | 5 | 10 | ||
| decode string | 24 | 3 | 6 | 3 | 8 | ||
| merge sorted array | 17 | 3 | 2 | 4 | 6 | ||
| perfect square | 17 | 3 | 6 | 2 | 4 | ||
| next permutation | 16 | 3 | 3 | 4 | 5 | ||
| merge two sorted lists | 14 | 3 | 1 | 3 | 8 | ||
| two sum python | 13 | 3 | 3 | 2 | 7 | ||
| задачи на сортировку | 13 | 3 | 4 | 1 | 6 | ||
| subsets | 11 | 3 | 1 | 2 | 7 | ||
| fizzbuzz задача | 11 | 3 | 8 | 4 | 10 | ||
| number of islands | 10 | 3 | 1 | 8 | 3 | ||
| top k frequent elements | 10 | 3 | 1 | 2 | 7 | ||
| valid palindrome | 10 | 3 | 2 | 3 | 7 | ||
| max stack | 10 | 3 | 5 | 2 | 6 | ||
| reverse words | 10 | 3 | 7 | 2 | 10 | ||
| изоморфные строки | 10 | 3 | 8 | 2 | 9 | ||
| max depth | 10 | 3 | 11 | 3 | 6 | ||
| search in rotated sorted array | 9 | 3 | 1 | 4 | 7 | ||
| inorder traversal | 9 | 3 | 6 | 2 | 3 | ||
| word patterns | 9 | 3 | 7 | 1 | 10 | ||
| python problems | 8 | 3 | 1 | 3 | 2 | ||
| longest common subsequence | 8 | 3 | 1 | 5 | 10 | ||
| design hit counter leetcode | 8 | 3 | 1 | 5 | 6 | ||
| remove nth node from end of list | 8 | 3 | 2 | 6 | 4 | ||
| subsequence | 8 | 3 | 8 | 2 | 10 | ||
| sum range | 8 | 3 | 8 | 2 | 5 | ||
| xor сумма | 8 | 3 | 10 | 4 | 6 | ||
| 27 remove element | 7 | 3 | 1 | 2 | 7 | ||
| find k closest elements | 7 | 3 | 1 | 5 | 4 | ||
| first unique character in a string | 7 | 3 | 1 | 2 | 4 | ||
| rotate array | 7 | 3 | 2 | 1 | 7 | ||
| max stack leetcode | 7 | 3 | 2 | 3 | 6 | ||
| pascal s triangle | 7 | 3 | 5 | 4 | 9 | ||
| remove duplicates from sorted array leetcode | 6 | 3 | 1 | 2 | 3 | ||
| product of array except self | 6 | 3 | 1 | 3 | 7 | ||
| 26 remove duplicates from sorted array | 5 | 3 | 1 | 2 | 3 | ||
| validate binary search tree | 5 | 3 | 1 | 7 | 4 | ||
| isomorphic strings | 5 | 3 | 1 | 4 | 6 | ||
| two sum leetcode java | 5 | 3 | 1 | 2 | 6 | ||
| bit count python | 5 | 3 | 4 | 5 | 8 | ||
| string compression | 4 | 3 | 1 | 2 | 4 | ||
| dfs tree | 4 | 3 | 3 | 4 | 6 | ||
| reverse integer leetcode | 3 | 3 | 1 | 2 | 8 | ||
| двумерный массив спираль | 3 | 3 | 2 | 6 | 8 | ||
| contains duplicate | 3 | 3 | 2 | 4 | 10 | ||
| 70 climbing stairs | 2 | 3 | 4 | 2 | 3 | ||
| 202 happy number | 2 | 3 | 4 | 2 | 3 | ||
| 1 two sum | 2 | 3 | 5 | 2 | 4 | ||
| 238 product of array except self | 2 | 3 | 1 | 3 | 6 | ||
| odd count | 1 | 3 | 4 | 2 | 3 | ||
| 876 middle of the linked list | 1 | 3 | 1 | 2 | 3 | ||
| sum 2 | 1 | 3 | 2 | 9 | 5 | ||
| add two numbers leetcode python | 1 | 3 | 1 | 2 | 6 | ||
| jump game leetcode | 0 | 3 | 1 | 3 | 4 | ||
| string compression leetcode | 0 | 3 | 1 | 2 | 5 | ||
| valid parentheses python | 0 | 3 | 2 | 10 | 9 | ||
| вотс апп веб | 124 515 | 2 | 4 | 10 | |||
| c | 65 847 | 2 | 2 | 6 | |||
| html head | 60 436 | 2 | 7 | 8 | |||
| cursor ai | 13 612 | 2 | 4 | 10 | |||
| node js | 10 517 | 2 | 5 | 11 | |||
| leetcode | 10 163 | 2 | 1 | 4 | |||
| переводчик гугл по фото | 9 282 | 2 | 2 | 5 | |||
| переводчик по фото гугл | 9 282 | 2 | 2 | 6 | |||
| шифр цезаря | 9 248 | 2 | 3 | 11 | |||
| гугл переводчик по фото | 9 224 | 2 | 2 | 4 | |||
| цвета радуги | 8 416 | 2 | 2 | 8 |
Запросы, частоты и места на август 2026: по данным Букварикса