Ειδήσεις: O(N) | PXAI

Version	Description	Date
8.42	[ADDED SOURCE REGISTRY LIST VIEW]	04/03/2026 16:19
8.41	[LOCALIZED INDEX.PHP MENU AND MODALS TO US ENGLISH]	04/03/2026 16:11
8.40	[TRANSLATED FRONTEND TO US ENGLISH]	04/03/2026 16:10
8.41	[RESTORED DETAILED SOURCES VIEW (ARTICLES + EVENTS) IN US ENGLISH]	04/03/2026 15:50
8.41	[RESTORED DETAILED SOURCES VIEW (ARTICLES + EVENTS) IN US ENGLISH]	04/03/2026 15:46
8.40	[REVERTED TO STANDARD TABLE LAYOUT (US ENGLISH)]	04/03/2026 15:40
8.39	[FIXED DB CONNECTION SCOPE IN SOURCES LOGIC]	04/03/2026 15:38
8.38	[TRANSLATED SOURCES VIEW TO US ENGLISH]	04/03/2026 15:01
8.37	[FULL FRONTEND TRANSLATION (MENU, FEED, COMMENTS, TTS) TO US ENGLISH.]	04/03/2026 14:58
8.67	[MANUAL OVERRIDE OF GREEK MENU ITEMS]	04/03/2026 13:36
8.66	[NGINX OPTIMIZED MENU FIX]	04/03/2026 13:33
8.65	[FIXED GREEK MENU ITEMS]	04/03/2026 13:32
8.60	[MENU & UI LOCALIZATION TO US ENGLISH]	04/03/2026 13:30
8.50	[FULL TRANSLATION TO US ENGLISH]	04/03/2026 13:27
9.75	[INJECTED EVENT FUSION_SUMMARY INTO FEED LOOPS TO DISPLAY AI TAGS CORRECTLY]	26/02/2026 14:44

22/03 16:33 dev.to

Removing Duplicates from a Sorted Linked List

Linked List Duplicates Sorted In-Place O(n)Algorithm

22/03 15:22 dev.to

Kadanes Algorithm

Kadane maximum subarray dynamic programming contiguous subarray time complexity negative numbers

22/03 15:22 dev.to

Majority Element

majority element Boyer‑Moore O(n) time O(1) space voting algorithm Python implementation

22/03 15:16 dev.to

Task – Move All Negative Elements to the End (Maintain Order)

array negative numbers stable partition in-place O(n) algorithm

22/03 15:02 dev.to

Task – Find Minimum and Maximum Element in an Array

array minimum maximum single-pass O(n)algorithm

22/03 13:04 dev.to

Kadane's Algorithm

Kadane's algorithm maximum subarray dynamic programming array algorithm coding interview

20/03 08:32 dev.to

Squares of a Sorted Array

sorted array two-pointer squares negative numbers algorithm time complexity

20/03 05:13 dev.to

Kadane’s Algorithm – Maximum Subarray Sum

Kadane's Algorithm maximum subarray linear time O(n)contiguous subarray algorithmic problem

20/03 05:13 dev.to

Kadane’s Algorithm – Maximum Subarray Sum

Kadane's Algorithm maximum subarray linear time O(n)contiguous subarray algorithmic problem

Loading...