I'm a Software Engineer with a Solid Background in Programming Languages (C++, Java, Python, C# ...), Algorithms, Data Structures and Mathematics gained through Participating in Competitive Programming contests over the last 6+ years.
I'm experienced with:
◾️ Graph: Depth-First Search (DFS), Breadth-First Search (BFS), A*, MST, SCC, Floyd Warshall, Max Flow ... etc.
◾️ Trees: balanced tree, BST, AVL, Alpha Beta, Minimax ... etc.
◾️ Divide and Conquer Data Structures: Segment Tree, Treap, Heaps, Centroid Decomposition, B-tree... etc.
◾️ Greedy algorithm: Sorting, KMP, Z ... etc.
◾️ Dynamic Programming.
◾️ Stack, Queue, List .. (linked, array) based.
◾️ Sort Algorithms: Bubble, Insertion, Selection, Counting, Heap, Quick, Merge.
◾️ Search Algorithms: Complete, Binary, Ternary, Meet in the middle.
◾️ Genetic Algorithms.
◾️ Space and Time Complexities.
Looking forward to working with you!