dsc-banasthali-vidyapith/code-crossroad

This project contains the carefully compiled Data Structures & Algorithm questions asked by the companies that visit Banasthali Vidyapith on-campus.

code-crossroad's Issues

Finding the middle element of linked list

It would like to work on this issue in C++ using slow and fast pointer technique in O(N) time complexity and O(1) space complexity

Longest Consecutive Sequence

I would like to work upon this issue.

Question- Longest Consecutive Sequence
Language- C++
TIME COMPLEXITY- O(n)
SPACE COMPLEXITY- O(1)

Please assign me this question.

To change a Expression from Infix to Postfix.

The Expression would contain only uppercase Alphabets and some special characters .
I would be using C++ for changing the expression from infix to postfix.

Longest Substring Without Repeating Characters

Question- Given a string s, find the length of the longest substring without repeating characters.

Language- C++

time complexity- O(n)
Space complexity- O(n)

I would like to work on this issue using hash map or declaring a vector of same size. Please assign me this.

Knight on chess board

I would like to contribute c++ code for Knight on chess board problem.

Two Sum

PROBLEM STATEMENT
Given an array of integers nums and an integer target, return the indices of the two numbers such that they add up to the target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

You can return the answer in any order.

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].

SOLUTION:
I'd like to provide a well commented C++ code to this problem with the most optimised time and space complexity of O(N). I'd like to add the solution in the 'Array' topic folder.
Kindly assign this issue to me.

Lowest Common Ancestor of a Binary Tree

Aim

• Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

Details

• “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).”

I would very much like to work on this issue.
Its a question from LeetCode June challenge and also often comes in interviews.
I would like to use JAVA language for this problem.
Please assign this issue to me.

Number of subarrays having product less than K

I would like to solve this question in O(N) time and O(1) space complexity.

Coin Change(DP)

Aim
Given a value N, find the number of ways to make change for N cents, if we have infinite supply of each of S = { S1, S2, .. , SM } valued coins.

Details
Algorithm Paradigm - I will be using Dynamic Programming(Unbounded Knapsack) for this problem.
I wish to work on this problem in C++ language.
Please assign this to me.

Finding the middle element of a linked list

I would like to work on this issue in C++ using fast and slow pointer technique in O(N) time complexity and O(1) space complexity.

Solve_the_suduko (backtracking)

I would like to solve this issue using the concept of backtracking and recursion with the time complexity of O(9^(nn)). For every unassigned index, there are 9 possible options so the time complexity of solving the sudoku will be nearly O(9^(nn)).
Please assign this issue to me.

demo issue

demo issue

Word Ladder

I would like to solve Word Ladder question in O(N) time and O(1) space complexity using graph.
Kindly assign this issue to me.

Rotate Linked List

Aim :
Given the head of a linked list, rotate the linked list to the right by k places.

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

Details :
I would like to provide a C++ solution to this problem.
Please assign this issue to me @Vanshikagarg17

Rotate Array Problem

Aim: Given an unsorted array arr[] of size N, rotate it by D elements in the counter-clockwise direction.

I want to contribute to this code using Juggling Algorithm in C++ language.
Expected Time Complexity: O(n)
Auxiliary Space: O(1)
Please assign this problem to me.

Diameter of a Binary Tree

I would like to provide the C++ code for Diameter of a Binary Tree .

Please assign me this

Graph Coloring Problem

Aim

To determine all the different ways in which graph can be colored using at most m colors.

Details

• Graph represented by its adjacency matrix.
• Colors are represented by the integers 1,2,...,m.

I wish to work on this problem in C++ language.
Please assign this to me.

The_Celebrity_Problem.

I would like to solve this problem in 0(N)time and O(1)space complexity using Stack.

Reverse a linked list

I would like to solve this question in O(N) time and O(1) space complexity.

Reverse Bits

I'd like to provide the well commented C++ Code for this problem with the most optimized time and space complexity of O(1) using Divide and Conquer Approach. Kindly assign this issue to me.

Rotate image

I would like to work on this issue in c++ using Binary search and monotonic functions approach.

STOCK SPAN PROBLEM

Find the Missing Number

I would like to work on this issue in C++ in O(N) time and O(1) space complexity.

Diameter of a Binary Tree

Set kth bit

I'd like to work on this issue in C++, with time complexity O(1) and auxiliary space O(1).

Nom repeating numbers

I would like to work on this issue using XOR technique in O(N) time complexity and O(1) space complexity in C++.

Given a linked list of 0s, 1s and 2s and sort it

I would like to work on this issue in C++ in O(N) time and O(1) space complexity.

Maximum of all subarrays of size k

I would like to solve this question in O(N) time and O(k) space complexity using queue.

Swap two nibbles in a byte

