10+ Coding Interview Questions

Coding Interview Questions to Help You 10x Your Performance

Reverse a Linked List

[{"selector":"#anim-2dba4c95-7c41-4b69-b078-069bed25e78b","keyframes":{"opacity":[0,1]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-af552d32-0bb5-4aa5-bcab-ccd543afed81","keyframes":{"transform":["translate3d(-103.57143%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-226749c0-393e-4c45-b898-168c947e73c0","keyframes":{"opacity":[0,1]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-cf92fafc-f6db-4cc7-967a-0902fc74c765","keyframes":{"transform":["translate3d(-103.28767%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-c93341c4-5f6a-4e5b-ac1d-e5c2e87332ee","keyframes":{"opacity":[0,1]},"delay":0,"duration":3000,"easing":"cubic-bezier(0.4, 0.4, 0.0, 1)","fill":"both"}] Given a pointer to the head node of a linked list, the task is to reverse the linked list. We need to switch the list by changing the links between nodes. How to solve this Coding problem? Click here

Hamiltonian Path Problem

[{"selector":"#anim-660159f9-1014-4f7f-ae8b-29681c6ac04a","keyframes":{"opacity":[0,1]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-b1d5b8d1-9775-457f-b0ca-8e66c90930f8","keyframes":{"transform":["translate3d(-103.57143%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-cf3ddd82-0fcc-485c-8b13-1077f4cd80a6","keyframes":{"opacity":[0,1]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-d4c46ed7-c7da-4d94-8dd6-d43c41443b5a","keyframes":{"transform":["translate3d(-103.28767%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-6d11d8d2-6784-400f-9c40-a1f907d8d900","keyframes":{"opacity":[0,1]},"delay":0,"duration":3000,"easing":"cubic-bezier(0.4, 0.4, 0.0, 1)","fill":"both"}] How to solve this Coding problem? Given an undirected graph. The task is to print all the Hamiltonian cycles present in the graph. Click here

Balanced Binary tree

[{"selector":"#anim-404ce14b-5b58-4698-9cbe-7b1d2161afee","keyframes":{"opacity":[0,1]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-2271d532-9f4d-44fd-9ab4-444ec4476650","keyframes":{"transform":["translate3d(-103.57143%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-14e35cd3-cd92-4779-8be8-f90c529eb0f2","keyframes":{"opacity":[0,1]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-185dc8f6-7acd-4169-a978-709e26b05447","keyframes":{"transform":["translate3d(-103.28767%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-744e3dd1-3fa2-40a9-aaa4-d5d83ec7762b","keyframes":{"opacity":[0,1]},"delay":0,"duration":3000,"easing":"cubic-bezier(0.4, 0.4, 0.0, 1)","fill":"both"}] Given a binary tree, determine if is height-balanced. How to solve this Coding problem? Click here

Search in Rotated Sorted Array

[{"selector":"#anim-baac3390-48fc-44fa-aee0-e25d072646e2","keyframes":{"opacity":[0,1]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-c19e7781-dfed-41f9-8baf-e445da1dc0f0","keyframes":{"transform":["translate3d(-103.57143%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-722da7d3-71d4-439f-a922-0c7815891e23","keyframes":{"opacity":[0,1]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-f6552d86-69e4-4ea9-916e-a63b73a7d2ba","keyframes":{"transform":["translate3d(-103.56164%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-8236d034-b89b-4c3e-b54b-64d984345fd8","keyframes":{"opacity":[0,1]},"delay":0,"duration":3000,"easing":"cubic-bezier(0.4, 0.4, 0.0, 1)","fill":"both"}] Given an array of distinct elements, which is formed from some places rotation of a sorted array, find if a given element is present in the array or not. How to solve this Coding problem? Click here

Post Correspondence Problem

[{"selector":"#anim-8bb38401-279a-4ad5-a14a-fd8892975207","keyframes":{"opacity":[0,1]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-322758cb-ed79-4cb7-98d9-de1497fa456d","keyframes":{"transform":["translate3d(-103.57143%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-7a0d9055-6d74-4a2c-b850-1571180f34c2","keyframes":{"opacity":[0,1]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-453bc814-1c77-476a-9d40-b30dd06d7b07","keyframes":{"transform":["translate3d(-103.28767%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-35f3b52b-cdbf-4216-b44f-9daf0f138a4c","keyframes":{"opacity":[0,1]},"delay":0,"duration":3000,"easing":"cubic-bezier(0.4, 0.4, 0.0, 1)","fill":"both"}] Given 2 lists of words, find if there exists a sequence such that the concatenation of the words in this order, gives the same word for both lists. How to solve this Coding problem? Click here

Longest Common Substring

[{"selector":"#anim-21b74723-a30d-4513-8960-4952f83be78a","keyframes":{"opacity":[0,1]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-8d9c5125-f8d8-415e-bd5d-f171734ee7dc","keyframes":{"transform":["translate3d(-103.57143%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-fb52fd47-3da3-43d4-a343-1e1b45a87bed","keyframes":{"opacity":[0,1]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-2951e1f8-e5e4-4d2f-969b-0b917ba09e87","keyframes":{"transform":["translate3d(-103.28767%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-ef3ec098-cea6-4589-b531-8486cf8a671f","keyframes":{"opacity":[0,1]},"delay":0,"duration":3000,"easing":"cubic-bezier(0.4, 0.4, 0.0, 1)","fill":"both"}] Given two strings, the task is to find the longest common substring present in the given strings in the same order. How to solve this Coding problem? Click here

Combination Sum

[{"selector":"#anim-2e413329-def8-419e-89e7-098dd07bc2a3","keyframes":{"opacity":[0,1]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-34c31ab4-326e-4ec5-922b-2e961fd11896","keyframes":{"transform":["translate3d(-103.28767%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-193ea861-5c35-418d-8a52-0629104c06a7","keyframes":{"opacity":[0,1]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-485abfe5-df29-4486-8d87-e0979c6fbdfb","keyframes":{"transform":["translate3d(-103.57143%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-9e5508af-d64f-4d5d-bbcf-19db9881208b","keyframes":{"opacity":[0,1]},"delay":0,"duration":3000,"easing":"cubic-bezier(0.4, 0.4, 0.0, 1)","fill":"both"}] Given an array, a[], consisting of distinct elements, and a target sum, find all the unique combinations in the array where the sum is equal to the target sum. How to solve this Coding problem? Click here

Sort String (C++, Java and Python)

[{"selector":"#anim-691609fc-6105-4d12-974f-910f43c67e5d","keyframes":{"opacity":[0,1]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-6c20d9dd-8528-44db-a4dd-871801008cea","keyframes":{"transform":["translate3d(-103.0137%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-6169e4cd-94ad-4fb1-a88e-8b4abd3a9380","keyframes":{"opacity":[0,1]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-6068fd8c-2756-422c-8aed-f9d38cf18ad4","keyframes":{"transform":["translate3d(-103.57143%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-3585077e-e02c-4ab0-8379-cf90e6e5f880","keyframes":{"opacity":[0,1]},"delay":0,"duration":3000,"easing":"cubic-bezier(0.4, 0.4, 0.0, 1)","fill":"both"}] Given a string S of lowercase English characters ‘a’ – ‘z’. The task is to sort the string. How to solve this Coding problem? Click here

Reverse Level Order Traversal

[{"selector":"#anim-d645e37f-0769-4fb2-907a-785eaadbfcb4","keyframes":{"opacity":[0,1]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-ef690f3c-ba9d-4d60-a3e1-9e294be252f2","keyframes":{"transform":["translate3d(-103.57143%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-fa2517d1-0460-4f9d-ad97-c764facc27b6","keyframes":{"opacity":[0,1]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-31731658-7d61-491d-8b1a-d99b61e66a6d","keyframes":{"transform":["translate3d(-103.28767%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-5bcce186-6bc5-413f-ae15-70a9a45cf792","keyframes":{"opacity":[0,1]},"delay":0,"duration":3000,"easing":"cubic-bezier(0.4, 0.4, 0.0, 1)","fill":"both"}] Given a binary tree, return the reverse level order traversal of its nodes’ values. (i.e, from left to right and from the last level to starting level). How to solve this Coding problem? Click here

Remove Duplicates from Array

[{"selector":"#anim-709cfca8-6606-4a9b-bb49-1036a934e07b","keyframes":{"opacity":[0,1]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-1d9285f6-3163-4230-ab25-971221f8b2ba","keyframes":{"transform":["translate3d(-103.57143%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":390,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-b5286158-8fdb-4312-8bf6-65ad47204cbe","keyframes":{"opacity":[0,1]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-21df8322-730b-4672-a853-3200c49767c3","keyframes":{"transform":["translate3d(-103.28767%, 0px, 0)","translate3d(0px, 0px, 0)"]},"delay":600,"duration":800,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-37b8c88a-79a0-42c7-8eec-f26ffdd72ac5","keyframes":{"opacity":[0,1]},"delay":0,"duration":3000,"easing":"cubic-bezier(0.4, 0.4, 0.0, 1)","fill":"both"}] Given an array of integers, the task is to remove the duplicates from the array. How to solve this Coding problem? Click here

Check out Scaler's Career Plan, a comprehensive program designed to help you navigate your career path. Click the link to learn more!

Sign up for Scaler's free masterclasses and events to learn about the latest trends in the IT industry and become a pro. Don't hesitate any longer, register today!

[{"selector":"#anim-2c297e87-1c45-4303-9654-5985231bace2","keyframes":{"opacity":[0,1]},"delay":0,"duration":1000,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-d6120847-530e-49d5-a6e6-adaf95b01864","keyframes":{"transform":["translate3d(0px, -232.85323%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":1000,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-55261f54-dda3-4d2c-9a6b-806ab988d18e","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-81c30297-ca99-4e77-a3f6-f6126a9ff147","keyframes":{"transform":["translate3d(0px, -295.9701%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] Want to Enhance your Coding Skills? Read More