• 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

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

BlueStone E-commerce Interview Experience

Handle duplicates in Binary Search Tree

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Fibonacci Hashing & Fastest Hashtable

Closed Parentheses checker

Coin Collection Dynamic Programming

Find position of the only set bit

Password Predictor

Print Power Set of a Set

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

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

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

Right view of Binary tree

Best Java Book | Top Java Programming Book for Beginners

Flipkart SDET Interview Experience

Printing Longest Common Subsequence

Flipkart Set 1 On Campus with Answers

Spanning Tree

Doubly linked list

Sort an array according to the order defined by another array

The greedy coins game Dynamic Programming

Diagonal Traversal of Binary Tree

Printing each word reverse in string

TicTacToe Game As Asked in Flipkart

ADOBE Aptitude C Language Test

Singly linked list

Possible sizes of bus to carry n groups of friends

Print vertical sum of all the axis in the given binary tree

Search element in a matrix with all rows and columns in sorted order

Copyright © 2026 · Genesis Framework · WordPress · Log in