I'd like to work on this issue in C++, with time complexity O(1) and auxiliary space O(1).

Longest Consecutive Sequence

Remove duplicates from sorted array

I would like to solve this question in O(N) time and O(1) space complexity.

first issue

vfvfcfd

Detect negative weight cycle (Bellman Ford's Algorithm)

Aim

• We are given a directed graph. We need to detect whether the graph has a negative cycle or not. A negative cycle is one in which the overall sum of the cycle becomes negative.

Details

• I will be solving this problem using Bellman Ford's Algorithm.
• Bellman Ford algorithm is a algorithm which help us to find the shortest path from a starting vertex to all other vertices of a weighted graph.

I would like to work on this problem using C++ language.
Please assign this issue to me.

Swap_Kth_Elements

Aim: Given an array arr[] of size N, swap the Kth element from beginning with Kth element from end.

I want to work on this code in O(1) Time Complexity and O(1) Auxiliary Space requirement, please assign this to me.

Maximum XOR of two numbers in an array

Problem Description :
Given an integer array 'nums', return the maximum result of nums[i] XOR nums[j], where 0 <= i <= j < n.

Example :
Input : nums = [3,10,5,25,2,8]
Output : 28
Explanation : The maximum result is 5 XOR 25 = 28.

My Contribution Details :
I'll provide the well commented C++ code with the most optimal Time Complexity of O(n) and Space Complexity of O(1) using the Trie approach.

Kindly assign this issue to me.

Group Anagrams

I would like to work upon this issue.
Question- Given an array of strings s, group the anagrams together. You can return the answer in any order.

Language- C++

Stock Span Problem

Question : The stock span problem is a financial problem where we have a series of n daily price quotes for a stock and we need to calculate span of stock’s price for all n days.
The span Si of the stock’s price on a given day i is defined as the maximum number of consecutive days just before the given day, for which the price of the stock on the current day is less than or equal to its price on the given day.

Language: C++

Expected Complexities:
Time=O(n)
Space=O(n)

Please assign me this.
Thank You!

Sort array in wave form

I would like to provide a C++ solution to this problem.
Please assign this issue to me.

Add some badges to the README

Description

Add some badges to the top of readme.md file, since the badges will be colorful and more attractive at the top of README.md file than the text the users will like it and after linking the badges it will also help them to navigate to different sections/ webpages like PRs, issues, contributors, etc.

Solution

I will add some badges at the top and also will add links related to them so that the README.md file will look more interactive and awesome.

Finding middle element of a linked list

I would like to work on this issue in C++ using slow and fast pointer technique in O(N) time complexity and O(1) space complexity

Find all possible Permutations of a String

Aim

In this problem all the possible permutations of a string will be printed as output.

Details

• Algorithm Paradigm - I will be using Backtracking for this problem.

I wish to work on this problem in JAVA language.
Please assign this to me.

Third Maximum number

I would like to solve this question in O(N) time and O(1) space complexity.

Parenthesis Checker

I'd like to contribute to the Parenthesis Checker Question
#34

STOCK SPAN PROBLEM

Question : The stock span problem is a financial problem where we have a series of n daily price quotes for a stock and we need to calculate span of stock’s price for all n days.
The span Si of the stock’s price on a given day i is defined as the maximum number of consecutive days just before the given day, for which the price of the stock on the current day is less than or equal to its price on the given day.

Language: C++
I will optimize time and space complexity in 0(N).
Please assign this issue to me .
Thank you.

Detect loop in Linked list

I would like to provide a C++ solution to this problem.
Please assign this issue to me.

Largest_Sum_Subarray

Aim : Given an array arr of N integers. Find the contiguous sub-array with maximum sum.
Expected Time Complexity: O(n)
Expected Auxiliary Space: O(1)

I want to write this code using Window Sliding Technique in C++ Language, please assign it to me.

Finding middle element of linked list

I would like to work on this issue in C++ using slow and fast pointer technique in O(N) time complexity and O(1) space complexity.

Find all possible words from phone digits (Backtracking)

I'd like to work on this problem and provide a well commented C++ code to it with exponential time and space complexity (the most optimal solution).
Please assign this issue to me.

Intersection of Two Linked Lists

AIM:
Given the heads of two singly linked lists head A and head B, return the node at which the two lists intersect. If the two linked lists have no intersection at all, return null.

Input: intersectVal = 8, listA = [4,1,8,4,5], listB = [5,6,1,8,4,5],
Output: Intersected at '8'

DETAILS:
I would like to provide a JAVA solution to this problem. Please assign this issue to me. @Vanshikagarg17

Segregate_0s_and_1s_in_array

I would like to work on this issue in C++ , with Expected Time Complexity: O(N) and Expected Auxiliary Space: O(1)
Please assign this to me .