A binary tree is a hierarchical data structure composed of nodes, each containing a data element and pointers to left and right child nodes. Its widely used in computer science for tasks like searching, sorting, and hierarchical representation. Key Components of a Binary Tree Node: The fundamental u...
Sliding window algorithms efficiently solve substring and subarray problems with linear time complexity. This technique uses two pointers to define a window that expands and contracts based on conditions. A basic sliding window structure in C: #include <stdio.h> #include <string.h> void...
A singly linked list consists of nodes, each containing a data element and a reference too the next node. import java.util.Scanner; public class LinkedList<E> { private int count = 0; private class ListNode { E value; ListNode successor; ListNode(E value, ListNode successor) { this.value = val...
Problem 1: Josephus Game with Alternating Directions Description: There are N friends numbered from 1 to N arranged in a circle. The game starts with the first person counting counterclockwise, and the M-th person is eliminated. Then, from the next person, counting proceeds clockwise, and the K-th p...
Recursion in C is a technique where a function calls itself to sollve a problem. The core idea involves breaking down a complex problem into smaller, similar subproblems until a base case is reached, at which point recursion stops. Core Principles of Recursion A recursive function must include a ter...
This lab explores fundamental C programming concepts through a series of tasks focusing on function implementation, recursion, and algorithmic problem-solving. Task 1: Score to Grade Conversion This task implements a function to convert a numerical score into a letter grade. Implementation #include...
Given an integer array values and a target integer goal, find the two numbers within the array whose sum equals goal and return their indices. Example 1: Input: values = [2,7,11,15], goal = 9 Output: [0,1] Explanation: values[0] + values[1] == 9. Example 2: Input: values = [3,2,4], goal = 6 Output:...
Linear dynamic programming is a specific approach within dynamic programming used to solve problems with a linear structure. In this paradigm, the states of the problem exhibit a linear relationship, and information is typically stored and transferred using a one-dimensional array. It is commonly ap...
Removing Nodes with a Specific Value from a Linked List Given the head node of a singly linked list and an integer value, the task is to delete all nodes whose value matches the given integer and return the new head of the list. Example: Input: head = [1,2,6,3,4,5,6], val = 6 Output: [1,2,3,4,5] App...
The greatest common divisor (GCD) of two or more integers is the largest positive integer that divides each of the numbers without leaving a remainder. For instance, the common divisors of 12 and 18 are 1, 2, 3, and 6. The largest among them is 6, so gcd(12, 18) = 6. This concept is fundamental in a...