• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

How strtok() Works

April 13, 2015 by Dhaval Dave

strtok() : Split string into tokens
Syntax :

char * strtok ( char * str, const char * delimiters );

Parameters
str C string to truncate.Notice that this string is modified by being broken into smaller strings (tokens). Alternativelly, a null pointer may be specified, in which case the function continues scanning where a previous successful call to the function ended.

delimiters   C string containing the delimiter characters. These can be different from one call to another.

Example

/* strtok example */
 #include <stdio.h>
 #include <string.h>
int main (){
char str[] ="- This, a sample string.";
char * pch;
printf ("Splitting string \"%s\" into tokens:\n",str);
pch = strtok (str," ,.-");
while (pch != NULL){
printf ("%s\n",pch);
pch = strtok (NULL, " ,.-");
}
return 0;
}

code courtesy : cplusplus.com

Why Function strtok() is not Thread Safe / reentrant

The strtok() function uses a intermediate static buffer while parsing, and reuse them at each call so it’s not thread safe.

Solution :

Use  strtok_r() to use strtok as thread safe

 

Similar Articles

Filed Under: Adobe Interview Questions, problem Tagged With: c, string

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Coin Collection Dynamic Programming

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Check Binary Tree is Binary Search Tree or not

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Adobe Interview Questions 8 month Exp

Sequence Finder Dynamic Programming

Maximum size of square sub matrix with all 1’s in a binary matrix

Reversal of LinkedList

Binary Tree Isomorphic to each other

Number of Islands BFS/DFS

Implement a generic binary search algorithm for Integer Double String etc

Amazon Interview Experience – SDE Chennai

VMWare Openings

Generate next palindrome number

Daughter’s Age VeryGood Puzzle

Trapping Rain Water

Apriori algorithm C Code Data Mining

Walmart Labs Interview Experience

Generic Object Oriented Stack with Template

Implement LRU Cache

FizzBuzz Solution C C++

LeetCode: Binary Tree Maximum Path Sum

Find the smallest window in a string containing all characters of another string

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Spanning Tree

BFS (Breath First Search)

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Advanced SQL Injection

LeetCode: Container With Most Water

Convert number to words java

Copyright © 2026 · Genesis Framework · WordPress · Log in