Skip to content

Khantdotcom/Data-Structure-Algorithm-Practice

Repository files navigation

This repository tracks the coding challenges I have solved using data structures and algorithms in C++ and Python, with a focus on pattern recognition and reusable techniques.

Problem Types Covered

  • Arrays and strings (two pointers, sliding window, prefix sums)
  • Binary search (index search, answer-space search)
  • Hashing and frequency-count problems
  • Stack and queue challenges (including valid bracket sequences)
  • Linked list operations (reversal, cycle checks, pointer tricks)
  • Trees and binary trees (traversals, recursion, DFS/BFS)
  • Graph problems (BFS/DFS, shortest path basics, connectivity)
  • Recursion and backtracking (subsets, permutations, constraints)
  • Dynamic programming (1D/2D DP, state transitions, optimization)
  • Greedy strategy problems (local choice, interval-style decisions)
  • Sorting and custom comparator based tasks
  • Math/number theory basics (modulo, divisibility, counting)

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published