Skip to content
/ DSA-Zero-to-Hero Public

This Repository contains all DSA questions which is studied by apna college in ALPHA Batch 1

1 star 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

rishu8090/DSA-Zero-to-Hero

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

119 Commits
0 1 Knapsack Problem by DP.java
0 1 Knapsack Problem by DP.java
 
 
Abstraction.java
Abstraction.java
 
 
Activity Selection SolveBy2DArray.java
Activity Selection SolveBy2DArray.java
 
 
Activity Selection.java
Activity Selection.java
 
 
All Path from source to Target.java
All Path from source to Target.java
 
 
App.java
App.java
 
 
Arraylist.java
Arraylist.java
 
 
Articulation Point by Tarjan Algo.java
Articulation Point by Tarjan Algo.java
 
 
BFS Search in Graphs.java
BFS Search in Graphs.java
 
 
Basic Recurrsion.java
Basic Recurrsion.java
 
 
Basic inheritance.java
Basic inheritance.java
 
 
Bellman Algorithm.java
Bellman Algorithm.java
 
 
Binary Tree Traversals.java
Binary Tree Traversals.java
 
 
Binary to decimal inversion using functions.java
Binary to decimal inversion using functions.java
 
 
Bipartite Graph.java
Bipartite Graph.java
 
 
Bit Manipulation.java
Bit Manipulation.java
 
 
Bubble Sort.java
Bubble Sort.java
 
 
Build Tree Preorder.java
Build Tree Preorder.java
 
 
Build a BST.java
Build a BST.java
 
 
Buy and Sell Stocks.java
Buy and Sell Stocks.java
 
 
Cheapest Flights within K Stops.java
Cheapest Flights within K Stops.java
 
 
Chocola Problem.java
Chocola Problem.java
 
 
Ciruclar Linked List.java
Ciruclar Linked List.java
 
 
Classes , objects and constructor.java
Classes , objects and constructor.java
 
 
Climbing Stairs By DP.java
Climbing Stairs By DP.java
 
 
Coin Change Problem by DP.java
Coin Change Problem by DP.java
 
 
Connect n Ropes with min cost.java
Connect n Ropes with min cost.java
 
 
Connecting cities with Min cost.java
Connecting cities with Min cost.java
 
 
Connecting components in Graphs.java
Connecting components in Graphs.java
 
 
Container with most Water.java
Container with most Water.java
 
 
Convert BST to Balanced BST.java
Convert BST to Balanced BST.java
 
 
Copy constructor.java
Copy constructor.java
 
 
Count Nodes of a Tree.java
Count Nodes of a Tree.java
 
 
Count Unique Substring.java
Count Unique Substring.java
 
 
Counting Sort.java
Counting Sort.java
 
 
Creating a 2D array.java
Creating a 2D array.java
 
 
Creating a Graph (Adjacency List).java
Creating a Graph (Adjacency List).java
 
 
Cycle Detection Directed Graph.java
Cycle Detection Directed Graph.java
 
 
Cycle Detection Undirected Graph.java
Cycle Detection Undirected Graph.java
 
 
DFS Search in Graphs.java
DFS Search in Graphs.java
 
 
Delete a Node From BST.java
Delete a Node From BST.java
 
 
Diagonal sum of array.java
Diagonal sum of array.java
 
 
Diameter of a Tree (Approach 1).java
Diameter of a Tree (Approach 1).java
 
 
Diameter of a Tree (Approach 2).java
Diameter of a Tree (Approach 2).java
 
 
Dijkstra Algorithm code.java
Dijkstra Algorithm code.java
 
 
Disjoint Set Union DS.java
Disjoint Set Union DS.java
 
 
Double ended Queue using JCF.java
Double ended Queue using JCF.java
 
 
DoubleLL and Java framework.java
DoubleLL and Java framework.java
 
 
Duplicate Parentheses.java
Duplicate Parentheses.java
 
 
Edit Distance by DP.java
Edit Distance by DP.java
 
 
Fibonacci numbers by DP.java
Fibonacci numbers by DP.java
 
 
Find Itinerary for Tickets.java
Find Itinerary for Tickets.java
 
 
First Non-repeating character.java
First Non-repeating character.java
 
 
Flood Fill Algo.java
Flood Fill Algo.java
 
 
Fractional Knapsack.java
Fractional Knapsack.java
 
 
Grid Ways.java
Grid Ways.java
 
 
Has Path or Not.java
Has Path or Not.java
 
 
HashMap Implementation code.java
HashMap Implementation code.java
 
 
Hashmap Basic.java
Hashmap Basic.java
 
 
Heap Sort.java
Heap Sort.java
 
 
Height of a Tree.java
Height of a Tree.java
 
 
Implementation of Heaps.java
Implementation of Heaps.java
 
 
Implements Stack and Queue using Deque.java
Implements Stack and Queue using Deque.java
 
 
Inbuilt Sort.java
Inbuilt Sort.java
 
 
Indian Coin problem.java
Indian Coin problem.java
 
 
Insertion Sorting.java
Insertion Sorting.java
 
 
Insertion in Tries.java
Insertion in Tries.java
 
 
Interfaces.java
Interfaces.java
 
 
Interleave of 2 halves of a Queue.java
Interleave of 2 halves of a Queue.java
 
 
Is a string palindrome or not.java
Is a string palindrome or not.java
 
 
Iteration on HashSets.java
Iteration on HashSets.java
 
 
Job Sequencing Problem.java
Job Sequencing Problem.java
 
 
Kruskal Algo for MST.java
Kruskal Algo for MST.java
 
 
Kth Ancestor of a Node.java
Kth Ancestor of a Node.java
 
 
Kth Level of a Tree.java
Kth Level of a Tree.java
 
 
Largest Subarray with Sum 0.java
Largest Subarray with Sum 0.java
 
 
LinkedList.java
LinkedList.java
 
 
Longest Comman SubString.java
Longest Comman SubString.java
 
 
Longest Comman Subsequence by DP.java
Longest Comman Subsequence by DP.java
 
 
Longest Increasing Subsequence By DP.java
Longest Increasing Subsequence By DP.java
 
 
Longest Word with all Prefixes.java
Longest Word with all Prefixes.java
 
 
Lowest Comman Ancestor (Approach 1).java
Lowest Comman Ancestor (Approach 1).java
 
 
Lowest Comman Ancestors (Approach 2).java
Lowest Comman Ancestors (Approach 2).java
 
 
Majority Elements.java
Majority Elements.java
 
 
Max Rectangular Area in Histogram.java
Max Rectangular Area in Histogram.java
 
 
Max chain Length of pairs.java
Max chain Length of pairs.java
 
 
Merge 2 BSTs.java
Merge 2 BSTs.java
 
 
Merge Sort.java
Merge Sort.java
 
 
Min sum absolute Diff. Pair.java
Min sum absolute Diff. Pair.java
 
 
Min. Distance btw to 2 nodes.java
Min. Distance btw to 2 nodes.java
 
 
Mirror of a BST.java
Mirror of a BST.java
 
 
Multi-dimensional ArrayList.java
Multi-dimensional ArrayList.java
 
 
Nearby Cars Problem.java
Nearby Cars Problem.java
 
 
Next Greater Element.java
Next Greater Element.java
 
 
Pair -Sum.java
Pair -Sum.java
 
 
Polymorphism.java
Polymorphism.java
 
 
Prefix Problem.java
Prefix Problem.java
 
 
Prims Algorithm for MST.java
Prims Algorithm for MST.java
 
 
Print in Range in BST.java
Print in Range in BST.java
 
 
Print largest String.java
Print largest String.java
 
 

Repository files navigation

This repository contains all DSA questions that are solved in Apna College Dijkstra's Batch.
Helps beginners to tackle DSA questions from Noob to Pro.

About

This Repository contains all DSA questions which is studied by apna college in ALPHA Batch 1

Topics

dsa dsa-algorithm dsa-questions dsapractice

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages