[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"academy-blogs-en-1-1-all-js2go-ep31-queues-stacks-all--*":3,"academy-blog-translations-9on9ct4eug2l93u":75},{"data":4,"page":74,"perPage":74,"totalItems":74,"totalPages":74},[5],{"alt":6,"collectionId":7,"collectionName":8,"content":9,"cover_image":10,"cover_image_path":11,"created":12,"created_by":13,"expand":14,"id":68,"keywords":69,"locale":44,"published_at":70,"scheduled_at":13,"school_blog":66,"short_description":71,"slug":72,"status":64,"title":6,"updated":73,"updated_by":13,"views":67},"JS2GO EP.31 Using Queues and Stacks in JavaScript and Go","sclblg987654321","school_blog_translations","\u003Cp>Queues and Stacks are linear data structures that manage data in a specific order, essential for task management, recursion, undo\u002Fredo operations, or queue systems in real-world projects. In this article, we’ll explore how to create and use Queues and Stacks in JavaScript and Go, including practical examples and best practices.\u003C\u002Fp>\u003Cp> \u003C\u002Fp>\u003Ch2>1. Stack\u003C\u002Fh2>\u003Cp> \u003C\u002Fp>\u003Cp>A \u003Cstrong>Stack\u003C\u002Fstrong> is a data structure following \u003Cstrong>LIFO (Last In, First Out)\u003C\u002Fstrong> principle.\u003C\u002Fp>\u003Cp> \u003C\u002Fp>\u003Cp>\u003Cstrong>JavaScript: Stack using Array\u003C\u002Fstrong>\u003C\u002Fp>\u003Cpre>\u003Ccode class=\"language-javascript\">const stack = [];\n\n\u002F\u002F Push\nstack.push(1);\nstack.push(2);\nstack.push(3);\n\nconsole.log(stack); \u002F\u002F [1,2,3]\n\n\u002F\u002F Pop\nconst top = stack.pop();\nconsole.log(top);   \u002F\u002F 3\nconsole.log(stack); \u002F\u002F [1,2]\n\u003C\u002Fcode>\u003C\u002Fpre>\u003Cp> \u003C\u002Fp>\u003Cp>\u003Cstrong>Best Practices in JavaScript:\u003C\u002Fstrong>\u003Cbr>✔️ Use for undo\u002Fredo, function calls, recursion\u003Cbr>✔️ JS arrays can be used directly with push\u002Fpop\u003C\u002Fp>\u003Cp> \u003C\u002Fp>\u003Cp>\u003Cstrong>Go: Stack using Slice\u003C\u002Fstrong>\u003C\u002Fp>\u003Cpre>\u003Ccode class=\"language-plaintext language-go\">package main\n\nimport \"fmt\"\n\nfunc main() {\n    stack := []int{}\n\n    \u002F\u002F Push\n    stack = append(stack, 1)\n    stack = append(stack, 2)\n    stack = append(stack, 3)\n    fmt.Println(stack) \u002F\u002F [1 2 3]\n\n    \u002F\u002F Pop\n    top := stack[len(stack)-1]\n    stack = stack[:len(stack)-1]\n    fmt.Println(top)   \u002F\u002F 3\n    fmt.Println(stack) \u002F\u002F [1 2]\n}\n\u003C\u002Fcode>\u003C\u002Fpre>\u003Cp> \u003C\u002Fp>\u003Cp>\u003Cstrong>Best Practices in Go:\u003C\u002Fstrong>\u003Cbr>✔️ Slice can append\u002Fpop easily\u003Cbr>⚠️ Be careful with index out-of-range errors\u003C\u002Fp>\u003Cp> \u003C\u002Fp>\u003Ch2>2. Queue\u003C\u002Fh2>\u003Cp> \u003C\u002Fp>\u003Cp>A \u003Cstrong>Queue\u003C\u002Fstrong> is a data structure following \u003Cstrong>FIFO (First In, First Out)\u003C\u002Fstrong> principle.\u003C\u002Fp>\u003Cp> \u003C\u002Fp>\u003Cp>\u003Cstrong>JavaScript: Queue using Array\u003C\u002Fstrong>\u003C\u002Fp>\u003Cpre>\u003Ccode class=\"language-javascript\">const queue = [];\n\n\u002F\u002F Enqueue\nqueue.push(1);\nqueue.push(2);\nqueue.push(3);\n\n\u002F\u002F Dequeue\nconst first = queue.shift();\nconsole.log(first); \u002F\u002F 1\nconsole.log(queue); \u002F\u002F [2,3]\n\u003C\u002Fcode>\u003C\u002Fpre>\u003Cp> \u003C\u002Fp>\u003Cp>\u003Cstrong>Best Practices in JavaScript:\u003C\u002Fstrong>\u003Cbr>✔️ Use for task scheduling, event queue\u003Cbr>⚠️ \u003Ccode inline=\"\">shift()\u003C\u002Fcode> has performance cost for large arrays → consider linked list or deque for production\u003C\u002Fp>\u003Cp> \u003C\u002Fp>\u003Cp>\u003Cstrong>Go: Queue using Slice\u003C\u002Fstrong>\u003C\u002Fp>\u003Cpre>\u003Ccode class=\"language-plaintext language-go\">package main\n\nimport \"fmt\"\n\nfunc main() {\n    queue := []int{}\n\n    \u002F\u002F Enqueue\n    queue = append(queue, 1)\n    queue = append(queue, 2)\n    queue = append(queue, 3)\n\n    \u002F\u002F Dequeue\n    first := queue[0]\n    queue = queue[1:]\n    fmt.Println(first) \u002F\u002F 1\n    fmt.Println(queue) \u002F\u002F [2 3]\n}\n\u003C\u002Fcode>\u003C\u002Fpre>\u003Cp> \u003C\u002Fp>\u003Cp>\u003Cstrong>Best Practices in Go:\u003C\u002Fstrong>\u003Cbr>✔️ Slice can append\u002Fdequeue easily\u003Cbr>⚠️ For large queues, consider \u003Ccode inline=\"\">container\u002Flist\u003C\u002Fcode> for efficiency\u003C\u002Fp>\u003Cp> \u003C\u002Fp>\u003Ch2>3. Real-World Usage of Queues and Stacks\u003C\u002Fh2>\u003Cp> \u003C\u002Fp>\u003Cp>✔️ \u003Cstrong>Undo\u002FRedo:\u003C\u002Fstrong> Use stack to store previous states\u003Cbr>✔️ \u003Cstrong>Task Scheduling:\u003C\u002Fstrong> Use queue for background tasks\u003Cbr>✔️ \u003Cstrong>DFS\u002FBFS Algorithms:\u003C\u002Fstrong> Stack\u002FQueue are core structures\u003Cbr>✔️ \u003Cstrong>Concurrent Queue (Go):\u003C\u002Fstrong> Use channel for concurrent operations\u003C\u002Fp>\u003Cp> \u003C\u002Fp>\u003Cp>\u003Cstrong>Example in Go: Concurrent Queue with Channel\u003C\u002Fstrong>\u003C\u002Fp>\u003Cpre>\u003Ccode class=\"language-plaintext language-go\">ch := make(chan int, 5)\ngo func() {\n    for i := 1; i <= 5; i++ {\n        ch <- i \u002F\u002F Enqueue\n    }\n    close(ch)\n}()\n\nfor val := range ch {\n    fmt.Println(val) \u002F\u002F Dequeue\n}\n\u003C\u002Fcode>\u003C\u002Fpre>\u003Cp> \u003C\u002Fp>\u003Ch2>4. Comparison: JavaScript vs Go\u003C\u002Fh2>\u003Cp> \u003C\u002Fp>\u003Cfigure class=\"table\">\u003Ctable>\u003Cthead>\u003Ctr>\u003Cth>Feature\u003C\u002Fth>\u003Cth>JavaScript\u003C\u002Fth>\u003Cth>Go\u003C\u002Fth>\u003C\u002Ftr>\u003C\u002Fthead>\u003Ctbody>\u003Ctr>\u003Ctd>Stack\u003C\u002Ftd>\u003Ctd>Array push()\u002Fpop()\u003C\u002Ftd>\u003Ctd>Slice append\u002Fpop\u003C\u002Ftd>\u003C\u002Ftr>\u003Ctr>\u003Ctd>Queue\u003C\u002Ftd>\u003Ctd>Array push()\u002Fshift()\u003C\u002Ftd>\u003Ctd>Slice append\u002Fdequeue or channel\u003C\u002Ftd>\u003C\u002Ftr>\u003Ctr>\u003Ctd>Type Safety\u003C\u002Ftd>\u003Ctd>❌ No\u003C\u002Ftd>\u003Ctd>✔️ Yes\u003C\u002Ftd>\u003C\u002Ftr>\u003Ctr>\u003Ctd>Concurrent Queue\u003C\u002Ftd>\u003Ctd>Manual \u002F library\u003C\u002Ftd>\u003Ctd>Channel (built-in)\u003C\u002Ftd>\u003C\u002Ftr>\u003Ctr>\u003Ctd>Use Cases\u003C\u002Ftd>\u003Ctd>Undo\u002FRedo, recursion\u003C\u002Ftd>\u003Ctd>Task scheduling, concurrency\u003C\u002Ftd>\u003C\u002Ftr>\u003C\u002Ftbody>\u003C\u002Ftable>\u003C\u002Ffigure>\u003Cp> \u003C\u002Fp>\u003Cp>\u003Cstrong>Recommendations:\u003C\u002Fstrong>\u003Cbr>✔️ Frontend \u002F lightweight tasks → JavaScript Array stack\u002Fqueue\u003Cbr>✔️ Backend \u002F concurrent tasks → Go slice stack\u002Fqueue or channel\u003C\u002Fp>\u003Cp> \u003C\u002Fp>\u003Chr>\u003Cp> \u003C\u002Fp>\u003Ch2>\u003Cstrong>Next Episode\u003C\u002Fstrong>\u003C\u002Fh2>\u003Cp> \u003C\u002Fp>\u003Cp>In \u003Cstrong>EP.32\u003C\u002Fstrong> of the JS2GO series, we will explore \u003Cstrong>Linked Lists in Go vs JavaScript\u003C\u002Fstrong> to understand dynamic node management and apply it to complex data structures.\u003C\u002Fp>\u003Cp> \u003C\u002Fp>\u003Cp data-start=\"498\" data-end=\"834\">\u003Cstrong>Read more\u003C\u002Fstrong>\u003C\u002Fp>\u003Cul>\u003Cli>\u003Cp data-start=\"498\" data-end=\"834\">\u003Ca target=\"_blank\" rel=\"noopener noreferrer\" href=\"https:\u002F\u002Fwww.superdev.school\u002Fblogs\u002Fcategories\u002FGolang\">\u003Cstrong>Golang The Series\u003C\u002Fstrong>\u003C\u002Fa>\u003C\u002Fp>\u003C\u002Fli>\u003Cli>\u003Cp data-start=\"498\" data-end=\"834\">\u003Ca target=\"_blank\" rel=\"noopener noreferrer\" href=\"https:\u002F\u002Fwww.superdev.school\u002Fblogs\u002Fcategories\u002FJS2GO\">\u003Cstrong>JS2GO\u003C\u002Fstrong>\u003C\u002Fa>\u003C\u002Fp>\u003C\u002Fli>\u003Cli>\u003Cp data-start=\"498\" data-end=\"834\">\u003Ca target=\"_blank\" rel=\"noopener noreferrer\" href=\"https:\u002F\u002Fwww.superdev.school\u002Fen\u002Fblogs\u002Fcategories\u002FTailwind%20CSS\">\u003Cstrong>10 Eps That Will Make You a Pro Tailwind CSS Overnight\u003C\u002Fstrong>\u003C\u002Fa>\u003C\u002Fp>\u003C\u002Fli>\u003C\u002Ful>\u003Cp>\u003Cstrong>🔵 Facebook: \u003C\u002Fstrong>\u003Ca target=\"_blank\" rel=\"noopener noreferrer\" href=\"https:\u002F\u002Fwww.facebook.com\u002Fsuperdev.academy.th\">\u003Cstrong>Superdev Academy\u003C\u002Fstrong>\u003C\u002Fa>\u003C\u002Fp>\u003Cp>\u003Cstrong>🔴 YouTube: \u003C\u002Fstrong>\u003Ca target=\"_blank\" rel=\"noopener noreferrer\" href=\"https:\u002F\u002Fwww.youtube.com\u002Fchannel\u002FUC2eI2RxcA2zbTqZyHyWIfRg\">\u003Cstrong>Superdev Academy\u003C\u002Fstrong>\u003C\u002Fa>\u003C\u002Fp>\u003Cp>\u003Cstrong>📸 Instagram: \u003C\u002Fstrong>\u003Ca target=\"_blank\" rel=\"noopener noreferrer\" href=\"https:\u002F\u002Fwww.instagram.com\u002Fsuperdevschool\u002F\">\u003Cstrong>Superdev Academy\u003C\u002Fstrong>\u003C\u002Fa>\u003C\u002Fp>\u003Cp>\u003Cstrong>🎬 TikTok: \u003C\u002Fstrong>\u003Ca target=\"_blank\" rel=\"noopener noreferrer\" href=\"https:\u002F\u002Fwww.tiktok.com\u002F@superdevacademy?lang=th-TH\">\u003Cstrong>https:\u002F\u002Fwww.tiktok.com\u002F@superdevacademy?lang=th-TH\u003C\u002Fstrong>\u003C\u002Fa>\u003C\u002Fp>\u003Cp>\u003Cstrong>🌐 Website: \u003C\u002Fstrong>\u003Ca target=\"_blank\" rel=\"noopener noreferrer\" href=\"https:\u002F\u002Fwww.superdevacademy.com\u002Fen\">\u003Cstrong>https:\u002F\u002Fwww.superdevacademy.com\u002Fen\u003C\u002Fstrong>\u003C\u002Fa>\u003Cstrong> \u003C\u002Fstrong>\u003C\u002Fp>","62_11zon_pbg55o74dq.webp","https:\u002F\u002Ftwsme-r2.tumwebsme.com\u002Fsclblg987654321\u002Fy77v0i6s9pf4nfj\u002F62_11zon_pbg55o74dq.webp","2026-03-04 08:45:56.472Z","",{"keywords":15,"locale":38,"school_blog":48},[16,23,28,33],{"collectionId":17,"collectionName":18,"created":19,"created_by":13,"id":20,"name":21,"updated":22,"updated_by":13},"sclkey987654321","school_keywords","2026-03-04 08:45:55.180Z","fvvgsqanqnffcfa","Stacks","2026-04-10 16:13:05.821Z",{"collectionId":17,"collectionName":18,"created":24,"created_by":13,"id":25,"name":26,"updated":27,"updated_by":13},"2026-03-04 08:45:55.463Z","xojsmk01et6d20f","Queues","2026-04-10 16:13:05.899Z",{"collectionId":17,"collectionName":18,"created":29,"created_by":13,"id":30,"name":31,"updated":32,"updated_by":13},"2026-03-04 08:20:42.484Z","vslzz9nvv6n77cx","JavaScript","2026-04-10 16:07:28.339Z",{"collectionId":17,"collectionName":18,"created":34,"created_by":13,"id":35,"name":36,"updated":37,"updated_by":13},"2026-03-04 08:20:11.547Z","ey3puyme01a9bsw","Go","2026-04-10 16:07:25.893Z",{"code":39,"collectionId":40,"collectionName":41,"created":42,"flag":43,"id":44,"is_default":45,"label":46,"updated":47},"en","pbc_1989393366","locales","2026-01-22 11:00:02.726Z","twemoji:flag-united-states","qv9c1llfov2d88z",false,"English","2026-04-10 15:42:46.825Z",{"category":49,"collectionId":50,"collectionName":51,"expand":52,"id":66,"views":67},"hsa1afr8fcnd6qb","pbc_2105096300","school_blogs",{"category":53},{"blogIds":54,"collectionId":55,"collectionName":56,"created":57,"created_by":13,"id":49,"image":58,"image_alt":13,"image_path":59,"label":60,"name":61,"priority":62,"publish_at":63,"scheduled_at":13,"status":64,"updated":65,"updated_by":13},[],"sclcatblg987654321","school_category_blogs","2026-03-04 08:24:37.986Z","js2_go_2_11zon_y6paxmuz32.webp","https:\u002F\u002Ftwsme-r2.tumwebsme.com\u002Fsclcatblg987654321\u002Fhsa1afr8fcnd6qb\u002Fjs2_go_2_11zon_y6paxmuz32.webp",{"en":61,"th":61},"JS2GO",10,"2025-08-11 03:41:08.820Z","published","2026-04-25 02:32:14.339Z","9on9ct4eug2l93u",206,"y77v0i6s9pf4nfj",[20,25,30,35],"2025-10-23 06:19:30.943Z","Learn how to create and use Queues and Stacks in JavaScript and Go, with practical code examples and best practices for managing linear data structures efficiently.","js2go-ep31-queues-stacks","2026-04-25 02:47:58.541Z",1,{"en":72}]