diff --git a/dynamic_programming/house_robber.cpp b/dynamic_programming/house_robber.cpp
index 3a703c45a..6c17f75e5 100644
--- a/dynamic_programming/house_robber.cpp
+++ b/dynamic_programming/house_robber.cpp
@@ -4,6 +4,7 @@
  * @details
  * Solution of House robber problem uses a dynamic programming concept that
  * works in \f$O(n)\f$ time and works in \f$O(1)\f$ space.
+ * @author [Swastika Gupta](https://github.com/swastyy)
  */
 
 #include <cassert>   /// for assert