• 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

Spanning Tree

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Binary Tree in Java

Sort Stack in place

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

Word Break Problem

VMWare Openings

Introduction To Number Theory ( Part 1 )

Sort an array according to the order defined by another array

strtok()

Get K Max and Delete K Max in stream of incoming integers

Mirror of Tree

Interfaces in C++ (Abstract Classes in C++)

CodeChef’ RRCOPY

Password Predictor

BlueStone E-commerce Interview Experience

Daughter’s Age VeryGood Puzzle

Reversal of LinkedList

Printing intermediate Integers between one element & next element of array

Printing Longest Common Subsequence

Generic Object Oriented Stack with Template

Edit Distance ( Dynamic Programming )

LeetCode: Container With Most Water

Coin Collection Dynamic Programming

Find position of the only set bit

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

SAP Hiring Off-Campus General Aptitude

Diagonal Traversal of Binary Tree

Leetcode: Edit Distance

TicTacToe Game As Asked in Flipkart

Copyright © 2025 · Genesis Framework · WordPress · Log in