bhumikatewary / practice-problems

All DSA Solutions in one repo! You are free to contribute your code.

Hello World! I'm Bhumika 👩‍💻

I am an Undergraduate Student pursuing my B.Tech from Heritage Institute of Technology, Kolkata

• 🌱 I’m currently learning Data Analytics
• 👯 I’m looking to collaborate on open source
• 📫 Reach out to me: [email protected]
• ⚡ Fun fact: I know how to play a piano

🚀 My Work Stack:

I am currently listening to:

📊 My Github Stats:

Connect with me through

practice-problems's Issues

Adding solution to standard Monotonic Stack problems

will create a dedicated folder for Monotonic Stacks and add solutions to some standard questions for this topic.

Rat in a maze problem by backtracking

Hey @bhumikatewary I want to contribute with code to this problem. Please assign it ot me.

Linked List solution in c++

Adding codes of Tree Data Structure

[Java] Container with most water

Please assign this issue to me.

Notes Addition

Java Stack Code

I would like to upload my stack implementation in java code to you repo

Different Traversal of Binary Tree

Please add hacktoberfest mark in this

Adding solutions for Queue Data Structure

Java code for array

In the Array folder ,Can i write the code in java else you can tell me in which part should i work on through java language .

Thank - you

[PYTHON] Armstrong Numbers Checker

[PYTHON] Roman Numerals String to Integer Literals

Added Circle of string problem in graph

plz assign me the issue

Prim's Minimum Spanning Tree

I want to add implementation of Prim's Minimum Spanning Tree of a Graph using C++. Please assign this task to me.

Arithmetic slices (DP problem) in c++

Tower of Hanoi iterative solution

Should I add tower of hanoi problem solution (iterative solution using DP) for hacktoberfest

First Missing Positive

I want to add first missing positive integer solution in arrays using java. Please assign this task to me.

Adding solution to Standard Recursion and backtracking problems

1. Print all the subsequence
2. Print all the subset
3. Print all the permutations of an array
4. Fibonacci number
5. Combination sum

3SAT implementation in c++

Add binary tree maximum path sum algorithm

Hi @bhumikatewary, I would like to contribute binary tree maximum path sum algorithm.

Connect n ropes with minimum cost problem using priority queue

Please assign this issue to me.

Longest Palindromic Subsequence (DP on String) in c++

Hi @bhumikatewary, I want to add LPS code in c++ under the DP file section.
Can you please assign it to me?

Object oriented examples: Add C++ function pointer example

I'd like to add an example to the OOPS directory that uses function pointers with C++ classes.

[c++] Remove Nth Node From End of List and add-two-numbers

Dijkstra's algorithm in c++

Expression Evaluation Implementation Using Binary Search Tree

I want to contribute this, can I do it ?

searching in python

• Add Searching algorithm in python
  • make it easy to understand for beginners
• Two searching algorithms
  • binary search
  • linear search

Implementation of Disjoint Set Union

Hi @bhumikatewary, I want to add the implementation of DSU.
Can you please assign it to me?

Added Longest Substring Without Repeating Character Problem in C++

[PYTHON] Find number closest to n but divisible by m

Tower of Hanoi

Can I contribute with Tower of Hanoi algorithm?

Implementing Articulation Points in C++

I want to add implementation of finding articulation_points in graph using C++. Please assign this task to me.

[Java] Largest Sum Contiguous Subarray(Kadane's Algorithm)

Please assign this issue to me.

Kruska's Minimum Spanning Tree in C++

I want to add implementation of Kruskal's minimum spanning tree of a graph using C++. Please assign this task to me.

Kruskals implementation in c++

//Given an undirected, connected and weighted graph, find Minimum Spanning Tree (MST) of the graph using Kruskal’s algorithm.
#include<bits/stdc++.h>
using namespace std;

// Creating shortcut for an integer pair
typedef pair<int, int> iPair;

// Structure to represent a graph
struct Graph
{
int V, E;
vector< pair<int, iPair> > edges;

// Constructor
Graph(int V, int E)
{
    this->V = V;
    this->E = E;
}

// Utility function to add an edge
void addEdge(int u, int v, int w)
{
    edges.push_back({w, {u, v}});
}

// Function to find MST using Kruskal's
// MST algorithm
int kruskalMST();

};

// To represent Disjoint Sets
struct DisjointSets
{
int *parent, *rnk;
int n;

// Constructor.
DisjointSets(int n)
{
    // Allocate memory
    this->n = n;
    parent = new int[n+1];
    rnk = new int[n+1];

    // Initially, all vertices are in
    // different sets and have rank 0.
    for (int i = 0; i <= n; i++)
    {
        rnk[i] = 0;

        //every element is parent of itself
        parent[i] = i;
    }
}

// Find the parent of a node 'u'
// Path Compression
int find(int u)
{
    /* Make the parent of the nodes in the path
    from u--> parent[u] point to parent[u] */
    if (u != parent[u])
        parent[u] = find(parent[u]);
    return parent[u];
}

// Union by rank
void merge(int x, int y)
{
    x = find(x), y = find(y);

    /* Make tree with smaller height
    a subtree of the other tree */
    if (rnk[x] > rnk[y])
        parent[y] = x;
    else // If rnk[x] <= rnk[y]
        parent[x] = y;

    if (rnk[x] == rnk[y])
        rnk[y]++;
}

};

/* Functions returns weight of the MST*/

int Graph::kruskalMST()
{
int mst_wt = 0; // Initialize result

// Sort edges in increasing order on basis of cost
sort(edges.begin(), edges.end());

// Create disjoint sets
DisjointSets ds(V);

// Iterate through all sorted edges
vector< pair<int, iPair> >::iterator it;
for (it=edges.begin(); it!=edges.end(); it++)
{
    int u = it->second.first;
    int v = it->second.second;

    int set_u = ds.find(u);
    int set_v = ds.find(v);

    // Check if the selected edge is creating
    // a cycle or not (Cycle is created if u
    // and v belong to same set)
    if (set_u != set_v)
    {
        // Current edge will be in the MST
        // so print it
        cout << u << " - " << v << endl;

        // Update MST weight
        mst_wt += it->first;

        // Merge two sets
        ds.merge(set_u, set_v);
    }
}

return mst_wt;

}

// Driver program to test above functions
int main()
{
/* Let us create above shown weighted
and undirected graph */
int V = 9, E = 14;
Graph g(V, E);

// making above shown graph
g.addEdge(0, 1, 4);
g.addEdge(0, 7, 8);
g.addEdge(1, 2, 8);
g.addEdge(1, 7, 11);
g.addEdge(2, 3, 7);
g.addEdge(2, 8, 2);
g.addEdge(2, 5, 4);
g.addEdge(3, 4, 9);
g.addEdge(3, 5, 14);
g.addEdge(4, 5, 10);
g.addEdge(5, 6, 2);
g.addEdge(6, 7, 1);
g.addEdge(6, 8, 6);
g.addEdge(7, 8, 7);

cout << "Edges of MST are \n";
int mst_wt = g.kruskalMST();

cout << "\nWeight of MST is " << mst_wt;

return 0;

}

LinkedList solutions in Python

New Linked list problem

Hi @bhumikatewary , I want to add the c++ solution to the problem: detecting loops in a linked list. Can you assign this task to me?

Lomuto partition in cpp

Raising a request to add Lomuto partition in Sorting

Adding DP Problems and Solutions

LinkedList solutions in java

2SAT implementation in c++

[c++] Number of 1 bits (aka hamming weights)

I noticed there's already an implementation in the bit manipulation folder, but I'd like to add a second implementation that uses the standard library to calculate the hamming weight of a number.

Strongly Connected Components in Graph using C++

I want to add implementation of Strongly Connected Components in Graph using C++. Please assign this task to me.

Bellman–Ford algorithm implementation

First Missing Integer Python

I'd like to implement the following algorithm for Python:

Given an unsorted integer array, find the first missing positive integer.
Example:
Given [1,2,0] return 3,
[3,4,-1,1] return 2,
[-8, -7, -6] returns 1

Your algorithm should run in O(n) time and use constant space.

Allocate minimum number of pages problem in java

Please assign this issue to me.

Added Binary Tree Preorder Traversal in C++

Please assign me this issue.

Math Problems and Solutions

Add Increasing Triplet Subsequence

Hi @bhumikatewary, I would like to add Leetcode problem, 334. Increasing Triplet Subsequence.

Binary tree inplementation under trees in JAVA

There is no trees implementation in java , so i would like to add it