I_lOVE_ROMAN's blog

Problem Solving without STL
By I_lOVE_ROMAN, history, 3 years ago, In English

A famous company in our country recruits people by asking them to solve problems without using C++ STL. Their problemset having problems on Searching Techniques, BFS, DFS, Tree Traversal, Prefix Tree or Trie , Backtracking and A glimpse of Dynamic Programming and many others.

Now I wonder how one can solve problems without STL. Like when using BFS how one can not using queue, vector, etc.

Can anybody please help me how to solve problems without STL?

  • Vote: I like it
  • -24
  • Vote: I do not like it

Comments Comments (2)
| Write comment?
»
3 years ago, # |
  Vote: I like it +9 Vote: I do not like it

You can always use arrays and simulate it as queue or stack or anything for that matter..

→ Reply
»
3 years ago, # |
  Vote: I like it +6 Vote: I do not like it

rainboy writes everything in C.

→ Reply