https://github.com/prabhuignoto/datastructure-problems-ts

Datastructure Problems solved using Typescript
https://github.com/prabhuignoto/datastructure-problems-ts

datastructures interview linked-list linkedlist problem-solving typescript

Last synced: 5 days ago
JSON representation

Datastructure Problems solved using Typescript

• Host: GitHub
• URL: https://github.com/prabhuignoto/datastructure-problems-ts
• Owner: prabhuignoto
• Created: 2019-01-22T07:37:10.000Z (about 6 years ago)
• Default Branch: master
• Last Pushed: 2019-01-28T17:14:18.000Z (almost 6 years ago)
• Last Synced: 2024-11-17T09:44:03.687Z (2 months ago)
• Topics: datastructures, interview, linked-list, linkedlist, problem-solving, typescript
• Language: TypeScript
• Homepage:
• Size: 75.2 KB
• Stars: 2
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# DataStructures Problems

[![Build Status](https://travis-ci.org/prabhuignoto/datastructure-problems-ts.svg?branch=master)](https://travis-ci.org/prabhuignoto/datastructure-problems-ts)

Collection of Datastructure problems solved with Typescript.

## LinkedList

1. [LinkedList Datastructure](./src/problems/Linkedlist/LinkedList)

2. [Implement a Queue using Linkedlist](./src/problems/Linkedlist/Queue)

3. [Implement a Stack using Linkedlist](./src/problems/Linkedlist/Stack)

4. [Get Linkedlist length](./src/problems/Linkedlist/GetLength)

5. [Get the Middle node of a Linkedlist](./src/problems/Linkedlist/GetMiddle)

6. [Reverse a Linkedlist](./src/problems/Linkedlist/Reverse)

7. [Rotate a Linkedlist N times](./src/problems/Linkedlist/Rotate)

8. [Traverse a Linkedlist (forward/backward)](./src/problems/Linkedlist/Traverse)

9. [Merge two sorted Linked lists](./src/problems/Linkedlist/MergeSortedList)

10. [Sort a Linkedlist of values(0,1,2)](./src/problems/Linkedlist/Sort012)

11. [Validate if a Linkedlist is a Palindrome or not](./src/problems/Linkedlist/IsPalindrome)

12. [Insert a value in a sorted Linkedlist](./src/problems/Linkedlist/InsertInSortedList)

13. [Linked List Equality](./src/problems/Linkedlist/isEqual)

## BinaryTree

1. [BinaryTree Datastructure](./src/problems/BinaryTree/BinaryTree)

2. [Depth First Traversal](./src/problems/BinaryTree/Traversal)

3. [Level Order Traversal](./src/problems/BinaryTree/Traversal)

4. [InOrder Traversal](./src/problems/BinaryTree/Traversal)

5. [Post-Order Traversal](./src/problems/BinaryTree/Traversal)

6. [Pre-Order Traversal](./src/problems/BinaryTree/Traversal)

7. [Binary Search Tree](./src/problems/BinaryTree/BinarySearchTree)

8. [Count the Number of leaves in a Tree](./src/problems/BinaryTree/CountLeaves)

9. [Check if a Binary Tree is full](./src/problems/CheckFullBinary)

## Arrays

1. [Remove Duplicates](./src/problems/Arrays/Duplicates)

2. [Find all Leaders in a Array](./src/problems/Arrays/Leaders)

## Installation

```bash

yarn install

```

## Tests

```bash

yarn test

```

## Contributing

Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.

Please make sure to update tests as appropriate.

## License

[MIT](https://choosealicense.com/licenses/mit/)