josh technology Interview Questions — 22 DSA Problems

22 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked josh technology LeetCode questions for software engineering interviews.

• Move Zeroes (EASY) — Array, Two Pointers
• Add Two Numbers (MEDIUM) — Linked List, Math, Recursion
• Largest Number (MEDIUM) — Array, String, Greedy, Sorting
• Remove Zero Sum Consecutive Nodes from Linked List (MEDIUM) — Hash Table, Linked List
• Maximum Twin Sum of a Linked List (MEDIUM) — Linked List, Two Pointers, Stack
• Reverse Odd Levels of Binary Tree (MEDIUM) — Tree, Depth-First Search, Breadth-First Search, Binary Tree
• Find Bottom Left Tree Value (MEDIUM) — Tree, Depth-First Search, Breadth-First Search, Binary Tree
• Count Pairs Whose Sum is Less than Target (EASY) — Array, Two Pointers, Binary Search, Sorting
• Merge Nodes in Between Zeros (MEDIUM) — Linked List, Simulation
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
• Number of Good Leaf Nodes Pairs (MEDIUM) — Tree, Depth-First Search, Binary Tree
• Find the Minimum and Maximum Number of Nodes Between Critical Points (MEDIUM) — Linked List
• Find the Substring With Maximum Cost (MEDIUM) — Array, Hash Table, String, Dynamic Programming
• Construct Smallest Number From DI String (MEDIUM) — String, Backtracking, Stack, Greedy
• Minimum Swaps to Group All 1's Together II (MEDIUM) — Array, Sliding Window
• Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
• Reverse Nodes in k-Group (HARD) — Linked List, Recursion
• Count Good Nodes in Binary Tree (MEDIUM) — Tree, Depth-First Search, Breadth-First Search, Binary Tree
• Trim a Binary Search Tree (MEDIUM) — Tree, Depth-First Search, Binary Search Tree, Binary Tree
• Remove K Digits (MEDIUM) — String, Stack, Greedy, Monotonic Stack
• Daily Temperatures (MEDIUM) — Array, Stack, Monotonic Stack
• Maximum Difference Between Node and Ancestor (MEDIUM) — Tree, Depth-First Search, Binary Tree