Daily (110 day streak)
I would not say that intuition is that easy to build, but once you've done it - it is fairly easy. For that you would need to know Kadane's algo, which is a good problem to remind about it
https://leetcode.com/problems/maximum-subarray-sum-with-length-divisible-by-k/description/?envType=daily-question&envId=2025-11-27
#daily #medium
I would not say that intuition is that easy to build, but once you've done it - it is fairly easy. For that you would need to know Kadane's algo, which is a good problem to remind about it
https://leetcode.com/problems/maximum-subarray-sum-with-length-divisible-by-k/description/?envType=daily-question&envId=2025-11-27
#daily #medium
🔥2
CAN YOU FUCKING IMAGINE, chrome does not show "preview" or "content" of the page that was before redirection, but Edge does show it?
(yes, still trying to understand this phishing site)
https://superuser.com/questions/1788537/why-do-chromes-developer-tools-fail-to-always-collect-response-data
(yes, still trying to understand this phishing site)
https://superuser.com/questions/1788537/why-do-chromes-developer-tools-fail-to-always-collect-response-data
🤔1
Let me start.
Whenever you click on the "vote", the telegram page loads.
STEP 1. telegram-page.html (naming for simplicity, actually named "/pnbZeA4")
This telegram page is regular "document" request that loads bunch of js files:
- 4vt095smidla.js.
See screen 1.
STEP 2. telegram-client-preloader.js (actually named "/4vt095smidla.js")
This preloader loads telegram client loader and bunch of other .js files
See screen 2.
STEP 3. telegram-webworker-loader.js (actually named "/9nnoq789wklc.js").
This loader registers WebWorker that runs telegram client js. This webworker runs in separate thread so we actually don't see opened sockets to Telegram.
See screen 3
STEP 4 telegram-client-webworker.js (actually named "/vmu7hv3hxb8g.js") starts communication with telegram using websockets.
To see it in webtools, go to edge://inspect/#workers, and click "inspect" on all workers you will see
See screen 4, 5, 6
Attaching deobfuscated files (some of them are so large that I need to do it locally)
Whenever you click on the "vote", the telegram page loads.
STEP 1. telegram-page.html (naming for simplicity, actually named "/pnbZeA4")
This telegram page is regular "document" request that loads bunch of js files:
- 4vt095smidla.js.
See screen 1.
STEP 2. telegram-client-preloader.js (actually named "/4vt095smidla.js")
This preloader loads telegram client loader and bunch of other .js files
See screen 2.
STEP 3. telegram-webworker-loader.js (actually named "/9nnoq789wklc.js").
This loader registers WebWorker that runs telegram client js. This webworker runs in separate thread so we actually don't see opened sockets to Telegram.
See screen 3
STEP 4 telegram-client-webworker.js (actually named "/vmu7hv3hxb8g.js") starts communication with telegram using websockets.
To see it in webtools, go to edge://inspect/#workers, and click "inspect" on all workers you will see
See screen 4, 5, 6
Attaching deobfuscated files (some of them are so large that I need to do it locally)
🤯4
From now on, as they are changing domains the next day after my report - I will be posting domains to report here, so please join me, and let's ban motherfuckers, or at least make them pay for domains. For you it will be few clicks I will leave report content and links
👍2
Daily (111 day streak)
Everyone in discussion is keep saying it is hard, but I got stuck in understanding how to understand the node is leaf, or node is root, or node in the middle.
I will give you hint: the node is leaf in graph only in case it has single connection and this connection is parent. Otherwise problem is not that hard (check hints in leetcode)
https://leetcode.com/problems/maximum-number-of-k-divisible-components/description/?envType=daily-question&envId=2025-11-28
#daily #hard
Everyone in discussion is keep saying it is hard, but I got stuck in understanding how to understand the node is leaf, or node is root, or node in the middle.
I will give you hint: the node is leaf in graph only in case it has single connection and this connection is parent. Otherwise problem is not that hard (check hints in leetcode)
https://leetcode.com/problems/maximum-number-of-k-divisible-components/description/?envType=daily-question&envId=2025-11-28
#daily #hard
LeetCode
Maximum Number of K-Divisible Components - LeetCode
Can you solve this real interview question? Maximum Number of K-Divisible Components - There is an undirected tree with n nodes labeled from 0 to n - 1. You are given the integer n and a 2D integer array edges of length n - 1, where edges[i] = [ai, bi] indicates…
🔥1
Created an article about this website along with demo how this SharedWorker hides XHR/Socket/etc requests in the Network Tab:
https://andreyka26.com/this-phishing-site-hides-requests-in-network-tab
https://andreyka26.com/this-phishing-site-hides-requests-in-network-tab
andreyka26 tech
This phishing site HIDES requests in Network tab
I am Software Engineer at Microsoft. This is my tech blog where I would like to share my findings, guides and docs. Feel free to contact me.
❤2🔥2
Daily (112 day streak)
Easy one, Happy Saturday, probably the shortest solution I have ever had.
https://leetcode.com/problems/minimum-operations-to-make-array-sum-divisible-by-k/description/?envType=daily-question&envId=2025-11-29
#daily #easy
Easy one, Happy Saturday, probably the shortest solution I have ever had.
https://leetcode.com/problems/minimum-operations-to-make-array-sum-divisible-by-k/description/?envType=daily-question&envId=2025-11-29
#daily #easy