Skip to content

About

First Try with Yourself after see The answer of any Code

Resources

Readme
Activity

Stars

2 stars

Watchers

1 watching

Forks

0 forks
Report repository
BranchesTags

Latest commit

 

History

129 Commits

Folders and files

NameName
Last commit message
Last commit date
Aditya and his building blocks .py
Aditya and his building blocks .py
 
 
Ancestors in Tree.py
Ancestors in Tree.py
 
 
BST k th Largest Number .py
BST k th Largest Number .py
 
 
Binary Tree K level sum.py
Binary Tree K level sum.py
 
 
BinaryTree_Diameter.py
BinaryTree_Diameter.py
 
 
Check Two Nodes are Cousins.py
Check Two Nodes are Cousins.py
 
 
Check the Two Tree are Mirror .java
Check the Two Tree are Mirror .java
 
 
CheckGivenTraversalIsInorderOfBST.py
CheckGivenTraversalIsInorderOfBST.py
 
 
Closest Neighbor in BST .py
Closest Neighbor in BST .py
 
 
Coin Change Problem : Minimum numbers of coins.py
Coin Change Problem : Minimum numbers of coins.py
 
 
Contiguous subarray sum(Kadane ALGO).py
Contiguous subarray sum(Kadane ALGO).py
 
 
Convert _ array into its sorted Index form .py
Convert _ array into its sorted Index form .py
 
 
Count of Subsets Sum with Given Sum .py
Count of Subsets Sum with Given Sum .py
 
 
DFS of Graph.py
DFS of Graph.py
 
 
Depth of odd level leaf .cpp
Depth of odd level leaf .cpp
 
 
Equal Sum Partition in Array .py
Equal Sum Partition in Array .py
 
 
Equal Sum in array GFG.py
Equal Sum in array GFG.py
 
 
Equivalent Sub-Arrays Having all Distinct.py
Equivalent Sub-Arrays Having all Distinct.py
 
 
Eulerian Path in Undirected Graph.py
Eulerian Path in Undirected Graph.py
 
 
Find_MAximumElement_MinimumElement_BinaryTRee.py
Find_MAximumElement_MinimumElement_BinaryTRee.py
 
 
Greedy_knapsack.py
Greedy_knapsack.py
 
 
Happyiest Triplets.py
Happyiest Triplets.py
 
 
Hight of Spiral Tree.py
Hight of Spiral Tree.py
 
 
ISTREEisomorphic.py
ISTREEisomorphic.py
 
 
Inversions_of__Array.py
Inversions_of__Array.py
 
 
Is Binary Search Tree is Heap .py
Is Binary Search Tree is Heap .py
 
 
Is Tree is Binary Search Tree .py
Is Tree is Binary Search Tree .py
 
 
IszeroSumSubArrayContainArray.py
IszeroSumSubArrayContainArray.py
 
 
Job_Sequencing_Problem.py
Job_Sequencing_Problem.py
 
 
K th Smallest Element with Heap.py
K th Smallest Element with Heap.py
 
 
Largest Sum Subarray of Size at least K.py
Largest Sum Subarray of Size at least K.py
 
 
Largest-Number Formed from an array.py
Largest-Number Formed from an array.py
 
 
Leaf Under Budgt .py
Leaf Under Budgt .py
 
 
LeafSumAtMinimumLevel.py
LeafSumAtMinimumLevel.py
 
 
Level Order Traversal .py
Level Order Traversal .py
 
 
Level_of_a_Node_in_Binary_Tree.py
Level_of_a_Node_in_Binary_Tree.py
 
 
Longest Common SubSequence Memoization..py
Longest Common SubSequence Memoization..py
 
 
Longest Common SubSequence Recursive.py
Longest Common SubSequence Recursive.py
 
 
Longest Common Substring.py
Longest Common Substring.py
 
 
Longest Increasing Subsequence On String.cpp
Longest Increasing Subsequence On String.cpp
 
 
Longest Increasing Subsequence With Recursion.py
Longest Increasing Subsequence With Recursion.py
 
 
Longest Increasing Subsequence.py
Longest Increasing Subsequence.py
 
 
Longest Palindrome Subsequence.py
Longest Palindrome Subsequence.py
 
 
Longest Repeating SubSequence .py
Longest Repeating SubSequence .py
 
 
Longest Span with same Sum in two Binary arrays .py
Longest Span with same Sum in two Binary arrays .py
 
 
Longest_Sub_Array_with_Given_Sum_k.py
Longest_Sub_Array_with_Given_Sum_k.py
 
 
Lowest common Ancestor.py
Lowest common Ancestor.py
 
 
Lowest_common_ancessestor.py
Lowest_common_ancessestor.py
 
 
Matrix Chain Multiplication with Memoization .py
Matrix Chain Multiplication with Memoization .py
 
 
Matrix Chain Multiplication.py
Matrix Chain Multiplication.py
 
 
Matrix Multiplication.py
Matrix Multiplication.py
 
 
Max sum subarray by removing at most one element .py
Max sum subarray by removing at most one element .py
 
 
Maximize the sum of selected numbers from an array to make it empty .py
Maximize the sum of selected numbers from an array to make it empty .py
 
 
Maximum difference of zeros and ones in binary string .py
Maximum difference of zeros and ones in binary string .py
 
 
Minimum Cost To Make Two Strings Identical .cpp
Minimum Cost To Make Two Strings Identical .cpp
 
 
Minimum Number of Deletion to make string Palindrome.py
Minimum Number of Deletion to make string Palindrome.py
 
 
Minimum Number of Insertion and Deletion to convert string a to string b .py
Minimum Number of Insertion and Deletion to convert string a to string b .py
 
 
Minimum Subset sum Diffrence .py
Minimum Subset sum Diffrence .py
 
 
Minimum number of deletions to make a sorted sequence .py
Minimum number of deletions to make a sorted sequence .py
 
 
Missing Element in array.py
Missing Element in array.py
 
 
Not a Subset sum .py
Not a Subset sum .py
 
 
Pairs with specific Difference With o(N Log N).cpp
Pairs with specific Difference With o(N Log N).cpp
 
 
Palindrome Partition with Memoization .py
Palindrome Partition with Memoization .py
 
 
Possible_Groups.py
Possible_Groups.py
 
 
Predecessor and Successor with Cpp.cpp
Predecessor and Successor with Cpp.cpp
 
 
Print All Permutation of String.py
Print All Permutation of String.py
 
 
Print Longest common subsequence.py
Print Longest common subsequence.py
 
 
Print Shortest Common SuperSequence.py
Print Shortest Common SuperSequence.py
 
 
Queue Using Two Stacks .py
Queue Using Two Stacks .py
 
 
README.md
README.md
 
 
ROtate and Delete.py
ROtate and Delete.py
 
 
Reverse Alernate Levels .py
Reverse Alernate Levels .py
 
 
Reverse Order of LevelOrder.py
Reverse Order of LevelOrder.py
 
 
Rod_Cutting_Problem.py
Rod_Cutting_Problem.py
 
 
Root to Leaf Paths .py
Root to Leaf Paths .py
 
 
Rotate a 2D array without using extra space .py
Rotate a 2D array without using extra space .py
 
 
Sequence Matching .py
Sequence Matching .py
 
 
Shortest distance in infinite tree.py
Shortest distance in infinite tree.py
 
 
Stock buy and sell .py
Stock buy and sell .py
 
 
Subarray with equal 1s and 0s .py
Subarray with equal 1s and 0s .py
 
 
Sum of Left Leaf Nodes .py
Sum of Left Leaf Nodes .py
 
 
Sum of dependencies in a graph.py
Sum of dependencies in a graph.py
 
 
Sum_of_length_Non_overlaping_subarray.py
Sum_of_length_Non_overlaping_subarray.py
 
 
Target Subarry Sum.py
Target Subarry Sum.py
 
 
Target Sum .py
Target Sum .py
 
 
Tiny_Miny.py
Tiny_Miny.py
 
 
Transform sum in Tree .py
Transform sum in Tree .py
 
 
Trapping Rain Water GeeksForGeeks Problem.py
Trapping Rain Water GeeksForGeeks Problem.py
 
 
Unbounded_Knapsack.py
Unbounded_Knapsack.py
 
 
Vertical Width of Binary Tree.py
Vertical Width of Binary Tree.py
 
 
VerticalTraverseArray.py
VerticalTraverseArray.py
 
 
check Tree leaf are same or not .py
check Tree leaf are same or not .py
 
 
coin_change_problem_.py
coin_change_problem_.py
 
 
common subsequence in Two String Top Down Approach.py
common subsequence in Two String Top Down Approach.py
 
 
common_element In two BST .py
common_element In two BST .py
 
 
count subsets difference with given Difference.py
count subsets difference with given Difference.py
 
 
dpcount.py
dpcount.py
 
 
isTreeisBalanced.py
isTreeisBalanced.py
 
 
mAximum sum biotenic subsequence.py
mAximum sum biotenic subsequence.py
 
 
magic Triplets.py
magic Triplets.py
 
 

