Readme
2.Pepcoding
- TSP2
  - Level1

Powered by GitBook

On this page

Contents
RecursionAndBacktracking PDF
Stacks PDF
Queues PDF
Linked List PDF PDF2
Generic Tree PDF PDF2
Binary Tree PDF PDF2
Binary Search Tree PDF PDF2
Hash & Heap PDF PDF2
Graph PDF PDF2
DP PDF PDF2
TimeComplexity PDF PDF2

2.Pepcoding

TSP2

Level1

Last updated 2 years ago

Contents

# Sr

Table Of Contents

01

02

03

04

05

06

07

08

09

10

11

RecursionAndBacktracking

Problem

Java Solution

todo

- [x] completed?
- [ ] todo

- [ ] todo

- [] todo

- [] todo

- [] todo

- [] todo

- [] todo

- [] todo

Problem

Java Solution

Problem

Java Solution

Problem

Java Solution

Problem

Java Solution

Problem

Java Solution

Problem

Java Solution

Problem

Java Solution

Problem

Java Solution

Problem

Java Solution

Problem

Java Solution

Articles

Problem

Java Solution

Articles

Problem

Java Solution

Articles

Problem

Java Solution

Articles

Problem

Java Solution

Articles

Problem

Java Solution

Articles

Problem

Java Solution

Articles

Problem

Java Solution

Articles

Problem

Java Solution

Articles

Problem

Java Solution

Articles

Problem

Java Solution

Articles

Problem

Java Solution

Articles

Problem

Java Solution

Articles

Stacks

Queues

Linked List

Generic Tree

Binary Tree

Binary Search Tree

Hash & Heap

Graph

DP

TimeComplexity

Print Decreasing Easy

Print Increasing Easy

Print Increasing Decreasing Easy

Power-linear Easy

Power-logarithmic Easy

Print Zigzag Easy

Display Array Easy

Display Array In Reverse Easy

Max Of An Array Easy

First Index Easy

Last Index Easy

All Indices Of Array

Get Subsequence Easy

Get Stair Paths Easy

Get Maze Paths Easy

Get Maze Path With Jumps

Print Subsequence Easy

Print Stair Paths Easy

Print Maze Paths Easy

Print Maze Paths With Jumps Easy

Print Permutations Easy

Print Encodings

Flood Fill Easy

Target Sum Subsets Easy

N Queens(subset approach)

N Queens(level option approach)

Knights Tour Easy

Duplicate Bracket

Balanced Bracket

Next Greater Element to right

Largest Are Histogram

Sliding Window Maximam

Infix evaluation

infix conversion

Postfix evaluation and conversion

Prefix Evaluation and conversion

Celebrity Problem

Merge Overlapping interval

Smallest Number Following pattern

Minimum Stack -1

Minimum Stack - constant space

Queue to Stack Adapter- push efficient

Queue to Stack Adapter- pop efficient

Stack to Queue Adapter-Add efficient

Stack to Queue Adapter-Remove efficient

Two Stacks in an Array

Add Last In Linked List

Display A Linkedlist

Remove First In Linkedlist

Get Value In Linked List

Add First In Linked List

Add At Index In Linked List

Remove Last In Linked List

Remove At Index In Linked List

Reverse A Linked List (data Iterative)

Reverse Linked List (pointer Iterative)

Linked List To Stack Adapter

Linked List To Queue Adapter

Kth Node From End Of Linked List

Mid Of Linked List

Merge Two Sorted Linked Lists

Merge Sort A Linked List

Remove Duplicates In A Sorted Linked List

Odd Even Linked List Medium

K Reverse In Linked List

Display Reverse (recursive) - Linked List

Reverse Linked List (pointer - Recursive)

Is Linked List A Palindrome?

Fold A Linked List

Add Two Linked Lists

Intersection Point Of Linked Lists

Copy Linkedlist With Random Pointers

Generic Trees - Introduction And Data Members

Generic Tree - Constructor

Display A Generic Tree

Size Of Generic Tree

Maximum In A Generic Tree

Height Of A Generic Tree

Generic Tree - Traversals (pre-order, Post-order)

Level-order Of Generic Tree

Levelorder Linewise (generic Tree)

Levelorder Linewise Zig Zag

Level Order Traversals - More Approaches

Mirror A Generic Tree

Remove Leaves In Generic Tree

Linearize A Generic Tree

Linearize A Generic Tree - Efficient Approach

Find element In Generic Tree

Node To Root Path In Generic Tree

Lowest Common Ancestor (generic Tree)

Distance Between Two Nodes In A Generic Tree

Are Trees Similar In Shape

Are Trees Mirror In Shape

Is Generic Tree Symmetric

Multisolver For Generic Tree

Predecessor And Successor Of An Element

Ceil And Floor In Generic Tree

Kth Largest Element In Tree

Node With Maximum Subtree Sum

Diameter Of Generic Tree

Iterative Preorder And Postorder Of Generic Tree

Iterable And Iterator

Binary Tree - Introduction And Data Members

Binary Tree - Constructor

Display A Binary Tree

Size, Sum, Maximum And Height Of A Binary Tree

Traversals In A Binary Tree

Levelorder Traversal Of Binary Tree

Iterative Pre, Post And Inorder Traversals Of Binary Tree

Find And Nodetorootpath In Binary Tree

Print K Levels Down

Print Nodes K Distance Away

Path To Leaf From Root In Range

Transform To Left-cloned Tree

Transform To Normal From Left-cloned Tree

Print Single Child Nodes

Remove Leaves In Binary Tree

Diameter Of A Binary Tree

Tilt Of Binary Tree

Is A Binary Search Tree

Is Balanced Tree

Largest Bst Subtree

Binary Search Tree - Introduction

Binary Search Tree - Constructor

Size, Sum, Max, Min, Find In Bst

Add Node To Bst

Replace With Sum Of Larger

Target Sum Pair In Bst

Target Sum Pair - Bst - Alternate Approaches

Remove Node From Bst Medium

Heaps - Introduction And Usage

K Largest Elements

Sort K-sorted Array

Median Priority Queue

Merge K Sorted Lists

Hashmap - Introduction

Highest Frequency Character

Get Common Elements - 1

Get Common Elements - 2

Longest Consecutive Sequence Of Elements

Write Priority Queue Using Heap

Efficient Heap Constructor

Heap - Comparable V/s Comparator

Introduction To Graphs And Its Representation

Print All Paths

Multisolver - Smallest, Longest, Ceil, Floor, Kthlargest Path

Get Connected Components Of A Graph

Is Graph Connected

Number Of Islands

Perfect Friends

Hamiltonian Path And Cycle

Breadth First Traversal

Is Graph Cyclic

Is Graph Bipartite

Spread Of Infection

Shortest Path In Weights (dijkstra)

Minimum Wire Required To Connect All Pcs (prims algo)

Order Of Compilation

Iterative Depth First Traversal

Detect cycle in a directed graph Practice GeeksforGeeks

Rotting Oranges - LeetCode

Evaluate Division - LeetCode

Course Schedule - LeetCode

RecursionAndBacktracking

Binary Search Tree

Time Complexity