Online C Playground that allow you to visualize your running C program Memory/ConceurrencyDatastructure & Algorithm try it here https://8gwifi.org/online-c-compiler/

Most online compilers only print output. These do more: press Visualize and the compiler replays your program one line at a time, drawing every data structure as it changes and highlighting each variable read and write. It's the fastest way to see how sorting, binary search, recursion, and BFS/DFS actually work — and to debug why your algorithm does what it does. supported in 8 different languages of your choice
https://8gwifi.org/online-compiler

This online compiler allows you to visualise memory layout of your given code and how it works try it here https://8gwifi.org/online-compiler looking for feedback and Bugs

Try it here https://8gwifi.org/electronics/logic-simulator.jsp

Try it here https://8gwifi.org/physics/ray-optics-simulator.jsp

The Online Lua Compiler & Algorithm Visualizer https://8gwifi.org/online-lua-compiler/

currently supporting
1D arrays (tables) — {1, 2, 3}, dense integer-keyed tables
2D arrays (nested tables) — {{1,2},{3,4}}
Maps / hash tables — tables with non-sequential or string keys
Linked lists & trees — node tables ({ val, next } / { val, left, right })
Console — print
Control flow — functions (incl. recursion)

Looking for feedback and Bug's appreciated

Now you can visualise data structure currenlty supported

Try it here https://8gwifi.org/online-c-compiler/

1D arrays — int[], int[N]
Dynamic arrays — int* a = malloc(n * sizeof(int)), calloc(n, sizeof(int)), realloc(p, n * sizeof(int))
Strings / char arrays — char[N], char s[] = "..."
2D arrays / matrices — int[R][C]
Compound assignment & increment — any instrumented cell: a[i], m[i][j]
Linked lists & trees — self-referential structs (struct Node { int val; struct Node* next; } / { int val; struct Node *left, *right; })
Concurrency (threads & mutexes) — pthread_t, pthread_mutex_t

Programmers learning Rust struggle to understand ownership types, Rust’s core mechanism for ensuring memory safety without garbage collection now you can see exactly what's permission is going on with the code
https://8gwifi.org/online-rust-compiler/

Try it here https://8gwifi.org/online-rust-compiler/

Currently Supporting

• 1D arrays — Vec<i32>, [i32; N]
• 2D arrays / matrices — Vec<Vec<i32>>, [[i32; C]; R]
• Maps — HashMap<i32, i32>, BTreeMap<i32, i32>
• Sets — HashSet<i32>, BTreeSet<i32>
• Stacks / queues / heaps — Vec<i32> (as a stack), VecDeque<i32>, BinaryHeap<i32>
• Linked lists & trees
• Concurrency — std::thread::spawn, mpsc::channel / sync_channel, Mutex (incl. Arc<Mutex>)

looking for Feedback and Bug's for Improvement

Online compiler Try it here https://8gwifi.org/online-cpp-compiler

Supported Languages Java/Python/Go

Try yourself

Python version : https://8gwifi.org/online-python-compiler/
Java Version https://8gwifi.org/online-java-compiler/

A Java Algorithms purely made with JSP and servlet try yourself here https://8gwifi.org/online-java-compiler/

Supported

• 1D arrays — int[] index read · index write · element swap
• 2D arrays — int[][] row/column index read · cell write
• Lists — ArrayList, LinkedList, List get · set · add
• Maps — HashMap, Map get · put
• Sets — HashSet, Set add · remove
• Queues — ArrayDeque, Queue offer · poll
• Binary trees — com.onecompiler.viz.model.TreeNode construction · recursive traversal refresh Use the provided TreeNode helper class.
• Console — System.out println
• Control flow — methods on com.onecompiler.viz.runner.Main line highlight · call stack push/pop

Not supported yet

• Adjacency-list graphs / BFS on generic graphs — No graph edge instrumentation Use instead: Use TreeNode for tree algorithms
• Linked lists as graph structures — Lists are visualized as arrays, not pointer graphs Use instead: Use TreeNode or model links with TreeNode
• Primitive arrays other than int / int[][] — Agent targets int[] and int[][] first Use instead: Use List<Integer> or int[]
• Array slicing — Java has no slice syntax Use instead: Use explicit index loops

Try yourself here https://8gwifi.org/math/rubik-nxn-solver.jsp

Edit the stickers to match your cube state and hit solve or Hit scramble and then solve it

Code Playground https://8gwifi.org/code-playground/