Repository files navigation

                                   ===============================                             =========================================
                                        ----------------------                                       -----------------------------
                                    -----          ()          -----                               -----             ()             -----
                                       ----------------------                   /                     -----------------------------
                                                                                /
                                                                                /
                                                                                /
                                                                                /
                                                                                /
                                                                                /
                                                                                /

                                                     \                                                 /
                                                      \                                               /   
                                                       \                                             /
                                                        \============================================



                                                    HAPPY CODING :) I have not Girlfriend but I don't Care Bcz I have Coding Skill so enjoy it ;;;;;; MEANWHILE ;)

Hi, I am Deepak. I am a hardworking engineering student specialized in computer science engineering, i am third year student.Along with my pursing B.tech, I complete some programming skills like c, c++, java and python and various technology , And I learn about machine learning and it's various algorithms. Specialties: python,java, Data Structure Good Communication and Inter personal skills combined with willingness to learn. Proficient in grasping new technologies and utilizing them in an effective manner

GeeksforGeeks_ID : _deepak_01 Hackerrank_Id : deepak_01 Hackerearth_Id : a9649060356 DISQUS_Id :disqus_WWRXvLkeUR GITHUB: deepak01-Hacker

About

First Try with Yourself after see The answer of any Code

Resources

Readme
Activity

Stars

2 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages