Giter Site home page Giter Site logo

kapilkumar2001 / data-structures-and-algorithms Goto Github PK

View Code? Open in Web Editor NEW
9.0 1.0 67.0 181 KB

Collection of Algorithms and Data structures

Java 82.28% C++ 13.29% C 2.60% Python 1.83%
java cpp hacktoberfest hacktoberfest2021 contributions-welcome python algorithms hacktoberfest2022 hacktoberfest2023

data-structures-and-algorithms's Introduction

Data Structures Series

Collection of Algorithms and Data Structures.

data-structures-and-algorithms's People

Contributors

anandkumar08120 avatar arnav-vivian avatar arora1mayank avatar azimpathan avatar bristi07 avatar chetnachauhan12 avatar ikantibunkar avatar kapilkumar2001 avatar kishore-abhimanyu avatar kishore-tw avatar kunalkabra46 avatar lallunallala87 avatar manasipandey21 avatar paras-mayur avatar princekamariya avatar priyanshuengine avatar reyanchaudhary avatar rockharshitmaurya avatar sam-tripathi avatar saqlainkaleem avatar shabaj-dev avatar shalumishra13 avatar shlokjjw avatar somy123 avatar thakurdiwakar avatar tusharnain4578 avatar umang-bariya avatar varunsharma6956 avatar vedantsharma11 avatar ydvaaman avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar

data-structures-and-algorithms's Issues

Word Break Problem | Backtracking

Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words.
Input: s = "applepenapple", wordDict = ["apple","pen"]
Output: true
Explanation: Return true because "applepenapple" can be segmented as "apple pen apple".
Note that you are allowed to reuse a dictionary word.

I will be happy to contribute this problem in Backtracking section

Add subset problem in backtracking folder

Problem statement:
Given an integer array nums of unique elements, return all possible subsets (the power set).The solution set must not contain duplicate subsets. Return the solution in any order.

Example 1:
Input: nums = [1,2,3]
Output: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]

ArrayPartition added

I have added the arrayparititoning cpp solution. Pls accept my pull request #29

Thanking You,
Shlok Jhunjhunwala.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.