aayushi1499 / hacktoberfest2021-dsa Goto Github PK

You are given a partially written BST class. function is expected to find the lowest common ancestor of d1 and d2.

i want to add airline restrictions codechef problem
LINK:
https://www.codechef.com/SEPT21C/problems/AIRLINE

I would like to add the C++ code for finding the intersection node (by address) of 2 linked lists.
Contribution under Hacktoberfest 2021.

Can I add binary search tree algorithm in Java as a contribution for Hacktoberfest 2021?

Given the head of a linked list, remove the nth node from the end of the list and return its head.

Example 1:
Input: head = [1,2,3,4,5], n = 2
Output: [1,2,3,5]

Example 2:
Input: head = [1], n = 1
Output: []

Hey there, I'm participating in #hactoberfest2k21, Please assign me the issue. Good day!
Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.
Example:
Input: intervals = [[1,3],[2,5]]
Output: [[1,5]]