Technical Interview -
(Q1) Write some class/interface to represent a credit & debit card

(Q2) Write method to delete the node (and its children) in a tree that has a val=0 + asked time complexity = O(N).

(Q3) Return a linked list with initial structure (1-2-3-4-5-null) that now has structure (1-3-5-2-4-null) + asked time complexity = O(N)

Question

Technical Interview - 
(Q1) Write some class/interface to represent a credit & debit card 

(Q2) Write method to delete the node (and its children) in a tree that has a val=0 + asked time complexity = O(N). 

(Q3) Return a linked list with initial structure (1->2->3->4->5->null) that now has structure (1->3->5->2->4->null) + asked time complexity = O(N)

Capital One

Capital One Interview Question

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches