• 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

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

VMWare Openings

Find the kth number with prime factors 3, 5 and 7

Generic Object Oriented Stack with Template

Python Dictionaries

Check if an array has duplicate numbers in O(n) time and O(1) space

LeetCode: Binary Tree Maximum Path Sum

Apriori algorithm C Code Data Mining

Fibonacci Hashing & Fastest Hashtable

Leetcode: Edit Distance

Handle duplicates in Binary Search Tree

Generate next palindrome number

Hackerearth : Counting Subarrays

Maximum occurred Smallest integer in n ranges

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

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

Adobe Interview Questions 8 month Exp

SAP Off Campus Hiring_ March 2015 Sample Questions

Leetcode: Merge Intervals

Skiing on Mountains Matrix

C Program for TAIL command of UNIX

Stickler thief

Add Sub Multiply very large number stored as string

Printing Longest Common Subsequence

Given a string, find the first character which is non-repetitive

Linked List V/S Binary Search Tree

Subset Sum Problem Dynamic programming

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

LeetCode : Word Search

Find Percentage of Words matching in Two Strings

Copyright © 2026 · Genesis Framework · WordPress · Log in