Data_Structures_and_algorithms

hello, this repository contains all the code of Data Structures and algoritms in Python, for a beginner.

Name		Name	Last commit message	Last commit date
Latest commit History 23 Commits
Abstract_classes_2.ipynb		Abstract_classes_2.ipynb
Abstract_classses.ipynb		Abstract_classses.ipynb
Accessing_retrival_dictionary.ipynb		Accessing_retrival_dictionary.ipynb
Add_Remove_Data_Dictionary.ipynb		Add_Remove_Data_Dictionary.ipynb
All-connected_components_graph.ipynb		All-connected_components_graph.ipynb
All_Subsequences_of_a_string_problem.ipynb		All_Subsequences_of_a_string_problem.ipynb
All_permuatations_of_a_string_problem.ipynb		All_permuatations_of_a_string_problem.ipynb
All_sub_sequences_of_a_string.ipynb		All_sub_sequences_of_a_string.ipynb
BST_class_implementation.ipynb		BST_class_implementation.ipynb
BinaryTree_input.ipynb		BinaryTree_input.ipynb
Binary_search_recursion.ipynb		Binary_search_recursion.ipynb
Binary_tree_implementation.ipynb		Binary_tree_implementation.ipynb
Buy_ticket_problem.ipynb		Buy_ticket_problem.ipynb
Check_if_Node_exists_in_genericTree.ipynb		Check_if_Node_exists_in_genericTree.ipynb
Check_if_array_is_maxHeap.ipynb		Check_if_array_is_maxHeap.ipynb
Construct_Bst.ipynb		Construct_Bst.ipynb
Create_and_insert_duplicate_node_BinaryTree_Problem.ipynb		Create_and_insert_duplicate_node_BinaryTree_Problem.ipynb
Diameter_of_a_BinaryTree.ipynb		Diameter_of_a_BinaryTree.ipynb
Experimental_analysis.ipynb		Experimental_analysis.ipynb
Finally.ipynb		Finally.ipynb
GenericTree_Node_class.ipynb		GenericTree_Node_class.ipynb
Graph_implementation_dfs.ipynb		Graph_implementation_dfs.ipynb
Hash_map_implementation.ipynb		Hash_map_implementation.ipynb
Height_of_GenericTree.ipynb		Height_of_GenericTree.ipynb
Inbuilt_stack&Queues.ipynb		Inbuilt_stack&Queues.ipynb
Innit_method.ipynb		Innit_method.ipynb
Is_tree_a_Bst_problem.ipynb		Is_tree_a_Bst_problem.ipynb
KLargest_problem.ipynb		KLargest_problem.ipynb
KRUSKAL_algo.ipynb		KRUSKAL_algo.ipynb
Keypad_Combinations_problem_solution2.ipynb		Keypad_Combinations_problem_solution2.ipynb
Ksmallest_Elements_In_List.ipynb		Ksmallest_Elements_In_List.ipynb
LargestData_in _binary_tree.ipynb		LargestData_in _binary_tree.ipynb
LargestNode_in_a_binary_tree_problem.ipynb		LargestNode_in_a_binary_tree_problem.ipynb
Level_wise_input_binaryTree.ipynb		Level_wise_input_binaryTree.ipynb
Linked_list_palindrome_check.ipynb		Linked_list_palindrome_check.ipynb
Longest_increasing_subSequence_problem.ipynb		Longest_increasing_subSequence_problem.ipynb
MIn_Cost_path_problem_using_top_down_approach.ipynb		MIn_Cost_path_problem_using_top_down_approach.ipynb
Matrix_cost_multiplication_problem.ipynb		Matrix_cost_multiplication_problem.ipynb
Min_path_Cost_in_a_matrix_problem.ipynb		Min_path_Cost_in_a_matrix_problem.ipynb
Mirror_the_binaryTree.ipynb		Mirror_the_binaryTree.ipynb
Multiple_inheritance.ipynb		Multiple_inheritance.ipynb
N_Queen's_problem.ipynb		N_Queen's_problem.ipynb
Next_larger_than_x_genericTree_problem.ipynb		Next_larger_than_x_genericTree_problem.ipynb
Node_to_root_path_binaryTree.ipynb		Node_to_root_path_binaryTree.ipynb
Node_with_max_data_genericTree.ipynb		Node_with_max_data_genericTree.ipynb
Node_with_maximum_child_sum_genericTree.ipynb		Node_with_maximum_child_sum_genericTree.ipynb
Nodes_k_distance_away_from_nodeX..ipynb		Nodes_k_distance_away_from_nodeX..ipynb
Number_of_nodes_in_genericTree.ipynb		Number_of_nodes_in_genericTree.ipynb
PROTECTED_members.ipynb		PROTECTED_members.ipynb
Printing_LevelWise_BinaryTree_problem.ipynb		Printing_LevelWise_BinaryTree_problem.ipynb
Printing_nodes_levelWise_genericTrees.ipynb		Printing_nodes_levelWise_genericTrees.ipynb
Priority_queue_implementation_maxHeap.ipynb		Priority_queue_implementation_maxHeap.ipynb
Queue_implemaentation_using_array.ipynb		Queue_implemaentation_using_array.ipynb
Queue_implementation_using_LL.ipynb		Queue_implementation_using_LL.ipynb
Quick_sort.ipynb		Quick_sort.ipynb
README.md		README.md
Rat_in_a_maze_problem.ipynb		Rat_in_a_maze_problem.ipynb
Recursion_without_returning_anything.ipynb		Recursion_without_returning_anything.ipynb
Return_All_subset_of_array_problem.ipynb		Return_All_subset_of_array_problem.ipynb
SearchElements_in_BST.ipynb		SearchElements_in_BST.ipynb
Search_in_k1_k2_range_BST.ipynb		Search_in_k1_k2_range_BST.ipynb
Stack_implementation_using_LL.ipynb		Stack_implementation_using_LL.ipynb
Sum_ofNodes_genericTree.ipynb		Sum_ofNodes_genericTree.ipynb
Taking_input_GenericTree.ipynb		Taking_input_GenericTree.ipynb
append_last_toN.ipynb		append_last_toN.ipynb
array_intersection_problem.ipynb		array_intersection_problem.ipynb
array_rotation_problem.ipynb		array_rotation_problem.ipynb
balanced_parenthesis_problem_of_Stacks.ipynb		balanced_parenthesis_problem_of_Stacks.ipynb
bubble_sort_on_LL.ipynb		bubble_sort_on_LL.ipynb
build_BinaryTree_PostOrder_using_inOrder_&_postorder.ipynb		build_BinaryTree_PostOrder_using_inOrder_&_postorder.ipynb
build_BinaryTree_using_InOrder_preorder.ipynb		build_BinaryTree_using_InOrder_preorder.ipynb
check-for_redundant_parenthesis_problem.ipynb		check-for_redundant_parenthesis_problem.ipynb
check_N_in_LL.ipynb		check_N_in_LL.ipynb
class_attribute_tests.ipynb		class_attribute_tests.ipynb
class_methods&static_methods&factory_methods.ipynb		class_methods&static_methods&factory_methods.ipynb
classes&objects.ipynb		classes&objects.ipynb
count_Nodes_Greater_Than_X_binaryTree_problem.ipynb		count_Nodes_Greater_Than_X_binaryTree_problem.ipynb
create_dictionary.ipynb		create_dictionary.ipynb
custom_exceptions.ipynb		custom_exceptions.ipynb
deleting_from_ll.ipynb		deleting_from_ll.ipynb
deleting_ith_from_ll_recursion.ipynb		deleting_ith_from_ll_recursion.ipynb
dijkstra's Algorithm.ipynb		dijkstra's Algorithm.ipynb
duplicate_element.ipynb		duplicate_element.ipynb
else_finally.ipynb		else_finally.ipynb
equilibrium_index_problem.ipynb		equilibrium_index_problem.ipynb
except_error_handling.ipynb		except_error_handling.ipynb
fibonacci_iterative_dp.ipynb		fibonacci_iterative_dp.ipynb
fibonacci_with_dp.ipynb		fibonacci_with_dp.ipynb
firstK_reversal_problem_queues.ipynb		firstK_reversal_problem_queues.ipynb
first_odd_then_even_LL_problem.ipynb		first_odd_then_even_LL_problem.ipynb
getPath_suing_bfs.ipynb		getPath_suing_bfs.ipynb
get_path_in_graph.ipynb		get_path_in_graph.ipynb
getting_mid_point_of_LL.ipynb		getting_mid_point_of_LL.ipynb
graph_bfs.ipynb		graph_bfs.ipynb
handling_exceptions.ipynb		handling_exceptions.ipynb
hasPath_problem.ipynb		hasPath_problem.ipynb
hash_map_improved.ipynb		hash_map_improved.ipynb
heightTree_of_binaryTree_problem.ipynb		heightTree_of_binaryTree_problem.ipynb
huffman_coding.ipynb		huffman_coding.ipynb
inBuilt_Min_heap.ipynb		inBuilt_Min_heap.ipynb

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Data_Structures_and_algorithms

About

Releases

Packages

Languages

azhussainn/Data_Structures_and_algorithms

Folders and files

Latest commit

History

Repository files navigation

Data_Structures_and_algorithms

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages