2025

beila

beila

beila

2025

A Quick Video Look at the Pigeon-Guided Missile Research

Darryl Laiu of the BBC made a nice two-and-a-half-minute video documentary about B.F. Skinner‘s Ig Nobel Peace-Prize-winning pigeon-guided missile project. The BBC describes it: The WWII experiment to make pigeon-guided missiles During WWII, psychologist B F Skinner tried to use pigeons to guide…

Feb 7, 2025

How to prove false statements? (Part 2)

blog.cryptographyengineering.com

This is the second part of a two three four-part series, which covers some recent results on “verifiable computation” and possible pitfalls that could occur there. This post won’t make much sense on its own, so I urge you to start with the first part. In the previous post we introduced a handful of…

Feb 7, 2025

Adding garbage collection to our Rust-based interpreters with MMTk

octavelarose.github.io

This is a blog post about the garbage collection framework MMTk and my experience implementing it into our own Rust-based intepreters. We talk about Rust a lot here, but we forgo a lot of its guarantees, for better or for worse, but definitely for performance. To be clear, these are research…

Feb 7, 2025

Extending the Coreutils project - Rewriting base tools in Rust | uutils

uutils.github.io

Extending the Coreutils project - Rewriting base tools in Rust Feb 1, 2025 Sylvestre Ledru As I just presented at FOSDEM, we are moving into the next phase of the uutils project. Over the last five years, we have been working on reimplementing some of the key Linux tools in Rust. We started with the…

Feb 7, 2025

Optimizing with Novel Calendrical Algorithms | jhpratt.dev

I have maintained the time crate for over five years now. In that time, tens of thousands of lines of code have been added, probably just as many removed, and countless more written but never committed. While benchmarks have been present for quite a while, I had never done one thing: truly optimize.…

Feb 7, 2025

Part 5b: Escaping the Typechecker, an Implementation

thunderseethe.dev

Armed with the knowledge of IR and Type from last time , we can finally write some code: One line down. That’s great progress (especially compared to last post)! Refresher on Base AST It’s been awhile since we worked with our base typechecker. I don’t really remember what all was in there, so let’s…

Feb 7, 2025

Sort a linked list of 0s, 1s and 2s - GeeksforGeeks

geeksforgeeks.org

Given a linked list of 0s, 1s and 2s, The task is to sort the list in non-decreasing order. Examples: Input: 1 -> 1 -> 2 -> 0 -> 2 -> 0 -> 1 -> NULL Output: 0 -> 0 -> 1 -> 1 -> 1 -> 2 -> 2 -> NULL Input: 1 -> 1 -> 2 -> 1 -> 0 -> NULL Output: 0 -> 1 -> 1 -> 1 -> 2 -> NULL [Expected Approach - 1] By…

Feb 6, 2025

Deletion in Linked List - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice Deleting a node in a Linked List is an important operation and can be done in three main ways: removing the first node, removing a node in the middle, or removing the last node. In this article, we will explore deletion operation on Linked List for all the above scenarios.…

Feb 6, 2025

Count Occurrences in a Linked List - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice Given a singly linked list and a key, the task is to count the number of occurrences of the given key in the linked list. Example : Input : head: 1->2->1->2->1->3->1 , key = 1 Output : 4 Explanation: key equals 1 has 4 occurrences. Input : head: 1->2->1->2->1, key = 3 Output :…

Feb 6, 2025

Remove every k-th node of the linked list - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice Given a singly linked list, the task is to remove every kth node of the linked list. Assume that k is always less than or equal to the length of the Linked List. Examples : Input: LinkedList: 1 -> 2 -> 3 -> 4 -> 5 -> 6, k = 2 Output: 1 -> 3 -> 5 Explanation: After removing…

Feb 6, 2025

Implement a stack using singly linked list - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice To implement a stack using a singly linked list, we need to ensure that all operations follow the LIFO (Last In, First Out) principle. This means that the most recently added element is always the first one to be removed. In this approach, we use a singly linked list, where…

Feb 6, 2025

Queue - Linked List Implementation - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice In this article, the Linked List implementation of the queue data structure is discussed and implemented. Print '-1' if the queue is empty. Approach: To solve the problem follow the below idea: we maintain two pointers, front and rear. The front points to the first item of the…

Feb 6, 2025

Delete a Node from linked list without head pointer - GeeksforGeeks

geeksforgeeks.org

You are given a singly linked list and pointer which is pointing to the node which is required to be deleted. Any information about the head pointer or any other node is not given. You need to write a function to delete that node from the linked list. Your function will take only one argument, i.e.,…

Feb 6, 2025

Merge a linked list into another linked list at alternate positions - GeeksforGeeks

geeksforgeeks.org

Given two singly linked lists, The task is to insert nodes of the second list into the first list at alternate positions of the first list and leave the remaining nodes of the second list if it is longer. Example: Input: head1: 1->2->3 , head2: 4->5->6->7->8 Output: head1: 1->4->2->5->3->6 , head2:…

Feb 6, 2025

Deletion from a Circular Linked List - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice In this article, we will learn how to delete a node from a circular linked list. In a circular linked list, the last node connects back to the first node, creating a loop. There are three main ways to delete a node from circular linked list: Deletion at the beginningDeletion…

Feb 6, 2025

Delete last occurrence of an item from linked list - GeeksforGeeks

geeksforgeeks.org

Given a singly linked list and a key, the task is to delete the last occurrence of that key in the linked list. Examples: Input: head: 1 -> 2 -> 3 ->1 -> 4 -> NULL, key = 1 Output: 1 -> 2 -> 3 -> 4 -> NULL Input: head: 1 -> 2 -> 3 -> 4 -> 5 -> NULL , key = 3 Output: 1 -> 2 -> 4 -> 5 -> NULL…

Feb 6, 2025

Program for Nth node from the end of a Linked List - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice Given a Linked List of M nodes and a number N, find the value at the Nth node from the end of the Linked List. If there is no Nth node from the end, print -1. Examples: Input: 1 -> 2 -> 3 -> 4, N = 3 Output: 2 Explanation: Node 2 is the third node from the end of the linked…

Feb 6, 2025

Rotate a Linked List - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice Given a singly linked list and an integer k, the task is to rotate the linked list to the left by k places. Examples: Input: linked list = 10 -> 20 -> 30 -> 40 -> 50, k = 4 Output: 50 -> 10 -> 20 -> 30 -> 40 Explanation: After rotating the linked list to the left by 4 places,…

Feb 6, 2025

Reverse a Linked List - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice Given a linked list, the task is to reverse the linked list by changing the links between nodes. Examples: Input: head: 1 -> 2 -> 3 -> 4 -> NULL Output: head: 4 -> 3 -> 2 -> 1 -> NULL Explanation: Reversed Linked List: Input: head: 1 -> 2 -> 3 -> 4 -> 5 -> NULL Output: head: 5…

Feb 6, 2025

Find Middle of the Linked List - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice Given a singly linked list, the task is to find the middle of the linked list. If the number of nodes are even, then there would be two middle nodes, so return the second middle node. Example: Input: linked list: 1->2->3->4->5 Output: 3 Explanation: There are 5 nodes in the…

Feb 6, 2025

Partitioning a linked list around a given value and keeping the original order - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice Given a linked list and a value x, partition it such that all nodes less than x come first, then all nodes with a value equal to x, and finally nodes with a value greater than x. The original relative order of the nodes in each of the three partitions should be preserved.…

Feb 6, 2025

Reverse alternate K nodes in a Singly Linked List - GeeksforGeeks

geeksforgeeks.org

Given a linked list, The task is to reverse alternate k nodes. If the number of nodes left at the end of the list is fewer than k, reverse these remaining nodes or leave them in their original order, depending on the alternation pattern. Example: Input: 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> NULL, k = 2…

Feb 6, 2025

Rearrange a given linked list in-place - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice Given a singly linked list L0 -> L1 -> … -> Ln-1 -> Ln. Rearrange the nodes in the list so that the newly formed list is : L0 -> Ln -> L1 -> Ln-1 -> L2 -> Ln-2 ... You are required to do this in place without altering the nodes' values. Examples: Input: 1 -> 2 -> 3 -> 4…

Feb 6, 2025

Reverse a sublist of linked list - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice Given a linked list and positions m and n. We need to reverse the linked list from position m to n. Examples: Input : linkedlist : 10->20->30->40->50->60->70->NULL , m = 3 and n = 6 Output : 10->20->60->50->40->30->70->NULL Explanation: Linkedlist reversed starting from the…

Feb 6, 2025

Convert a Binary Tree into Doubly Linked List in spiral fashion - GeeksforGeeks

geeksforgeeks.org

Given a binary tree, convert it into a doubly linked list (DLL) where the nodes are arranged in a spiral order. The left pointer of the binary tree node should act as the previous node in the DLL, and the right pointer should act as the next node in the DLL. The solution should not allocate extra…

Feb 6, 2025

Swap Kth node from beginning with Kth node from end in a Linked List - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice Given a singly linked list, swap kth node from beginning with kth node from end. Swapping of data is not allowed, only pointers should be changed. This requirement may be logical in many situations where the linked list data part is huge (For example student details like Name,…

Feb 6, 2025

Add Two Numbers Represented as Linked List - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice Given two numbers represented as two lists, the task is to return the sum of two lists. Note: There can be leading zeros in the input lists, but there should not be any leading zeros in the output list. Examples: Input: num1 = 4 -> 5, num2 = 3 -> 4 -> 5 Output: 3 -> 9 -> 0…

Feb 6, 2025

Intersection of two Sorted Linked Lists - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice Given two lists sorted in increasing order, create and return a new list representing the intersection of the two lists. The new list should be made with its own memory — the original lists should not be changed. Example: Input: First linked list: 1->2->3->4->6 Second linked…

Feb 6, 2025

Detect and Remove Loop in Linked List - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice Given the head of a linked list that may contain a loop. A loop means that the last node of the linked list is connected back to a node in the same list. The task is to remove the loop from the linked list (if it exists). Example: Input: Output: 1 -> 3 -> 4 Explanation: The…

Feb 6, 2025

Delete all occurrences of a given key in a linked list - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice Given a singly linked list, the task is to delete all occurrences of a given key in it. Examples: Input: head: 2 -> 2 -> 1 -> 8 -> 2 -> NULL, key = 2 Output: 1 -> 8 -> NULL Explanation: All occurrences of the given key = 2, is deleted from the Linked List Input: head: 1 -> 1…

Feb 6, 2025

Find if there is a rectangle in binary matrix with corners as 1 - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice Given a binary matrix containing only 0s and 1s. The task is to check whether there exists a rectangle or square submatrix of size at least 2 × 2 such that all four corners of that submatrix are 1. This means we must find four positions in the matrix (top-left, top-right,…

Feb 6, 2025

Find All Duplicate Subtrees - GeeksforGeeks

geeksforgeeks.org

Try it on GfG Practice Given a binary tree, the task is to find all duplicate subtrees. For each duplicate subtree, we only need to return the root node of any one of them. Two trees are duplicates if they have the same structure with the same node values. Example: Input : Binary tree 1 / \ 2 3 / /…

Feb 6, 2025

Length of longest strict bitonic subsequence - GeeksforGeeks

geeksforgeeks.org

Given an array arr[] containing n integers. The problem is to find the length of the longest strict bitonic subsequence. A subsequence is called strict bitonic if it is first increasing and then decreasing with the condition that in both the increasing and decreasing parts the absolute difference…

Feb 6, 2025

No articles.

▹ Newer Articles Older Articles ▹

↑ Click & drag up to your Bookmarks Bar.